TSTP Solution File: GEO218+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO218+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:18 EDT 2022
% Result : Theorem 0.68s 0.86s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO218+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 18:28:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox2 on n018.cluster.edu,
% 0.20/0.36 Sat Jun 18 18:28:18 2022
% 0.20/0.36 The command was "./sos". The process ID is 25578.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 formula_list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.20/0.36
% 0.20/0.36 This is a non-Horn set without equality. The strategy
% 0.20/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.20/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36 19 back subsumes 18.
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 20
% 0.20/0.40 number of clauses initially in problem: 22
% 0.20/0.40 percentage of clauses intially in UL: 90
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 10
% 0.20/0.40 distinct predicate count: 5
% 0.20/0.40 distinct function count: 2
% 0.20/0.40 distinct constant count: 3
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.68/0.86
% 0.68/0.86 -------- PROOF --------
% 0.68/0.86 % SZS status Theorem
% 0.68/0.86 % SZS output start Refutation
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 Model 3 [ 1 0 159 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 Model 4 [ 1 0 73 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 Model 5 [ 2 0 147 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 Model 6 [ 2 1 73 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 ----> UNIT CONFLICT at 0.48 sec ----> 77 [binary,76.1,20.1] {-} $F.
% 0.68/0.86
% 0.68/0.86 Length of proof is 6. Level of proof is 6.
% 0.68/0.86
% 0.68/0.86 ---------------- PROOF ----------------
% 0.68/0.86 % SZS status Theorem
% 0.68/0.86 % SZS output start Refutation
% 0.68/0.86
% 0.68/0.86 3 [] {+} -convergent_lines(A,A).
% 0.68/0.86 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.68/0.86 16 [] {+} convergent_lines(A,B)|unorthogonal_lines(A,C)| -convergent_lines(B,C)| -unorthogonal_lines(B,C).
% 0.68/0.86 20 [] {+} -convergent_lines($c3,$c2).
% 0.68/0.86 21 [] {+} -unorthogonal_lines($c3,$c1).
% 0.68/0.86 22 [] {+} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.68/0.86 23 [] {+} unorthogonal_lines($c2,$c1).
% 0.68/0.86 24 [hyper,22,21] {+} convergent_lines($c3,$c1).
% 0.68/0.86 27 [hyper,24,6] {+} convergent_lines($c3,A)|convergent_lines($c1,A).
% 0.68/0.86 30 [hyper,27,20] {+} convergent_lines($c1,$c2).
% 0.68/0.86 43 [hyper,30,6] {+} convergent_lines($c1,A)|convergent_lines($c2,A).
% 0.68/0.86 65 [hyper,43,16,23,unit_del,3] {-} convergent_lines(A,$c2)|unorthogonal_lines(A,$c1).
% 0.68/0.86 76 [hyper,65,21] {-} convergent_lines($c3,$c2).
% 0.68/0.86 77 [binary,76.1,20.1] {-} $F.
% 0.68/0.86
% 0.68/0.86 % SZS output end Refutation
% 0.68/0.86 ------------ end of proof -------------
% 0.68/0.86
% 0.68/0.86
% 0.68/0.86 Search stopped by max_proofs option.
% 0.68/0.86
% 0.68/0.86
% 0.68/0.86 Search stopped by max_proofs option.
% 0.68/0.86
% 0.68/0.86 ============ end of search ============
% 0.68/0.86
% 0.68/0.86 ----------- soft-scott stats ----------
% 0.68/0.86
% 0.68/0.86 true clauses given 11 (61.1%)
% 0.68/0.86 false clauses given 7
% 0.68/0.86
% 0.68/0.86 FALSE TRUE
% 0.68/0.86 6 0 4
% 0.68/0.86 9 0 16
% 0.68/0.86 12 0 5
% 0.68/0.86 tot: 0 25 (100.0% true)
% 0.68/0.86
% 0.68/0.86
% 0.68/0.86 Model 6 [ 2 -7 73 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 That finishes the proof of the theorem.
% 0.68/0.86
% 0.68/0.86 Process 25578 finished Sat Jun 18 18:28:19 2022
%------------------------------------------------------------------------------