TSTP Solution File: GEO224+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO224+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:24 EDT 2022
% Result : Theorem 1.64s 1.83s
% Output : Refutation 1.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO224+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 17 15:27:19 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n014.cluster.edu,
% 0.13/0.35 Fri Jun 17 15:27:19 2022
% 0.13/0.35 The command was "./sos". The process ID is 6542.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35 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.13/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.13/0.35 28 back subsumes 27.
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 37
% 0.13/0.39 number of clauses initially in problem: 45
% 0.13/0.39 percentage of clauses intially in UL: 82
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 94
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 18
% 0.13/0.39 distinct predicate count: 12
% 0.13/0.39 distinct function count: 4
% 0.13/0.39 distinct constant count: 2
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 1.64/1.83
% 1.64/1.83 -------- PROOF --------
% 1.64/1.83 % SZS status Theorem
% 1.64/1.83 % SZS output start Refutation
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 3 [ 3 1 153 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Model 4 (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on number of solutions
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 5 [ 12 1 268 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 6 [ 12 0 657 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 7 [ 12 0 529 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 8 [ 12 1 612 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 9 [ 12 0 418 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 10 [ 12 1 784 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 11 [ 3 1 22306 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 12 [ 16 1 15435 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 13 [ 16 1 9365 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 14 [ 22 0 479 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 15 [ 19 7 131006 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 Stopped by limit on insertions
% 1.64/1.83
% 1.64/1.83 Model 16 [ 72 1 305 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 ----> UNIT CONFLICT at 1.45 sec ----> 1618 [binary,1617.1,3.1] {-} $F.
% 1.64/1.83
% 1.64/1.83 Length of proof is 6. Level of proof is 4.
% 1.64/1.83
% 1.64/1.83 ---------------- PROOF ----------------
% 1.64/1.83 % SZS status Theorem
% 1.64/1.83 % SZS output start Refutation
% 1.64/1.83
% 1.64/1.83 3 [] {+} -convergent_lines(A,A).
% 1.64/1.83 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.64/1.83 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 1.64/1.83 21 [] {+} -unorthogonal_lines(orthogonal_through_point(A,B),A).
% 1.64/1.83 30 [] {+} -line(A)| -line(B)| -convergent_lines(A,B)|point(intersection_point(A,B)).
% 1.64/1.83 32 [] {+} -line(A)| -point(B)|line(orthogonal_through_point(A,B)).
% 1.64/1.83 38 [] {+} -point(A)| -incident_point_and_line(A,$c1).
% 1.64/1.83 39 [] {+} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 1.64/1.83 43 [] {+} incident_point_and_line(A,B)|apart_point_and_line(A,B).
% 1.64/1.83 45 [] {+} point($c2).
% 1.64/1.83 46 [] {+} line($c1).
% 1.64/1.83 47 [hyper,39,21] {+} convergent_lines(orthogonal_through_point(A,B),A).
% 1.64/1.83 50 [hyper,47,6] {+} convergent_lines(orthogonal_through_point(A,B),C)|convergent_lines(A,C).
% 1.64/1.83 51 [hyper,46,32,45] {+} line(orthogonal_through_point($c1,$c2)).
% 1.64/1.83 55 [hyper,51,30,46,47] {-} point(intersection_point(orthogonal_through_point($c1,$c2),$c1)).
% 1.64/1.83 147 [hyper,55,38,43] {-} apart_point_and_line(intersection_point(orthogonal_through_point($c1,$c2),$c1),$c1).
% 1.64/1.83 1617 [hyper,147,10,50] {-} convergent_lines($c1,$c1).
% 1.64/1.83 1618 [binary,1617.1,3.1] {-} $F.
% 1.64/1.83
% 1.64/1.83 % SZS output end Refutation
% 1.64/1.83 ------------ end of proof -------------
% 1.64/1.83
% 1.64/1.83
% 1.64/1.83 Search stopped by max_proofs option.
% 1.64/1.83
% 1.64/1.83
% 1.64/1.83 Search stopped by max_proofs option.
% 1.64/1.83
% 1.64/1.83 ============ end of search ============
% 1.64/1.83
% 1.64/1.83 ----------- soft-scott stats ----------
% 1.64/1.83
% 1.64/1.83 true clauses given 9 (18.0%)
% 1.64/1.83 false clauses given 41
% 1.64/1.83
% 1.64/1.83 FALSE TRUE
% 1.64/1.83 7 5 1
% 1.64/1.83 8 33 21
% 1.64/1.83 9 84 26
% 1.64/1.83 10 52 20
% 1.64/1.83 11 34 27
% 1.64/1.83 12 49 37
% 1.64/1.83 13 48 38
% 1.64/1.83 14 15 19
% 1.64/1.83 15 34 5
% 1.64/1.83 16 63 8
% 1.64/1.83 17 63 10
% 1.64/1.83 18 69 7
% 1.64/1.83 19 119 4
% 1.64/1.83 20 116 14
% 1.64/1.83 21 96 7
% 1.64/1.83 22 93 5
% 1.64/1.83 23 85 8
% 1.64/1.83 24 72 0
% 1.64/1.83 25 44 0
% 1.64/1.83 tot: 1174 257 (18.0% true)
% 1.64/1.83
% 1.64/1.83
% 1.64/1.83 Model 16 [ 72 1 305 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.83
% 1.64/1.83 That finishes the proof of the theorem.
% 1.64/1.83
% 1.64/1.83 Process 6542 finished Fri Jun 17 15:27:21 2022
%------------------------------------------------------------------------------