%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO215+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:16 EDT 2022
% Result : Theorem 1.20s 1.46s
% Output : Refutation 1.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO215+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 00:01:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n017.cluster.edu,
% 0.12/0.35 Sat Jun 18 00:01:27 2022
% 0.12/0.35 The command was "./sos". The process ID is 12035.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 Following clause subsumed by 6 during input processing: 0 [] {-} -convergent_lines(A,B)| -unorthogonal_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 25
% 0.12/0.40 number of clauses initially in problem: 27
% 0.12/0.40 percentage of clauses intially in UL: 92
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.40 percent of all initial clauses that are short: 100
% 0.12/0.40 absolute distinct symbol count: 12
% 0.12/0.40 distinct predicate count: 5
% 0.12/0.40 distinct function count: 4
% 0.12/0.40 distinct constant count: 3
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 1.20/1.46
% 1.20/1.46 -------- PROOF --------
% 1.20/1.46 % SZS status Theorem
% 1.20/1.46 % SZS output start Refutation
% 1.20/1.46
% 1.20/1.46 Stopped by limit on insertions
% 1.20/1.46
% 1.20/1.46 Model 3 [ 13 1 754 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.46
% 1.20/1.46 Stopped by limit on insertions
% 1.20/1.46
% 1.20/1.46 Model 4 [ 7 1 167 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.46
% 1.20/1.46 Stopped by limit on insertions
% 1.20/1.46
% 1.20/1.46 Stopped by limit on insertions
% 1.20/1.46
% 1.20/1.46 ----> UNIT CONFLICT at 1.07 sec ----> 602 [binary,601.1,15.1] {-} $F.
% 1.20/1.46
% 1.20/1.46 Length of proof is 10. Level of proof is 7.
% 1.20/1.46
% 1.20/1.46 ---------------- PROOF ----------------
% 1.20/1.46 % SZS status Theorem
% 1.20/1.46 % SZS output start Refutation
% 1.20/1.46
% 1.20/1.46 3 [] {+} -convergent_lines(A,A).
% 1.20/1.46 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.20/1.46 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 1.20/1.46 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 1.20/1.46 14 [] {+} -convergent_lines(A,B)|distinct_lines(B,C)|convergent_lines(A,C).
% 1.20/1.46 15 [] {+} -convergent_lines(parallel_through_point(A,B),A).
% 1.20/1.46 23 [] {+} -distinct_lines(A,B)|apart_point_and_line(C,A)|apart_point_and_line(C,B)|unorthogonal_lines(A,D)|unorthogonal_lines(B,D).
% 1.20/1.46 24 [] {+} -unorthogonal_lines($c3,$c1).
% 1.20/1.46 25 [] {+} -unorthogonal_lines($c2,$c1).
% 1.20/1.46 27 [] {-} convergent_lines($c3,$c2).
% 1.20/1.46 31 [hyper,27,14] {-} distinct_lines($c2,A)|convergent_lines($c3,A).
% 1.20/1.46 32 [hyper,27,6] {-} convergent_lines($c3,A)|convergent_lines($c2,A).
% 1.20/1.46 33 [hyper,31,23] {-} convergent_lines($c3,A)|apart_point_and_line(B,$c2)|apart_point_and_line(B,A)|unorthogonal_lines($c2,C)|unorthogonal_lines(A,C).
% 1.20/1.46 36 [hyper,32,6] {-} convergent_lines($c2,A)|convergent_lines($c3,B)|convergent_lines(A,B).
% 1.20/1.46 67 [hyper,36,3] {-} convergent_lines($c2,A)|convergent_lines(A,$c3).
% 1.20/1.46 82 [hyper,33,24,unit_del,3,25] {+} apart_point_and_line(A,$c2)|apart_point_and_line(A,$c3).
% 1.20/1.46 96 [hyper,67,6] {-} convergent_lines(A,$c3)|convergent_lines($c2,B)|convergent_lines(A,B).
% 1.20/1.46 315 [hyper,96,15] {-} convergent_lines(parallel_through_point(A,B),$c3)|convergent_lines($c2,A).
% 1.20/1.46 580 [hyper,82,10,315,unit_del,15] {-} apart_point_and_line(intersection_point($c2,$c3),$c2).
% 1.20/1.46 601 [hyper,580,9,315] {-} convergent_lines(parallel_through_point($c3,A),$c3).
% 1.20/1.46 602 [binary,601.1,15.1] {-} $F.
% 1.20/1.46
% 1.20/1.46 % SZS output end Refutation
% 1.20/1.46 ------------ end of proof -------------
% 1.20/1.46
% 1.20/1.46
% 1.20/1.46 Search stopped by max_proofs option.
% 1.20/1.46
% 1.20/1.46
% 1.20/1.46 Search stopped by max_proofs option.
% 1.20/1.46
% 1.20/1.46 ============ end of search ============
% 1.20/1.46
% 1.20/1.46 ----------- soft-scott stats ----------
% 1.20/1.46
% 1.20/1.46 true clauses given 11 (20.4%)
% 1.20/1.46 false clauses given 43
% 1.20/1.46
% 1.20/1.46 FALSE TRUE
% 1.20/1.46 5 1 6
% 1.20/1.46 6 0 3
% 1.20/1.46 7 4 2
% 1.20/1.46 8 9 4
% 1.20/1.46 9 5 14
% 1.20/1.46 10 8 0
% 1.20/1.46 11 31 0
% 1.20/1.46 12 29 0
% 1.20/1.46 15 4 6
% 1.20/1.46 16 2 0
% 1.20/1.46 17 2 0
% 1.20/1.46 18 9 22
% 1.20/1.46 19 5 0
% 1.20/1.46 21 7 60
% 1.20/1.46 22 0 12
% 1.20/1.46 23 0 15
% 1.20/1.46 24 2 87
% 1.20/1.46 25 0 15
% 1.20/1.46 26 0 9
% 1.20/1.46 27 0 50
% 1.20/1.46 28 0 3
% 1.20/1.46 30 0 15
% 1.20/1.46 tot: 118 323 (73.2% true)
% 1.20/1.46
% 1.20/1.46
% 1.20/1.46 Model 4 [ 7 -71 167 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.46
% 1.20/1.46 That finishes the proof of the theorem.
% 1.20/1.46
% 1.20/1.46 Process 12035 finished Sat Jun 18 00:01:28 2022
%------------------------------------------------------------------------------