TSTP Solution File: GEO125+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO125+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:18:19 EDT 2022
% Result : Theorem 4.59s 4.82s
% Output : Refutation 4.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO125+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 20:46:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n006.cluster.edu,
% 0.13/0.37 Fri Jun 17 20:46:56 2022
% 0.13/0.37 The command was "./sos". The process ID is 25374.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 116 during input processing: 0 [copy,116,flip.1] {-} A=A.
% 0.13/0.37 116 back subsumes 104.
% 0.13/0.37 116 back subsumes 103.
% 0.13/0.37 116 back subsumes 102.
% 0.13/0.37 116 back subsumes 99.
% 0.13/0.37 116 back subsumes 98.
% 0.13/0.37 116 back subsumes 92.
% 0.13/0.37 116 back subsumes 91.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.96/1.13
% 0.96/1.13 Model 1 (0.00 seconds, 0 Inserts)
% 0.96/1.13
% 0.96/1.13 Stopped by limit on number of solutions
% 0.96/1.13
% 0.96/1.13
% 0.96/1.13 -------------- Softie stats --------------
% 0.96/1.13
% 0.96/1.13 UPDATE_STOP: 300
% 0.96/1.13 SFINDER_TIME_LIMIT: 2
% 0.96/1.13 SHORT_CLAUSE_CUTOFF: 4
% 0.96/1.13 number of clauses in intial UL: 92
% 0.96/1.13 number of clauses initially in problem: 108
% 0.96/1.13 percentage of clauses intially in UL: 85
% 0.96/1.13 percentage of distinct symbols occuring in initial UL: 90
% 0.96/1.13 percent of all initial clauses that are short: 100
% 0.96/1.13 absolute distinct symbol count: 43
% 0.96/1.13 distinct predicate count: 14
% 0.96/1.13 distinct function count: 26
% 0.96/1.13 distinct constant count: 3
% 0.96/1.13
% 0.96/1.13 ---------- no more Softie stats ----------
% 0.96/1.13
% 0.96/1.13
% 0.96/1.13
% 0.96/1.13 Stopped by limit on insertions
% 0.96/1.13
% 0.96/1.13 =========== start of search ===========
% 4.59/4.82
% 4.59/4.82 -------- PROOF --------
% 4.59/4.82 % SZS status Theorem
% 4.59/4.82 % SZS output start Refutation
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 2 [ 3 16 96154 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 3 [ 7 3 10530 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 4 [ 7 9 55577 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 5 [ 8 8 48069 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 6 [ 10 10 63547 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 7 [ 13 8 55300 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 8 [ 8 6 37901 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 9 [ 6 13 90613 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 Model 10 [ 10 8 50095 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 Stopped by limit on insertions
% 4.59/4.82
% 4.59/4.82 -----> EMPTY CLAUSE at 4.42 sec ----> 2161 [hyper,1285,42,116] {-} $F.
% 4.59/4.82
% 4.59/4.82 Length of proof is 6. Level of proof is 4.
% 4.59/4.82
% 4.59/4.82 ---------------- PROOF ----------------
% 4.59/4.82 % SZS status Theorem
% 4.59/4.82 % SZS output start Refutation
% 4.59/4.82
% 4.59/4.82 42 [] {+} -between_c(A,B,C,D)|B!=D.
% 4.59/4.82 53 [] {+} between_o(A,B,C,D)| -ordered_by(A,D,C)| -ordered_by(A,C,B).
% 4.59/4.82 60 [] {+} -finish_point(A,B)|incident_o(A,B).
% 4.59/4.82 61 [] {+} -finish_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,C,A).
% 4.59/4.82 72 [] {+} -between_o(A,B,C,D)|between_c($f18(B,C,D,A),B,C,D).
% 4.59/4.82 82 [] {+} $c2!=$c1.
% 4.59/4.82 114 [] {+} finish_point($c2,$c3).
% 4.59/4.82 115 [] {+} finish_point($c1,$c3).
% 4.59/4.82 116 [] {+} A=A.
% 4.59/4.82 141 [hyper,115,60] {+} incident_o($c1,$c3).
% 4.59/4.82 180 [hyper,114,60] {+} incident_o($c2,$c3).
% 4.59/4.82 220 [hyper,141,61,114,unit_del,82] {+} ordered_by($c3,$c1,$c2).
% 4.59/4.82 909 [hyper,180,61,115,unit_del,82] {+} ordered_by($c3,$c2,$c1).
% 4.59/4.82 1211 [hyper,909,53,220] {-} between_o($c3,$c1,$c2,$c1).
% 4.59/4.82 1285 [hyper,1211,72] {-} between_c($f18($c1,$c2,$c1,$c3),$c1,$c2,$c1).
% 4.59/4.82 2161 [hyper,1285,42,116] {-} $F.
% 4.59/4.82
% 4.59/4.82 % SZS output end Refutation
% 4.59/4.82 ------------ end of proof -------------
% 4.59/4.82
% 4.59/4.82
% 4.59/4.82 Search stopped by max_proofs option.
% 4.59/4.82
% 4.59/4.82
% 4.59/4.82 Search stopped by max_proofs option.
% 4.59/4.82
% 4.59/4.82 ============ end of search ============
% 4.59/4.82
% 4.59/4.82 ----------- soft-scott stats ----------
% 4.59/4.82
% 4.59/4.82 true clauses given 3 (15.8%)
% 4.59/4.82 false clauses given 16
% 4.59/4.82
% 4.59/4.82 FALSE TRUE
% 4.59/4.82 4 0 4
% 4.59/4.82 5 0 2
% 4.59/4.82 6 0 6
% 4.59/4.82 7 0 4
% 4.59/4.82 8 0 13
% 4.59/4.82 9 1 11
% 4.59/4.82 10 0 17
% 4.59/4.82 11 8 24
% 4.59/4.82 12 11 18
% 4.59/4.82 13 28 31
% 4.59/4.82 14 19 32
% 4.59/4.82 15 37 27
% 4.59/4.82 16 17 10
% 4.59/4.82 17 27 48
% 4.59/4.82 18 34 66
% 4.59/4.82 19 63 64
% 4.59/4.82 20 43 66
% 4.59/4.82 21 9 37
% 4.59/4.82 22 22 46
% 4.59/4.82 23 36 7
% 4.59/4.82 24 7 9
% 4.59/4.82 25 45 18
% 4.59/4.82 26 10 17
% 4.59/4.82 27 22 19
% 4.59/4.82 28 9 8
% 4.59/4.82 29 27 18
% 4.59/4.82 30 8 30
% 4.59/4.82 31 36 27
% 4.59/4.82 32 7 21
% 4.59/4.82 33 10 23
% 4.59/4.82 34 16 14
% 4.59/4.82 35 18 29
% 4.59/4.82 36 10 27
% 4.59/4.82 37 20 60
% 4.59/4.82 38 7 21
% 4.59/4.82 39 28 11
% 4.59/4.82 40 9 32
% 4.59/4.82 41 1 9
% 4.59/4.82 42 12 25
% 4.59/4.82 43 38 28
% 4.59/4.82 44 12 17
% 4.59/4.82 45 3 20
% 4.59/4.82 46 11 40
% 4.59/4.82 47 17 14
% 4.59/4.82 48 12 2
% 4.59/4.82 49 6 26
% 4.59/4.82 50 14 14
% 4.59/4.82 51 17 20
% 4.59/4.82 52 3 8
% 4.59/4.82 53 2 2
% 4.59/4.82 54 14 12
% 4.59/4.82 55 12 12
% 4.59/4.82 56 0 16
% 4.59/4.82 57 2 12
% 4.59/4.82 58 2 14
% 4.59/4.82 60 0 2
% 4.59/4.82 tot: 822 1210 (59.5% true)
% 4.59/4.82
% 4.59/4.82
% 4.59/4.82 Model 10 [ 10 -132 50095 ] (0.00 seconds, 250000 Inserts)
% 4.59/4.82
% 4.59/4.82 That finishes the proof of the theorem.
% 4.59/4.82
% 4.59/4.82 Process 25374 finished Fri Jun 17 20:47:00 2022
%------------------------------------------------------------------------------