TSTP Solution File: GEO222+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO222+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:22 EDT 2022
% Result : Theorem 1.46s 1.67s
% Output : Refutation 1.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO222+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n017.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 10:19:12 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 sandbox on n017.cluster.edu,
% 0.12/0.36 Sat Jun 18 10:19:12 2022
% 0.12/0.36 The command was "./sos". The process ID is 31450.
% 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.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 -------------- Softie stats --------------
% 0.19/0.41
% 0.19/0.41 UPDATE_STOP: 300
% 0.19/0.41 SFINDER_TIME_LIMIT: 2
% 0.19/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41 number of clauses in intial UL: 37
% 0.19/0.41 number of clauses initially in problem: 43
% 0.19/0.41 percentage of clauses intially in UL: 86
% 0.19/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.41 percent of all initial clauses that are short: 100
% 0.19/0.41 absolute distinct symbol count: 18
% 0.19/0.41 distinct predicate count: 12
% 0.19/0.41 distinct function count: 4
% 0.19/0.41 distinct constant count: 2
% 0.19/0.41
% 0.19/0.41 ---------- no more Softie stats ----------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 =========== start of search ===========
% 1.46/1.67
% 1.46/1.67 -------- PROOF --------
% 1.46/1.67 % SZS status Theorem
% 1.46/1.67 % SZS output start Refutation
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Model 3 [ 3 1 611 ] (0.00 seconds, 250000 Inserts)
% 1.46/1.67
% 1.46/1.67 Model 4 (0.00 seconds, 250000 Inserts)
% 1.46/1.67
% 1.46/1.67 Stopped by limit on number of solutions
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Model 5 [ 12 1 566 ] (0.00 seconds, 250000 Inserts)
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Model 6 [ 13 0 669 ] (0.00 seconds, 250000 Inserts)
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Model 7 [ 1 5 156689 ] (0.00 seconds, 250000 Inserts)
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Model 8 [ 13 1 31838 ] (0.00 seconds, 250000 Inserts)
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Stopped by limit on insertions
% 1.46/1.67
% 1.46/1.67 Model 9 [ 16 2 15350 ] (0.00 seconds, 250000 Inserts)
% 1.46/1.67
% 1.46/1.67 ----> UNIT CONFLICT at 1.28 sec ----> 262 [binary,261.1,3.1] {-} $F.
% 1.46/1.67
% 1.46/1.67 Length of proof is 8. Level of proof is 6.
% 1.46/1.67
% 1.46/1.67 ---------------- PROOF ----------------
% 1.46/1.67 % SZS status Theorem
% 1.46/1.67 % SZS output start Refutation
% 1.46/1.67
% 1.46/1.67 3 [] {+} -convergent_lines(A,A).
% 1.46/1.67 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.46/1.67 20 [] {+} -convergent_lines(A,B)| -unorthogonal_lines(A,B)|unorthogonal_lines(A,C)|unorthogonal_lines(B,C).
% 1.46/1.67 21 [] {+} -unorthogonal_lines(orthogonal_through_point(A,B),A).
% 1.46/1.67 26 [] {+} unorthogonal_lines(A,B)|convergent_lines(A,C)| -convergent_lines(B,C)| -unorthogonal_lines(B,C).
% 1.46/1.67 28 [] {+} unorthogonal_lines(A,B)|unorthogonal_lines(A,C)| -convergent_lines(B,C).
% 1.46/1.67 38 [] {+} -parallel_lines($c1,orthogonal_through_point(orthogonal_through_point($c1,$c2),$c2)).
% 1.46/1.67 39 [] {+} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 1.46/1.67 42 [] {-} parallel_lines(A,B)|convergent_lines(A,B).
% 1.46/1.67 45 [hyper,39,21] {+} convergent_lines(orthogonal_through_point(A,B),A).
% 1.46/1.67 64 [hyper,45,28] {-} unorthogonal_lines(A,orthogonal_through_point(B,C))|unorthogonal_lines(A,B).
% 1.46/1.67 66 [hyper,45,6] {+} convergent_lines(orthogonal_through_point(A,B),C)|convergent_lines(A,C).
% 1.46/1.67 87 [hyper,42,38] {-} convergent_lines($c1,orthogonal_through_point(orthogonal_through_point($c1,$c2),$c2)).
% 1.46/1.67 118 [hyper,64,20,87] {-} unorthogonal_lines($c1,orthogonal_through_point($c1,$c2))|unorthogonal_lines($c1,A)|unorthogonal_lines(orthogonal_through_point(orthogonal_through_point($c1,$c2),$c2),A).
% 1.46/1.67 128 [factor,118.1.2,unit_del,21] {+} unorthogonal_lines($c1,orthogonal_through_point($c1,$c2)).
% 1.46/1.67 219 [hyper,66,26,128] {-} convergent_lines(orthogonal_through_point($c1,A),orthogonal_through_point($c1,$c2))|unorthogonal_lines(B,$c1)|convergent_lines(B,orthogonal_through_point($c1,$c2)).
% 1.46/1.67 261 [factor,219.1.3,unit_del,21] {-} convergent_lines(orthogonal_through_point($c1,A),orthogonal_through_point($c1,$c2)).
% 1.46/1.67 262 [binary,261.1,3.1] {-} $F.
% 1.46/1.67
% 1.46/1.67 % SZS output end Refutation
% 1.46/1.67 ------------ end of proof -------------
% 1.46/1.67
% 1.46/1.67
% 1.46/1.67 Search stopped by max_proofs option.
% 1.46/1.67
% 1.46/1.67
% 1.46/1.67 Search stopped by max_proofs option.
% 1.46/1.67
% 1.46/1.67 ============ end of search ============
% 1.46/1.67
% 1.46/1.67 ----------- soft-scott stats ----------
% 1.46/1.67
% 1.46/1.67 true clauses given 5 (26.3%)
% 1.46/1.67 false clauses given 14
% 1.46/1.67
% 1.46/1.67 FALSE TRUE
% 1.46/1.67 5 1 0
% 1.46/1.67 8 12 9
% 1.46/1.67 9 2 0
% 1.46/1.67 10 31 11
% 1.46/1.67 11 4 15
% 1.46/1.67 13 15 8
% 1.46/1.67 14 1 3
% 1.46/1.67 17 2 5
% 1.46/1.67 19 2 3
% 1.46/1.67 22 1 0
% 1.46/1.67 25 1 0
% 1.46/1.67 tot: 72 54 (42.9% true)
% 1.46/1.67
% 1.46/1.67
% 1.46/1.67 Model 9 [ 16 2 15350 ] (0.00 seconds, 250000 Inserts)
% 1.46/1.67
% 1.46/1.67 That finishes the proof of the theorem.
% 1.46/1.67
% 1.46/1.67 Process 31450 finished Sat Jun 18 10:19:14 2022
%------------------------------------------------------------------------------