TSTP Solution File: GEO217+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO217+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 1.61s 1.79s
% Output : Refutation 1.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO217+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n026.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 08:54:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n026.cluster.edu,
% 0.12/0.36 Sat Jun 18 08:54:24 2022
% 0.12/0.36 The command was "./sos". The process ID is 5713.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 15 during input processing: 0 [] {-} -distinct_lines(A,B)|apart_point_and_line(C,A)|apart_point_and_line(C,B)|convergent_lines(A,B).
% 0.12/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.12/0.36 28 back subsumes 27.
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.12/0.36
% 0.12/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: 37
% 0.19/0.40 number of clauses initially in problem: 45
% 0.19/0.40 percentage of clauses intially in UL: 82
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 94
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 19
% 0.19/0.40 distinct predicate count: 12
% 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 ===========
% 1.61/1.79
% 1.61/1.79 -------- PROOF --------
% 1.61/1.79 % SZS status Theorem
% 1.61/1.79 % SZS output start Refutation
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 3 [ 3 1 508 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Model 4 (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on number of solutions
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 5 [ 12 1 3627 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 6 [ 5 0 504 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 7 [ 12 1 784 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 8 [ 13 0 1059 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 9 [ 13 1 693 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 10 [ 13 1 1098 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 11 [ 5 1 319 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 12 [ 14 1 274 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 13 [ 23 0 437 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 14 [ 23 0 580 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 15 [ 23 0 899 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 16 [ 6 1 1138 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 17 [ 50 1 1952 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 18 [ 8 0 884 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 19 [ 53 1 1583 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 Stopped by limit on insertions
% 1.61/1.79
% 1.61/1.79 Model 20 [ 11 1 778 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 ----> UNIT CONFLICT at 1.41 sec ----> 243 [binary,242.1,1.1] {+} $F.
% 1.61/1.79
% 1.61/1.79 Length of proof is 6. Level of proof is 4.
% 1.61/1.79
% 1.61/1.79 ---------------- PROOF ----------------
% 1.61/1.79 % SZS status Theorem
% 1.61/1.79 % SZS output start Refutation
% 1.61/1.79
% 1.61/1.79 1 [] {+} -distinct_points(A,A).
% 1.61/1.79 15 [] {+} -distinct_lines(A,B)|convergent_lines(A,B).
% 1.61/1.79 35 [] {+} -parallel_lines(A,B)| -convergent_lines(A,B).
% 1.61/1.79 38 [] {+} -parallel_lines($c2,$c1).
% 1.61/1.79 40 [] {+} equal_points(A,B)|distinct_points(A,B).
% 1.61/1.79 41 [] {+} equal_lines(A,B)|distinct_lines(A,B).
% 1.61/1.79 45 [] {+} parallel_lines($c3,$c2).
% 1.61/1.79 46 [] {+} parallel_lines($c3,$c1).
% 1.61/1.79 52 [para_from,40.1.1,45.1.1] {+} parallel_lines(A,$c2)|distinct_points($c3,A).
% 1.61/1.79 54 [para_from,40.1.1,38.1.2] {+} -parallel_lines($c2,A)|distinct_points($c1,A).
% 1.61/1.79 70 [para_from,41.1.1,46.1.1] {-} parallel_lines(A,$c1)|distinct_lines($c3,A).
% 1.61/1.79 159 [hyper,70,54,unit_del,1] {+} distinct_lines($c3,$c2).
% 1.61/1.79 166 [hyper,159,15] {+} convergent_lines($c3,$c2).
% 1.61/1.79 242 [hyper,166,35,52] {-} distinct_points($c3,$c3).
% 1.61/1.79 243 [binary,242.1,1.1] {+} $F.
% 1.61/1.79
% 1.61/1.79 % SZS output end Refutation
% 1.61/1.79 ------------ end of proof -------------
% 1.61/1.79
% 1.61/1.79
% 1.61/1.79 Search stopped by max_proofs option.
% 1.61/1.79
% 1.61/1.79
% 1.61/1.79 Search stopped by max_proofs option.
% 1.61/1.79
% 1.61/1.79 ============ end of search ============
% 1.61/1.79
% 1.61/1.79 ----------- soft-scott stats ----------
% 1.61/1.79
% 1.61/1.79 true clauses given 3 (13.0%)
% 1.61/1.79 false clauses given 20
% 1.61/1.79
% 1.61/1.79 FALSE TRUE
% 1.61/1.79 5 1 3
% 1.61/1.79 6 13 9
% 1.61/1.79 7 0 3
% 1.61/1.79 8 22 13
% 1.61/1.79 9 14 8
% 1.61/1.79 10 0 4
% 1.61/1.79 11 3 27
% 1.61/1.79 12 1 1
% 1.61/1.79 13 0 1
% 1.61/1.79 14 0 4
% 1.61/1.79 15 0 2
% 1.61/1.79 16 2 6
% 1.61/1.79 17 1 1
% 1.61/1.79 18 0 5
% 1.61/1.79 21 2 0
% 1.61/1.79 tot: 59 87 (59.6% true)
% 1.61/1.79
% 1.61/1.79
% 1.61/1.79 Model 20 [ 11 1 778 ] (0.00 seconds, 250000 Inserts)
% 1.61/1.79
% 1.61/1.79 That finishes the proof of the theorem.
% 1.61/1.79
% 1.61/1.79 Process 5713 finished Sat Jun 18 08:54:26 2022
%------------------------------------------------------------------------------