%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO212+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:13 EDT 2022
% Result : Theorem 0.46s 0.64s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO212+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.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.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 00:04:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n018.cluster.edu,
% 0.12/0.35 Sat Jun 18 00:04:17 2022
% 0.12/0.35 The command was "./sos". The process ID is 17536.
% 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 ===========
% 0.46/0.64
% 0.46/0.64 -------- PROOF --------
% 0.46/0.64 % SZS status Theorem
% 0.46/0.64 % SZS output start Refutation
% 0.46/0.64
% 0.46/0.64 Stopped by limit on insertions
% 0.46/0.64
% 0.46/0.64 Model 3 [ 3 1 93 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.64
% 0.46/0.64 Stopped by limit on insertions
% 0.46/0.64
% 0.46/0.64 Model 4 [ 1 0 143 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.64
% 0.46/0.64 ----> UNIT CONFLICT at 0.26 sec ----> 183 [binary,182.1,24.1] {-} $F.
% 0.46/0.64
% 0.46/0.64 Length of proof is 7. Level of proof is 7.
% 0.46/0.64
% 0.46/0.64 ---------------- PROOF ----------------
% 0.46/0.64 % SZS status Theorem
% 0.46/0.64 % SZS output start Refutation
% 0.46/0.64
% 0.46/0.64 3 [] {+} -convergent_lines(A,A).
% 0.46/0.64 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.46/0.64 18 [] {+} -convergent_lines(A,B)| -unorthogonal_lines(A,B)|convergent_lines(A,C)|unorthogonal_lines(B,C).
% 0.46/0.64 24 [] {+} -convergent_lines($c3,$c1).
% 0.46/0.64 25 [] {+} -unorthogonal_lines($c2,$c1).
% 0.46/0.64 26 [] {+} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.46/0.64 27 [] {+} unorthogonal_lines($c3,$c2).
% 0.46/0.64 28 [hyper,26,25] {+} convergent_lines($c2,$c1).
% 0.46/0.64 31 [hyper,28,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 0.46/0.64 37 [hyper,31,6] {+} convergent_lines($c1,A)|convergent_lines($c2,B)|convergent_lines(A,B).
% 0.46/0.64 156 [hyper,37,18,27,unit_del,3] {-} convergent_lines($c1,$c3)|convergent_lines($c3,A)|unorthogonal_lines($c2,A).
% 0.46/0.64 169 [hyper,156,25,unit_del,24] {-} convergent_lines($c1,$c3).
% 0.46/0.64 174 [hyper,169,6] {-} convergent_lines($c1,A)|convergent_lines($c3,A).
% 0.46/0.64 182 [hyper,174,3] {-} convergent_lines($c3,$c1).
% 0.46/0.64 183 [binary,182.1,24.1] {-} $F.
% 0.46/0.64
% 0.46/0.64 % SZS output end Refutation
% 0.46/0.64 ------------ end of proof -------------
% 0.46/0.64
% 0.46/0.64
% 0.46/0.64 Search stopped by max_proofs option.
% 0.46/0.64
% 0.46/0.64
% 0.46/0.64 Search stopped by max_proofs option.
% 0.46/0.64
% 0.46/0.64 ============ end of search ============
% 0.46/0.64
% 0.46/0.64 ----------- soft-scott stats ----------
% 0.46/0.64
% 0.46/0.64 true clauses given 15 (46.9%)
% 0.46/0.64 false clauses given 17
% 0.46/0.64
% 0.46/0.64 FALSE TRUE
% 0.46/0.64 6 0 3
% 0.46/0.64 7 0 1
% 0.46/0.64 8 0 4
% 0.46/0.64 9 1 3
% 0.46/0.64 10 1 0
% 0.46/0.64 11 5 6
% 0.46/0.64 12 0 10
% 0.46/0.64 14 3 0
% 0.46/0.64 15 1 3
% 0.46/0.64 16 0 2
% 0.46/0.64 17 2 2
% 0.46/0.64 18 1 11
% 0.46/0.64 19 2 2
% 0.46/0.64 20 3 3
% 0.46/0.64 21 0 10
% 0.46/0.64 22 0 6
% 0.46/0.64 23 0 6
% 0.46/0.64 24 0 3
% 0.46/0.64 26 0 1
% 0.46/0.64 27 0 3
% 0.46/0.64 tot: 19 79 (80.6% true)
% 0.46/0.64
% 0.46/0.64
% 0.46/0.64 Model 4 [ 1 -11 143 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.64
% 0.46/0.64 That finishes the proof of the theorem.
% 0.46/0.64
% 0.46/0.64 Process 17536 finished Sat Jun 18 00:04:18 2022
%------------------------------------------------------------------------------