TSTP Solution File: GEO245+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO245+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 06:19:35 EDT 2022
% Result : Theorem 0.10s 0.31s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : GEO245+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.03/0.10 % Command : sos-script %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sat Jun 18 00:51:46 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.10/0.31
% 0.10/0.31 -------- PROOF --------
% 0.10/0.31 % SZS status Unsatisfiable
% 0.10/0.31 % SZS output start Refutation
% 0.10/0.31 ----- Otter 3.2, August 2001 -----
% 0.10/0.31 The process was started by sandbox on n032.cluster.edu,
% 0.10/0.31 Sat Jun 18 00:51:46 2022
% 0.10/0.31 The command was "./sos". The process ID is 754.
% 0.10/0.31
% 0.10/0.31 set(prolog_style_variables).
% 0.10/0.31 set(auto).
% 0.10/0.31 dependent: set(auto1).
% 0.10/0.31 dependent: set(process_input).
% 0.10/0.31 dependent: clear(print_kept).
% 0.10/0.31 dependent: clear(print_new_demod).
% 0.10/0.31 dependent: clear(print_back_demod).
% 0.10/0.31 dependent: clear(print_back_sub).
% 0.10/0.31 dependent: set(control_memory).
% 0.10/0.31 dependent: assign(max_mem, 12000).
% 0.10/0.31 dependent: assign(pick_given_ratio, 4).
% 0.10/0.31 dependent: assign(stats_level, 1).
% 0.10/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.31 dependent: assign(sos_limit, 5000).
% 0.10/0.31 dependent: assign(max_weight, 60).
% 0.10/0.31 clear(print_given).
% 0.10/0.31
% 0.10/0.31 formula_list(usable).
% 0.10/0.31
% 0.10/0.31 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=10.
% 0.10/0.31
% 0.10/0.31 This is a non-Horn set without equality. The strategy
% 0.10/0.31 will be ordered hyper_res, ur_res, unit deletion, and
% 0.10/0.31 factoring, with satellites in sos and nuclei in usable.
% 0.10/0.31
% 0.10/0.31 dependent: set(hyper_res).
% 0.10/0.31 dependent: set(factor).
% 0.10/0.31 dependent: set(unit_deletion).
% 0.10/0.31
% 0.10/0.31 ------------> process usable:
% 0.10/0.31 Following clause subsumed by 31 during input processing: 0 [] {-} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 0.10/0.31 Following clause subsumed by 31 during input processing: 0 [] {-} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,reverse_line(C))|unequally_directed_lines(B,reverse_line(C)).
% 0.10/0.31 Following clause subsumed by 36 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.10/0.31 Following clause subsumed by 37 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.10/0.31 Following clause subsumed by 36 during input processing: 0 [unit_del,36,37] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.10/0.31 Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.10/0.31 Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)| -unequally_directed_lines(B,C)|distinct_lines(B,C).
% 0.10/0.31 Following clause subsumed by 37 during input processing: 0 [unit_del,37] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.10/0.31 Following clause subsumed by 36 during input processing: 0 [] {-} -left_apart_point($c2,reverse_line(line_connecting($c3,$c1))).
% 0.10/0.31 36 back subsumes 17.
% 0.10/0.31 36 back subsumes 16.
% 0.10/0.31 36 back subsumes 15.
% 0.10/0.31 36 back subsumes 14.
% 0.10/0.31 36 back subsumes 12.
% 0.10/0.31 36 back subsumes 11.
% 0.10/0.31 36 back subsumes 3.
% 0.10/0.31 36 back subsumes 2.
% 0.10/0.31
% 0.10/0.31 ------------> process sos:
% 0.10/0.31
% 0.10/0.31 ----> UNIT CONFLICT at 0.00 sec ----> 61 [binary,60.1,36.1] {-} $F.
% 0.10/0.31
% 0.10/0.31 Length of proof is 0. Level of proof is 0.
% 0.10/0.31
% 0.10/0.31 ---------------- PROOF ----------------
% 0.10/0.31 % SZS status Theorem
% 0.10/0.31 % SZS output start Refutation
% 0.10/0.31
% 0.10/0.31 36 [] {-} -left_apart_point(A,B).
% 0.10/0.31 60 [] {-} left_apart_point($c1,line_connecting($c3,$c2)).
% 0.10/0.31 61 [binary,60.1,36.1] {-} $F.
% 0.10/0.31
% 0.10/0.31 % SZS output end Refutation
% 0.10/0.31 ------------ end of proof -------------
% 0.10/0.31
% 0.10/0.31
% 0.10/0.31 Search stopped by max_proofs option.
% 0.10/0.31
% 0.10/0.31
% 0.10/0.31 Search stopped by max_proofs option.
% 0.10/0.31
% 0.10/0.31 ============ end of search ============
% 0.10/0.31
% 0.10/0.31 That finishes the proof of the theorem.
% 0.10/0.31
% 0.10/0.31 Process 754 finished Sat Jun 18 00:51:46 2022
%------------------------------------------------------------------------------