TSTP Solution File: GEO225+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO225+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:25 EDT 2022
% Result : Theorem 1.70s 1.93s
% Output : Refutation 1.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO225+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 10:37:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox2 on n012.cluster.edu,
% 0.14/0.37 Sat Jun 18 10:37:23 2022
% 0.14/0.37 The command was "./sos". The process ID is 21435.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 formula_list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.14/0.37
% 0.14/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.37 clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37 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.14/0.37 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.14/0.37 28 back subsumes 27.
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.14/0.37 48 back subsumes 32.
% 0.14/0.37 48 back subsumes 31.
% 0.14/0.37 48 back subsumes 29.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 34
% 0.20/0.41 number of clauses initially in problem: 44
% 0.20/0.41 percentage of clauses intially in UL: 77
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 18
% 0.20/0.41 distinct predicate count: 12
% 0.20/0.41 distinct function count: 4
% 0.20/0.41 distinct constant count: 2
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 1.70/1.93
% 1.70/1.93 -------- PROOF --------
% 1.70/1.93 % SZS status Theorem
% 1.70/1.93 % SZS output start Refutation
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 3 [ 3 1 300 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 4 [ 3 1 447 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 5 [ 3 0 963 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 6 [ 4 1 310 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 7 [ 3 1 610 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 8 [ 1 0 929 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 9 [ 13 1 483 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 10 [ 14 0 931 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 11 [ 2 0 430 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 12 [ 12 0 374 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 13 [ 18 0 491 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 14 [ 17 1 402 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 15 [ 17 0 453 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 16 [ 21 0 509 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 17 [ 19 1 373 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 18 [ 9 1 12814 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 19 [ 18 0 258 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 Stopped by limit on insertions
% 1.70/1.93
% 1.70/1.93 Model 20 [ 15 0 262 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 ----> UNIT CONFLICT at 1.54 sec ----> 220 [binary,219.1,2.1] {-} $F.
% 1.70/1.93
% 1.70/1.93 Length of proof is 5. Level of proof is 3.
% 1.70/1.93
% 1.70/1.93 ---------------- PROOF ----------------
% 1.70/1.93 % SZS status Theorem
% 1.70/1.93 % SZS output start Refutation
% 1.70/1.93
% 1.70/1.93 2 [] {+} -distinct_lines(A,A).
% 1.70/1.93 7 [] {+} -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 1.70/1.93 8 [] {+} -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 1.70/1.93 38 [] {+} -incident_point_and_line($c2,A)| -incident_point_and_line($c1,A).
% 1.70/1.93 41 [] {+} equal_lines(A,B)|distinct_lines(A,B).
% 1.70/1.93 43 [] {-} incident_point_and_line(A,B)|apart_point_and_line(A,B).
% 1.70/1.93 47 [] {+} distinct_points($c2,$c1).
% 1.70/1.93 74 [para_from,41.1.1,47.1.2] {-} distinct_points($c2,A)|distinct_lines($c1,A).
% 1.70/1.93 78 [para_from,41.1.1,47.1.1] {-} distinct_points(A,$c1)|distinct_lines($c2,A).
% 1.70/1.93 97 [hyper,43,38,43] {-} apart_point_and_line($c1,A)|apart_point_and_line($c2,A).
% 1.70/1.93 168 [hyper,97,8,74,unit_del,2] {-} apart_point_and_line($c2,line_connecting($c2,$c1)).
% 1.70/1.93 219 [hyper,168,7,78] {-} distinct_lines($c2,$c2).
% 1.70/1.93 220 [binary,219.1,2.1] {-} $F.
% 1.70/1.93
% 1.70/1.93 % SZS output end Refutation
% 1.70/1.93 ------------ end of proof -------------
% 1.70/1.93
% 1.70/1.93
% 1.70/1.93 Search stopped by max_proofs option.
% 1.70/1.93
% 1.70/1.93
% 1.70/1.93 Search stopped by max_proofs option.
% 1.70/1.93
% 1.70/1.93 ============ end of search ============
% 1.70/1.93
% 1.70/1.93 ----------- soft-scott stats ----------
% 1.70/1.93
% 1.70/1.93 true clauses given 6 (17.6%)
% 1.70/1.93 false clauses given 28
% 1.70/1.93
% 1.70/1.93 FALSE TRUE
% 1.70/1.93 4 0 1
% 1.70/1.93 5 5 0
% 1.70/1.93 6 9 9
% 1.70/1.93 7 6 2
% 1.70/1.93 8 31 10
% 1.70/1.93 9 23 14
% 1.70/1.93 10 2 0
% 1.70/1.93 11 0 10
% 1.70/1.93 12 5 3
% 1.70/1.93 15 1 0
% 1.70/1.93 tot: 82 49 (37.4% true)
% 1.70/1.93
% 1.70/1.93
% 1.70/1.93 Model 20 [ 15 -13 262 ] (0.00 seconds, 250000 Inserts)
% 1.70/1.93
% 1.70/1.93 That finishes the proof of the theorem.
% 1.70/1.93
% 1.70/1.93 Process 21435 finished Sat Jun 18 10:37:25 2022
%------------------------------------------------------------------------------