TSTP Solution File: GEO043-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO043-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:17:39 EDT 2022
% Result : Unsatisfiable 8.56s 8.75s
% Output : Refutation 8.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO043-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n010.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:48:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 ----- Otter 3.2, August 2001 -----
% 0.12/0.37 The process was started by sandbox on n010.cluster.edu,
% 0.12/0.37 Sat Jun 18 10:48:23 2022
% 0.12/0.37 The command was "./sos". The process ID is 2451.
% 0.12/0.37
% 0.12/0.37 set(prolog_style_variables).
% 0.12/0.37 set(auto).
% 0.12/0.37 dependent: set(auto1).
% 0.12/0.37 dependent: set(process_input).
% 0.12/0.37 dependent: clear(print_kept).
% 0.12/0.37 dependent: clear(print_new_demod).
% 0.12/0.37 dependent: clear(print_back_demod).
% 0.12/0.37 dependent: clear(print_back_sub).
% 0.12/0.37 dependent: set(control_memory).
% 0.12/0.37 dependent: assign(max_mem, 12000).
% 0.12/0.37 dependent: assign(pick_given_ratio, 4).
% 0.12/0.37 dependent: assign(stats_level, 1).
% 0.12/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.37 dependent: assign(sos_limit, 5000).
% 0.12/0.37 dependent: assign(max_weight, 60).
% 0.12/0.37 clear(print_given).
% 0.12/0.37
% 0.12/0.37 list(usable).
% 0.12/0.37
% 0.12/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.37
% 0.12/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.37 clauses in usable.
% 0.12/0.37
% 0.12/0.37 dependent: set(knuth_bendix).
% 0.12/0.37 dependent: set(para_from).
% 0.12/0.37 dependent: set(para_into).
% 0.12/0.37 dependent: clear(para_from_right).
% 0.12/0.37 dependent: clear(para_into_right).
% 0.12/0.37 dependent: set(para_from_vars).
% 0.12/0.37 dependent: set(eq_units_both_ways).
% 0.12/0.37 dependent: set(dynamic_demod_all).
% 0.12/0.37 dependent: set(dynamic_demod).
% 0.12/0.37 dependent: set(order_eq).
% 0.12/0.37 dependent: set(back_demod).
% 0.12/0.37 dependent: set(lrpo).
% 0.12/0.37 dependent: set(hyper_res).
% 0.12/0.37 dependent: set(unit_deletion).
% 0.12/0.37 dependent: set(factor).
% 0.12/0.37
% 0.12/0.37 ------------> process usable:
% 0.12/0.37 Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.12/0.37 Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.12/0.37
% 0.12/0.37 ------------> process sos:
% 0.12/0.37 Following clause subsumed by 60 during input processing: 0 [demod,63] {-} between(A,B,extension(A,B,A,B)).
% 0.12/0.37 Following clause subsumed by 61 during input processing: 0 [demod,63] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.12/0.37 Following clause subsumed by 69 during input processing: 0 [] {-} A=A.
% 0.12/0.37 59 back subsumes 56.
% 0.12/0.37 64 back subsumes 52.
% 0.12/0.37 64 back subsumes 39.
% 0.12/0.37 Following clause subsumed by 69 during input processing: 0 [copy,69,flip.1] {-} A=A.
% 0.12/0.37 69 back subsumes 55.
% 0.12/0.37 69 back subsumes 54.
% 0.12/0.37 69 back subsumes 53.
% 0.12/0.37 70 back subsumes 40.
% 0.12/0.37 77 back subsumes 44.
% 0.12/0.37 77 back subsumes 43.
% 0.12/0.37 78 back subsumes 45.
% 0.12/0.37
% 0.12/0.37 ======= end of input processing =======
% 0.83/1.02
% 0.83/1.02 Model 1 (0.00 seconds, 0 Inserts)
% 0.83/1.02
% 0.83/1.02 Stopped by limit on number of solutions
% 0.83/1.02
% 0.83/1.02
% 0.83/1.02 -------------- Softie stats --------------
% 0.83/1.02
% 0.83/1.02 UPDATE_STOP: 300
% 0.83/1.02 SFINDER_TIME_LIMIT: 2
% 0.83/1.02 SHORT_CLAUSE_CUTOFF: 4
% 0.83/1.02 number of clauses in intial UL: 43
% 0.83/1.02 number of clauses initially in problem: 62
% 0.83/1.02 percentage of clauses intially in UL: 69
% 0.83/1.02 percentage of distinct symbols occuring in initial UL: 87
% 0.83/1.02 percent of all initial clauses that are short: 100
% 0.83/1.02 absolute distinct symbol count: 16
% 0.83/1.02 distinct predicate count: 3
% 0.83/1.02 distinct function count: 6
% 0.83/1.02 distinct constant count: 7
% 0.83/1.02
% 0.83/1.02 ---------- no more Softie stats ----------
% 0.83/1.02
% 0.83/1.02
% 0.83/1.02
% 0.83/1.02 Model 2 (0.00 seconds, 0 Inserts)
% 0.83/1.02
% 0.83/1.02 Stopped by limit on number of solutions
% 0.83/1.02
% 0.83/1.02 =========== start of search ===========
% 8.56/8.75
% 8.56/8.75 -------- PROOF --------
% 8.56/8.75 % SZS status Unsatisfiable
% 8.56/8.75 % SZS output start Refutation
% 8.56/8.75
% 8.56/8.75 Model 3 (0.00 seconds, 0 Inserts)
% 8.56/8.75
% 8.56/8.75 Stopped by limit on number of solutions
% 8.56/8.75
% 8.56/8.75 Stopped by limit on insertions
% 8.56/8.75
% 8.56/8.75 Model 4 [ 3 26 102609 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 Stopped by limit on insertions
% 8.56/8.75
% 8.56/8.75 Model 5 [ 5 24 90720 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 Stopped by limit on insertions
% 8.56/8.75
% 8.56/8.75 Model 6 [ 4 24 95327 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 Stopped by limit on insertions
% 8.56/8.75
% 8.56/8.75 Model 7 [ 2 33 125695 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 Stopped by limit on insertions
% 8.56/8.75
% 8.56/8.75 Model 8 [ 2 28 108390 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 Stopped by limit on insertions
% 8.56/8.75
% 8.56/8.75 Model 9 [ 38 29 119851 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 Stopped by limit on insertions
% 8.56/8.75
% 8.56/8.75 Model 10 [ 42 24 108688 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 Stopped by limit on insertions
% 8.56/8.75
% 8.56/8.75 Model 11 [ 56 26 107951 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 ----> UNIT CONFLICT at 8.35 sec ----> 4171 [binary,4170.1,38.1] {-} $F.
% 8.56/8.75
% 8.56/8.75 Length of proof is 8. Level of proof is 4.
% 8.56/8.75
% 8.56/8.75 ---------------- PROOF ----------------
% 8.56/8.75 % SZS status Unsatisfiable
% 8.56/8.75 % SZS output start Refutation
% 8.56/8.75
% 8.56/8.75 4 [] {+} -between(A,B,A)|A=B.
% 8.56/8.75 5 [] {+} -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 8.56/8.75 6 [] {+} -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 8.56/8.75 35 [] {+} -between(A,B,C)|between(C,B,A).
% 8.56/8.75 38 [] {+} -between(v,w,x).
% 8.56/8.75 65 [] {-} A=extension(B,A,C,C).
% 8.56/8.75 67,66 [copy,65,flip.1] {+} extension(A,B,C,C)=B.
% 8.56/8.75 79 [] {+} between(u,v,w).
% 8.56/8.75 80 [] {+} between(u,w,x).
% 8.56/8.75 87 [hyper,79,35] {+} between(w,v,u).
% 8.56/8.75 143 [hyper,80,35] {+} between(x,w,u).
% 8.56/8.75 312 [hyper,143,6,87] {-} between(w,inner_pasch(w,v,u,w,x),w).
% 8.56/8.75 314 [hyper,143,5,87] {+} between(v,inner_pasch(w,v,u,w,x),x).
% 8.56/8.75 525 [para_into,66.1.1,4.2.1,demod,67,67] {+} A=B| -between(B,A,B).
% 8.56/8.75 4169,4168 [hyper,312,525] {-} inner_pasch(w,v,u,w,x)=w.
% 8.56/8.75 4170 [back_demod,314,demod,4169] {-} between(v,w,x).
% 8.56/8.75 4171 [binary,4170.1,38.1] {-} $F.
% 8.56/8.75
% 8.56/8.75 % SZS output end Refutation
% 8.56/8.75 ------------ end of proof -------------
% 8.56/8.75
% 8.56/8.75
% 8.56/8.75 Search stopped by max_proofs option.
% 8.56/8.75
% 8.56/8.75
% 8.56/8.75 Search stopped by max_proofs option.
% 8.56/8.75
% 8.56/8.75 ============ end of search ============
% 8.56/8.75
% 8.56/8.75 ----------- soft-scott stats ----------
% 8.56/8.75
% 8.56/8.75 true clauses given 16 (25.4%)
% 8.56/8.75 false clauses given 47
% 8.56/8.75
% 8.56/8.75 FALSE TRUE
% 8.56/8.75 6 0 1
% 8.56/8.75 7 0 19
% 8.56/8.75 8 0 33
% 8.56/8.75 9 29 43
% 8.56/8.75 10 11 24
% 8.56/8.75 11 70 60
% 8.56/8.75 12 114 110
% 8.56/8.75 13 70 73
% 8.56/8.75 14 39 26
% 8.56/8.75 15 104 92
% 8.56/8.75 16 109 124
% 8.56/8.75 17 55 83
% 8.56/8.75 18 15 48
% 8.56/8.75 19 23 175
% 8.56/8.75 20 29 95
% 8.56/8.75 21 63 120
% 8.56/8.75 22 45 45
% 8.56/8.75 23 22 70
% 8.56/8.75 24 82 211
% 8.56/8.75 25 119 165
% 8.56/8.75 26 74 133
% 8.56/8.75 27 26 118
% 8.56/8.75 28 2 28
% 8.56/8.75 29 20 23
% 8.56/8.75 30 63 72
% 8.56/8.75 31 68 70
% 8.56/8.75 32 16 8
% 8.56/8.75 33 3 43
% 8.56/8.75 34 17 11
% 8.56/8.75 35 49 58
% 8.56/8.75 36 18 18
% 8.56/8.75 37 3 110
% 8.56/8.75 38 0 30
% 8.56/8.75 39 2 18
% 8.56/8.75 40 8 28
% 8.56/8.75 41 2 92
% 8.56/8.75 42 5 29
% 8.56/8.75 43 1 7
% 8.56/8.75 44 2 9
% 8.56/8.75 45 3 14
% 8.56/8.75 46 2 2
% 8.56/8.75 47 2 3
% 8.56/8.75 48 0 5
% 8.56/8.75 49 2 13
% 8.56/8.75 50 3 6
% 8.56/8.75 51 0 11
% 8.56/8.75 52 7 9
% 8.56/8.75 54 0 2
% 8.56/8.75 55 0 10
% 8.56/8.75 56 0 2
% 8.56/8.75 59 1 3
% 8.56/8.75 60 0 2
% 8.56/8.75 tot: 1398 2604 (65.1% true)
% 8.56/8.75
% 8.56/8.75
% 8.56/8.75 Model 11 [ 56 26 107951 ] (0.00 seconds, 250000 Inserts)
% 8.56/8.75
% 8.56/8.75 That finishes the proof of the theorem.
% 8.56/8.75
% 8.56/8.75 Process 2451 finished Sat Jun 18 10:48:31 2022
%------------------------------------------------------------------------------