TSTP Solution File: GEO212+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO212+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:14 EDT 2022
% Result : Theorem 0.65s 0.86s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GEO212+2 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.15 % Command : sos-script %s
% 0.15/0.37 % Computer : n004.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Sat Jun 18 01:42:53 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.15/0.39 ----- Otter 3.2, August 2001 -----
% 0.15/0.39 The process was started by sandbox on n004.cluster.edu,
% 0.15/0.39 Sat Jun 18 01:42:53 2022
% 0.15/0.39 The command was "./sos". The process ID is 21860.
% 0.15/0.39
% 0.15/0.39 set(prolog_style_variables).
% 0.15/0.39 set(auto).
% 0.15/0.39 dependent: set(auto1).
% 0.15/0.39 dependent: set(process_input).
% 0.15/0.39 dependent: clear(print_kept).
% 0.15/0.39 dependent: clear(print_new_demod).
% 0.15/0.39 dependent: clear(print_back_demod).
% 0.15/0.39 dependent: clear(print_back_sub).
% 0.15/0.39 dependent: set(control_memory).
% 0.15/0.39 dependent: assign(max_mem, 12000).
% 0.15/0.39 dependent: assign(pick_given_ratio, 4).
% 0.15/0.39 dependent: assign(stats_level, 1).
% 0.15/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.39 dependent: assign(sos_limit, 5000).
% 0.15/0.39 dependent: assign(max_weight, 60).
% 0.15/0.39 clear(print_given).
% 0.15/0.39
% 0.15/0.39 formula_list(usable).
% 0.15/0.39
% 0.15/0.39 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.15/0.39
% 0.15/0.39 This is a non-Horn set without equality. The strategy
% 0.15/0.39 will be ordered hyper_res, ur_res, unit deletion, and
% 0.15/0.39 factoring, with satellites in sos and nuclei in usable.
% 0.15/0.39
% 0.15/0.39 dependent: set(hyper_res).
% 0.15/0.39 dependent: set(factor).
% 0.15/0.39 dependent: set(unit_deletion).
% 0.15/0.39
% 0.15/0.39 ------------> process usable:
% 0.15/0.39 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.15/0.39
% 0.15/0.39 ------------> process sos:
% 0.15/0.39
% 0.15/0.39 ======= end of input processing =======
% 0.15/0.43
% 0.15/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.43
% 0.15/0.43 Stopped by limit on number of solutions
% 0.15/0.43
% 0.15/0.43
% 0.15/0.43 -------------- Softie stats --------------
% 0.15/0.43
% 0.15/0.43 UPDATE_STOP: 300
% 0.15/0.43 SFINDER_TIME_LIMIT: 2
% 0.15/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.43 number of clauses in intial UL: 25
% 0.15/0.43 number of clauses initially in problem: 27
% 0.15/0.43 percentage of clauses intially in UL: 92
% 0.15/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.15/0.43 percent of all initial clauses that are short: 100
% 0.15/0.43 absolute distinct symbol count: 12
% 0.15/0.43 distinct predicate count: 5
% 0.15/0.43 distinct function count: 4
% 0.15/0.43 distinct constant count: 3
% 0.15/0.43
% 0.15/0.43 ---------- no more Softie stats ----------
% 0.15/0.43
% 0.15/0.43
% 0.15/0.43
% 0.15/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.43
% 0.15/0.43 Stopped by limit on number of solutions
% 0.15/0.43
% 0.15/0.43 =========== start of search ===========
% 0.65/0.86
% 0.65/0.86 -------- PROOF --------
% 0.65/0.86 % SZS status Theorem
% 0.65/0.86 % SZS output start Refutation
% 0.65/0.86
% 0.65/0.86 Stopped by limit on insertions
% 0.65/0.86
% 0.65/0.86 Model 3 [ 3 1 411 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.86
% 0.65/0.86 Stopped by limit on insertions
% 0.65/0.86
% 0.65/0.86 Model 4 [ 1 1 504 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.86
% 0.65/0.86 Stopped by limit on insertions
% 0.65/0.86
% 0.65/0.86 Model 5 [ 5 0 238 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.86
% 0.65/0.86 Stopped by limit on insertions
% 0.65/0.86
% 0.65/0.86 Model 6 [ 2 1 1223 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.86
% 0.65/0.86 ----> UNIT CONFLICT at 0.44 sec ----> 144 [binary,143.1,24.1] {+} $F.
% 0.65/0.86
% 0.65/0.86 Length of proof is 7. Level of proof is 7.
% 0.65/0.86
% 0.65/0.86 ---------------- PROOF ----------------
% 0.65/0.86 % SZS status Theorem
% 0.65/0.86 % SZS output start Refutation
% 0.65/0.86
% 0.65/0.86 3 [] {+} -convergent_lines(A,A).
% 0.65/0.86 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.65/0.86 18 [] {+} -convergent_lines(A,B)| -unorthogonal_lines(A,B)|convergent_lines(A,C)|unorthogonal_lines(B,C).
% 0.65/0.86 24 [] {+} -convergent_lines($c3,$c1).
% 0.65/0.86 25 [] {+} -unorthogonal_lines($c2,$c1).
% 0.65/0.86 26 [] {+} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.65/0.86 27 [] {+} unorthogonal_lines($c3,$c2).
% 0.65/0.86 28 [hyper,26,25] {+} convergent_lines($c2,$c1).
% 0.65/0.86 31 [hyper,28,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 0.65/0.86 37 [hyper,31,6] {+} convergent_lines($c1,A)|convergent_lines($c2,B)|convergent_lines(A,B).
% 0.65/0.86 90 [hyper,37,18,27,unit_del,3] {-} convergent_lines($c1,$c3)|convergent_lines($c3,A)|unorthogonal_lines($c2,A).
% 0.65/0.86 112 [hyper,90,25,unit_del,24] {-} convergent_lines($c1,$c3).
% 0.65/0.86 117 [hyper,112,6] {-} convergent_lines($c1,A)|convergent_lines($c3,A).
% 0.65/0.86 143 [hyper,117,3] {-} convergent_lines($c3,$c1).
% 0.65/0.86 144 [binary,143.1,24.1] {+} $F.
% 0.65/0.86
% 0.65/0.86 % SZS output end Refutation
% 0.65/0.86 ------------ end of proof -------------
% 0.65/0.86
% 0.65/0.86
% 0.65/0.86 Search stopped by max_proofs option.
% 0.65/0.86
% 0.65/0.86
% 0.65/0.86 Search stopped by max_proofs option.
% 0.65/0.86
% 0.65/0.86 ============ end of search ============
% 0.65/0.86
% 0.65/0.86 ----------- soft-scott stats ----------
% 0.65/0.86
% 0.65/0.86 true clauses given 14 (58.3%)
% 0.65/0.86 false clauses given 10
% 0.65/0.86
% 0.65/0.86 FALSE TRUE
% 0.65/0.86 3 0 1
% 0.65/0.86 5 0 2
% 0.65/0.86 6 0 4
% 0.65/0.86 7 0 1
% 0.65/0.86 8 0 5
% 0.65/0.86 9 0 11
% 0.65/0.86 11 1 3
% 0.65/0.86 12 0 5
% 0.65/0.86 15 1 11
% 0.65/0.86 16 0 1
% 0.65/0.86 18 2 3
% 0.65/0.86 19 2 7
% 0.65/0.86 20 0 6
% 0.65/0.86 21 0 12
% 0.65/0.86 tot: 6 72 (92.3% true)
% 0.65/0.86
% 0.65/0.86
% 0.65/0.86 Model 6 [ 2 -10 1223 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.86
% 0.65/0.86 That finishes the proof of the theorem.
% 0.65/0.86
% 0.65/0.86 Process 21860 finished Sat Jun 18 01:42:54 2022
%------------------------------------------------------------------------------