TSTP Solution File: GEO064-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO064-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:50 EDT 2022
% Result : Unsatisfiable 46.39s 46.58s
% Output : Refutation 46.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO064-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n009.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 : Sat Jun 18 00:49:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n009.cluster.edu,
% 0.13/0.36 Sat Jun 18 00:49:07 2022
% 0.13/0.36 The command was "./sos". The process ID is 13552.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 40 back subsumes 37.
% 0.13/0.36 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 1.16/1.34
% 1.16/1.34 Model 1 (0.00 seconds, 0 Inserts)
% 1.16/1.34
% 1.16/1.34 Stopped by limit on number of solutions
% 1.16/1.34
% 1.16/1.34
% 1.16/1.34 -------------- Softie stats --------------
% 1.16/1.34
% 1.16/1.34 UPDATE_STOP: 300
% 1.16/1.34 SFINDER_TIME_LIMIT: 2
% 1.16/1.34 SHORT_CLAUSE_CUTOFF: 4
% 1.16/1.34 number of clauses in intial UL: 38
% 1.16/1.34 number of clauses initially in problem: 43
% 1.16/1.34 percentage of clauses intially in UL: 88
% 1.16/1.34 percentage of distinct symbols occuring in initial UL: 93
% 1.16/1.34 percent of all initial clauses that are short: 100
% 1.16/1.34 absolute distinct symbol count: 15
% 1.16/1.34 distinct predicate count: 4
% 1.16/1.34 distinct function count: 5
% 1.16/1.34 distinct constant count: 6
% 1.16/1.34
% 1.16/1.34 ---------- no more Softie stats ----------
% 1.16/1.34
% 1.16/1.34
% 1.16/1.34
% 1.16/1.34 Model 2 (0.00 seconds, 0 Inserts)
% 1.16/1.34
% 1.16/1.34 Stopped by limit on number of solutions
% 1.16/1.34
% 1.16/1.34 =========== start of search ===========
% 46.39/46.58
% 46.39/46.58 -- HEY sandbox, WE HAVE A PROOF!! --
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 3 [ 6 18 82805 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 4 [ 6 53 200400 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 5 [ 40 44 178228 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 6 [ 45 65 246445 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 7 [ 78 28 120942 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 8 [ 131 9 40258 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 9 [ 109 34 139729 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 10 [ 104 62 184058 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 11 [ 187 12 51384 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 12 [ 202 14 58647 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 Model 13 [ 84 64 221211 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 Stopped by limit on insertions
% 46.39/46.58
% 46.39/46.58 ----> UNIT CONFLICT at 46.18 sec ----> 6180 [binary,6179.1,20.1] {-} $F.
% 46.39/46.58
% 46.39/46.58 Length of proof is 8. Level of proof is 6.
% 46.39/46.58
% 46.39/46.58 ---------------- PROOF ----------------
% 46.39/46.58 % SZS status Unsatisfiable
% 46.39/46.58 % SZS output start Refutation
% 46.39/46.58
% 46.39/46.58 2 [] {+} -equidistant(A,B,C,C)|A=B.
% 46.39/46.58 4 [] {+} -between(A,B,A)|A=B.
% 46.39/46.58 5 [] {+} -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 46.39/46.58 6 [] {+} -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 46.39/46.58 16 [] {+} -between(A,B,C)|colinear(A,B,C).
% 46.39/46.58 20 [] {+} -colinear(u,v,w).
% 46.39/46.58 41 [] {+} between(A,B,extension(A,B,C,D)).
% 46.39/46.58 42 [] {+} equidistant(A,extension(B,A,C,D),C,D).
% 46.39/46.58 43 [] {-} between(w,v,u).
% 46.39/46.58 475,474 [hyper,42,2,flip.1] {+} extension(A,B,C,C)=B.
% 46.39/46.58 603 [para_into,474.1.1,4.2.1,demod,475,475] {+} A=B| -between(B,A,B).
% 46.39/46.58 607 [para_from,474.1.1,41.1.3] {+} between(A,B,B).
% 46.39/46.58 973 [hyper,607,6,43] {-} between(u,inner_pasch(w,v,u,u,A),w).
% 46.39/46.58 978 [hyper,607,5,43] {-} between(v,inner_pasch(w,v,u,u,A),A).
% 46.39/46.58 5787 [hyper,978,603] {-} inner_pasch(w,v,u,u,v)=v.
% 46.39/46.58 6163 [para_from,5787.1.1,973.1.2] {-} between(u,v,w).
% 46.39/46.58 6179 [hyper,6163,16] {-} colinear(u,v,w).
% 46.39/46.58 6180 [binary,6179.1,20.1] {-} $F.
% 46.39/46.58
% 46.39/46.58 % SZS output end Refutation
% 46.39/46.58 ------------ end of proof -------------
% 46.39/46.58
% 46.39/46.58
% 46.39/46.58 Search stopped by max_proofs option.
% 46.39/46.58
% 46.39/46.58
% 46.39/46.58 Search stopped by max_proofs option.
% 46.39/46.58
% 46.39/46.58 ============ end of search ============
% 46.39/46.58
% 46.39/46.58 ----------- soft-scott stats ----------
% 46.39/46.58
% 46.39/46.58 true clauses given 19 (22.9%)
% 46.39/46.58 false clauses given 64
% 46.39/46.58
% 46.39/46.58 FALSE TRUE
% 46.39/46.58 5 0 1
% 46.39/46.58 8 0 46
% 46.39/46.58 9 8 41
% 46.39/46.58 10 0 2
% 46.39/46.58 11 1 1
% 46.39/46.58 12 141 9
% 46.39/46.58 13 154 77
% 46.39/46.58 14 46 19
% 46.39/46.58 15 2 4
% 46.39/46.58 16 18 9
% 46.39/46.58 17 36 116
% 46.39/46.58 18 8 27
% 46.39/46.58 19 6 13
% 46.39/46.58 20 7 6
% 46.39/46.58 21 87 292
% 46.39/46.58 22 54 154
% 46.39/46.58 23 17 118
% 46.39/46.58 24 10 11
% 46.39/46.58 25 201 43
% 46.39/46.58 26 211 97
% 46.39/46.58 27 164 145
% 46.39/46.58 28 53 18
% 46.39/46.58 29 18 26
% 46.39/46.58 30 107 91
% 46.39/46.58 31 185 62
% 46.39/46.58 32 73 49
% 46.39/46.58 33 18 70
% 46.39/46.58 34 41 83
% 46.39/46.58 35 91 107
% 46.39/46.58 36 74 105
% 46.39/46.58 37 40 169
% 46.39/46.58 38 30 9
% 46.39/46.58 39 60 63
% 46.39/46.58 40 69 98
% 46.39/46.58 41 140 80
% 46.39/46.58 42 80 27
% 46.39/46.58 43 27 1
% 46.39/46.58 44 54 61
% 46.39/46.58 45 68 70
% 46.39/46.58 46 43 59
% 46.39/46.58 47 13 13
% 46.39/46.58 48 15 13
% 46.39/46.58 49 42 35
% 46.39/46.58 50 51 31
% 46.39/46.58 51 39 0
% 46.39/46.58 52 16 5
% 46.39/46.58 53 8 0
% 46.39/46.58 54 27 0
% 46.39/46.58 55 39 2
% 46.39/46.58 56 20 0
% 46.39/46.58 58 3 0
% 46.39/46.58 59 17 0
% 46.39/46.58 60 11 0
% 46.39/46.58 tot: 2743 2578 (48.4% true)
% 46.39/46.58
% 46.39/46.58
% 46.39/46.58 Model 13 [ 84 -408 221211 ] (0.00 seconds, 250000 Inserts)
% 46.39/46.58
% 46.39/46.58 That finishes the proof of the theorem.
% 46.39/46.58
% 46.39/46.58 Process 13552 finished Sat Jun 18 00:49:54 2022
%------------------------------------------------------------------------------