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