TSTP Solution File: GEO226+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO226+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 4.61s 4.79s
% Output : Refutation 4.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GEO226+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.15 % Command : sos-script %s
% 0.16/0.37 % Computer : n020.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Sat Jun 18 02:43:19 EDT 2022
% 0.23/0.37 % CPUTime :
% 0.23/0.39 ----- Otter 3.2, August 2001 -----
% 0.23/0.39 The process was started by sandbox2 on n020.cluster.edu,
% 0.23/0.39 Sat Jun 18 02:43:19 2022
% 0.23/0.39 The command was "./sos". The process ID is 4710.
% 0.23/0.39
% 0.23/0.39 set(prolog_style_variables).
% 0.23/0.39 set(auto).
% 0.23/0.39 dependent: set(auto1).
% 0.23/0.39 dependent: set(process_input).
% 0.23/0.39 dependent: clear(print_kept).
% 0.23/0.39 dependent: clear(print_new_demod).
% 0.23/0.39 dependent: clear(print_back_demod).
% 0.23/0.39 dependent: clear(print_back_sub).
% 0.23/0.39 dependent: set(control_memory).
% 0.23/0.39 dependent: assign(max_mem, 12000).
% 0.23/0.39 dependent: assign(pick_given_ratio, 4).
% 0.23/0.39 dependent: assign(stats_level, 1).
% 0.23/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.23/0.39 dependent: assign(sos_limit, 5000).
% 0.23/0.39 dependent: assign(max_weight, 60).
% 0.23/0.39 clear(print_given).
% 0.23/0.39
% 0.23/0.39 formula_list(usable).
% 0.23/0.39
% 0.23/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.23/0.39
% 0.23/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.23/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.23/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.23/0.39 clauses in usable.
% 0.23/0.39
% 0.23/0.39 dependent: set(knuth_bendix).
% 0.23/0.39 dependent: set(para_from).
% 0.23/0.39 dependent: set(para_into).
% 0.23/0.39 dependent: clear(para_from_right).
% 0.23/0.39 dependent: clear(para_into_right).
% 0.23/0.39 dependent: set(para_from_vars).
% 0.23/0.39 dependent: set(eq_units_both_ways).
% 0.23/0.39 dependent: set(dynamic_demod_all).
% 0.23/0.39 dependent: set(dynamic_demod).
% 0.23/0.39 dependent: set(order_eq).
% 0.23/0.39 dependent: set(back_demod).
% 0.23/0.39 dependent: set(lrpo).
% 0.23/0.39 dependent: set(hyper_res).
% 0.23/0.39 dependent: set(unit_deletion).
% 0.23/0.39 dependent: set(factor).
% 0.23/0.39
% 0.23/0.39 ------------> process usable:
% 0.23/0.39 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.23/0.39 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.23/0.39 28 back subsumes 27.
% 0.23/0.39
% 0.23/0.39 ------------> process sos:
% 0.23/0.39 Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.23/0.39 48 back subsumes 30.
% 0.23/0.39
% 0.23/0.39 ======= end of input processing =======
% 0.23/0.43
% 0.23/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.23/0.43
% 0.23/0.43 Stopped by limit on number of solutions
% 0.23/0.43
% 0.23/0.43
% 0.23/0.43 -------------- Softie stats --------------
% 0.23/0.43
% 0.23/0.43 UPDATE_STOP: 300
% 0.23/0.43 SFINDER_TIME_LIMIT: 2
% 0.23/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.23/0.43 number of clauses in intial UL: 36
% 0.23/0.43 number of clauses initially in problem: 46
% 0.23/0.43 percentage of clauses intially in UL: 78
% 0.23/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.23/0.43 percent of all initial clauses that are short: 100
% 0.23/0.43 absolute distinct symbol count: 18
% 0.23/0.43 distinct predicate count: 12
% 0.23/0.43 distinct function count: 4
% 0.23/0.43 distinct constant count: 2
% 0.23/0.43
% 0.23/0.43 ---------- no more Softie stats ----------
% 0.23/0.43
% 0.23/0.43
% 0.23/0.43
% 0.23/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.23/0.43
% 0.23/0.43 Stopped by limit on number of solutions
% 0.23/0.43
% 0.23/0.43 =========== start of search ===========
% 4.61/4.79
% 4.61/4.79 -------- PROOF --------
% 4.61/4.79 % SZS status Theorem
% 4.61/4.79 % SZS output start Refutation
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 3 [ 3 1 428 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Model 4 (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on number of solutions
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 5 [ 3 0 721 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Model 6 (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on number of solutions
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 7 [ 7 0 1373 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 8 [ 4 0 1167 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 9 [ 4 1 332 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Model 10 (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on number of solutions
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 11 [ 18 0 504 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 12 [ 13 0 631 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 13 [ 13 1 187 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 14 [ 18 0 617 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 15 [ 3 0 358 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 16 [ 20 0 288 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 17 [ 15 0 306 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 18 [ 16 1 304 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 19 [ 17 0 726 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 20 [ 21 0 1111 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 21 [ 17 0 541 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 22 [ 24 1 797 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 23 [ 16 1 754 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 24 [ 42 1 1039 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 25 [ 26 0 547 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 26 [ 23 0 1321 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 27 [ 32 0 440 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 28 [ 35 0 326 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 29 [ 35 1 334 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 30 [ 21 2 14244 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 Stopped by limit on insertions
% 4.61/4.79
% 4.61/4.79 Model 31 [ 36 1 349 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 ----> UNIT CONFLICT at 4.37 sec ----> 351 [binary,350.1,3.1] {+} $F.
% 4.61/4.79
% 4.61/4.79 Length of proof is 4. Level of proof is 3.
% 4.61/4.79
% 4.61/4.79 ---------------- PROOF ----------------
% 4.61/4.79 % SZS status Theorem
% 4.61/4.79 % SZS output start Refutation
% 4.61/4.79
% 4.61/4.79 3 [] {+} -convergent_lines(A,A).
% 4.61/4.79 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 4.61/4.79 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 4.61/4.79 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 4.61/4.79 38 [] {+} -incident_point_and_line(A,$c2)| -incident_point_and_line(A,$c1).
% 4.61/4.79 43 [] {-} incident_point_and_line(A,B)|apart_point_and_line(A,B).
% 4.61/4.79 47 [] {+} convergent_lines($c2,$c1).
% 4.61/4.79 90 [hyper,47,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 4.61/4.79 125 [hyper,43,38,43] {-} apart_point_and_line(A,$c1)|apart_point_and_line(A,$c2).
% 4.61/4.79 336 [hyper,125,10,90,unit_del,3] {-} apart_point_and_line(intersection_point($c2,$c1),$c2).
% 4.61/4.79 350 [hyper,336,9,90] {-} convergent_lines($c1,$c1).
% 4.61/4.79 351 [binary,350.1,3.1] {+} $F.
% 4.61/4.79
% 4.61/4.79 % SZS output end Refutation
% 4.61/4.79 ------------ end of proof -------------
% 4.61/4.79
% 4.61/4.79
% 4.61/4.79 Search stopped by max_proofs option.
% 4.61/4.79
% 4.61/4.79
% 4.61/4.79 Search stopped by max_proofs option.
% 4.61/4.79
% 4.61/4.79 ============ end of search ============
% 4.61/4.79
% 4.61/4.79 ----------- soft-scott stats ----------
% 4.61/4.79
% 4.61/4.79 true clauses given 8 (18.6%)
% 4.61/4.79 false clauses given 35
% 4.61/4.79
% 4.61/4.79 FALSE TRUE
% 4.61/4.79 5 3 0
% 4.61/4.79 6 19 6
% 4.61/4.79 7 12 10
% 4.61/4.79 8 29 12
% 4.61/4.79 9 58 54
% 4.61/4.79 10 2 4
% 4.61/4.79 11 1 14
% 4.61/4.79 12 1 20
% 4.61/4.79 15 4 0
% 4.61/4.79 18 4 0
% 4.61/4.79 tot: 133 120 (47.4% true)
% 4.61/4.79
% 4.61/4.79
% 4.61/4.79 Model 31 [ 36 -42 349 ] (0.00 seconds, 250000 Inserts)
% 4.61/4.79
% 4.61/4.79 That finishes the proof of the theorem.
% 4.61/4.79
% 4.61/4.79 Process 4710 finished Sat Jun 18 02:43:23 2022
%------------------------------------------------------------------------------