%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO042-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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 6.21s 6.46s
% Output : Refutation 6.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO042-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 11:59:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n016.cluster.edu,
% 0.12/0.35 Sat Jun 18 11:59:52 2022
% 0.12/0.35 The command was "./sos". The process ID is 31596.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.12/0.35 Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 60 during input processing: 0 [demod,63] {-} between(A,B,extension(A,B,A,B)).
% 0.12/0.35 Following clause subsumed by 61 during input processing: 0 [demod,63] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.12/0.35 Following clause subsumed by 69 during input processing: 0 [] {-} A=A.
% 0.12/0.35 59 back subsumes 56.
% 0.12/0.35 64 back subsumes 52.
% 0.12/0.35 64 back subsumes 39.
% 0.12/0.35 Following clause subsumed by 69 during input processing: 0 [copy,69,flip.1] {-} A=A.
% 0.12/0.35 69 back subsumes 55.
% 0.12/0.35 69 back subsumes 54.
% 0.12/0.35 69 back subsumes 53.
% 0.12/0.35 70 back subsumes 40.
% 0.12/0.35 77 back subsumes 44.
% 0.12/0.35 77 back subsumes 43.
% 0.12/0.35 78 back subsumes 45.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.82/1.01
% 0.82/1.01 Model 1 (0.00 seconds, 0 Inserts)
% 0.82/1.01
% 0.82/1.01 Stopped by limit on number of solutions
% 0.82/1.01
% 0.82/1.01
% 0.82/1.01 -------------- Softie stats --------------
% 0.82/1.01
% 0.82/1.01 UPDATE_STOP: 300
% 0.82/1.01 SFINDER_TIME_LIMIT: 2
% 0.82/1.01 SHORT_CLAUSE_CUTOFF: 4
% 0.82/1.01 number of clauses in intial UL: 43
% 0.82/1.01 number of clauses initially in problem: 62
% 0.82/1.01 percentage of clauses intially in UL: 69
% 0.82/1.01 percentage of distinct symbols occuring in initial UL: 87
% 0.82/1.01 percent of all initial clauses that are short: 100
% 0.82/1.01 absolute distinct symbol count: 16
% 0.82/1.01 distinct predicate count: 3
% 0.82/1.01 distinct function count: 6
% 0.82/1.01 distinct constant count: 7
% 0.82/1.01
% 0.82/1.01 ---------- no more Softie stats ----------
% 0.82/1.01
% 0.82/1.01
% 0.82/1.01
% 0.82/1.01 Model 2 (0.00 seconds, 0 Inserts)
% 0.82/1.01
% 0.82/1.01 Stopped by limit on number of solutions
% 0.82/1.01
% 0.82/1.01 =========== start of search ===========
% 6.21/6.46
% 6.21/6.46 -------- PROOF --------
% 6.21/6.46 % SZS status Unsatisfiable
% 6.21/6.46 % SZS output start Refutation
% 6.21/6.46
% 6.21/6.46 Model 3 (0.00 seconds, 0 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on number of solutions
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 Model 4 [ 1 33 123683 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 Model 5 [ 3 23 88105 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 Model 6 [ 4 28 102498 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 Model 7 [ 2 26 105125 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 Model 8 [ 2 32 116502 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 Model 9 [ 44 28 104447 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 Model 10 [ 42 26 111029 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 Model 11 [ 50 28 116968 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 Stopped by limit on insertions
% 6.21/6.46
% 6.21/6.46 ----> UNIT CONFLICT at 6.08 sec ----> 1931 [binary,1930.1,38.1] {+} $F.
% 6.21/6.46
% 6.21/6.46 Length of proof is 7. Level of proof is 5.
% 6.21/6.46
% 6.21/6.46 ---------------- PROOF ----------------
% 6.21/6.46 % SZS status Unsatisfiable
% 6.21/6.46 % SZS output start Refutation
% 6.21/6.46
% 6.21/6.46 4 [] {+} -between(A,B,A)|A=B.
% 6.21/6.46 5 [] {+} -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 6.21/6.46 6 [] {+} -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 6.21/6.46 35 [] {+} -between(A,B,C)|between(C,B,A).
% 6.21/6.46 38 [] {+} -between(u,v,w).
% 6.21/6.46 65 [] {-} A=extension(B,A,C,C).
% 6.21/6.46 67,66 [copy,65,flip.1] {+} extension(A,B,C,C)=B.
% 6.21/6.46 79 [] {+} between(u,v,x).
% 6.21/6.46 80 [] {+} between(v,w,x).
% 6.21/6.46 146 [hyper,80,6,79] {-} between(v,inner_pasch(v,w,x,v,u),v).
% 6.21/6.46 148 [hyper,80,5,79] {+} between(w,inner_pasch(v,w,x,v,u),u).
% 6.21/6.46 525 [para_into,66.1.1,4.2.1,demod,67,67] {+} A=B| -between(B,A,B).
% 6.21/6.46 1925,1924 [hyper,146,525] {-} inner_pasch(v,w,x,v,u)=v.
% 6.21/6.46 1926 [back_demod,148,demod,1925] {-} between(w,v,u).
% 6.21/6.46 1930 [hyper,1926,35] {-} between(u,v,w).
% 6.21/6.46 1931 [binary,1930.1,38.1] {+} $F.
% 6.21/6.46
% 6.21/6.46 % SZS output end Refutation
% 6.21/6.46 ------------ end of proof -------------
% 6.21/6.46
% 6.21/6.46
% 6.21/6.46 Search stopped by max_proofs option.
% 6.21/6.46
% 6.21/6.46
% 6.21/6.46 Search stopped by max_proofs option.
% 6.21/6.46
% 6.21/6.46 ============ end of search ============
% 6.21/6.46
% 6.21/6.46 ----------- soft-scott stats ----------
% 6.21/6.46
% 6.21/6.46 true clauses given 5 (15.2%)
% 6.21/6.46 false clauses given 28
% 6.21/6.46
% 6.21/6.46 FALSE TRUE
% 6.21/6.46 6 0 1
% 6.21/6.46 8 1 35
% 6.21/6.46 9 36 38
% 6.21/6.46 10 6 15
% 6.21/6.46 11 26 14
% 6.21/6.46 12 88 41
% 6.21/6.46 13 62 13
% 6.21/6.46 14 15 6
% 6.21/6.46 15 52 9
% 6.21/6.46 16 97 19
% 6.21/6.46 17 44 35
% 6.21/6.46 18 3 9
% 6.21/6.46 19 51 9
% 6.21/6.46 20 30 30
% 6.21/6.46 21 62 50
% 6.21/6.46 22 19 29
% 6.21/6.46 23 11 10
% 6.21/6.46 24 127 7
% 6.21/6.46 25 112 9
% 6.21/6.46 26 50 37
% 6.21/6.46 27 55 19
% 6.21/6.46 28 9 3
% 6.21/6.46 29 8 6
% 6.21/6.46 30 54 4
% 6.21/6.46 31 18 50
% 6.21/6.46 32 6 2
% 6.21/6.46 33 3 11
% 6.21/6.46 34 4 0
% 6.21/6.46 35 51 4
% 6.21/6.46 36 10 1
% 6.21/6.46 37 10 50
% 6.21/6.46 38 1 1
% 6.21/6.46 39 2 1
% 6.21/6.46 40 8 1
% 6.21/6.46 41 44 0
% 6.21/6.46 42 14 1
% 6.21/6.46 43 1 1
% 6.21/6.46 44 2 1
% 6.21/6.46 45 3 2
% 6.21/6.46 46 2 0
% 6.21/6.46 47 3 0
% 6.21/6.46 48 0 4
% 6.21/6.46 49 2 1
% 6.21/6.46 50 4 0
% 6.21/6.46 51 1 1
% 6.21/6.46 52 8 0
% 6.21/6.46 56 2 0
% 6.21/6.46 59 1 0
% 6.21/6.46 tot: 1218 580 (32.3% true)
% 6.21/6.46
% 6.21/6.46
% 6.21/6.46 Model 11 [ 50 -39 116968 ] (0.00 seconds, 250000 Inserts)
% 6.21/6.46
% 6.21/6.46 That finishes the proof of the theorem.
% 6.21/6.46
% 6.21/6.46 Process 31596 finished Sat Jun 18 11:59:58 2022
%------------------------------------------------------------------------------