%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO041-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:38 EDT 2022
% Result : Unsatisfiable 2.12s 2.30s
% Output : Refutation 2.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO041-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n027.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 19:06:38 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 n027.cluster.edu,
% 0.13/0.36 Sat Jun 18 19:06:38 2022
% 0.13/0.36 The command was "./sos". The process ID is 2793.
% 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 Following clause subsumed by 59 during input processing: 0 [demod,62] {-} between(A,B,extension(A,B,A,B)).
% 0.13/0.36 Following clause subsumed by 60 during input processing: 0 [demod,62] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.13/0.36 Following clause subsumed by 68 during input processing: 0 [] {-} A=A.
% 0.13/0.36 58 back subsumes 55.
% 0.13/0.36 63 back subsumes 52.
% 0.13/0.36 63 back subsumes 39.
% 0.13/0.36 Following clause subsumed by 68 during input processing: 0 [copy,68,flip.1] {-} A=A.
% 0.13/0.36 68 back subsumes 54.
% 0.13/0.36 68 back subsumes 53.
% 0.13/0.36 69 back subsumes 40.
% 0.13/0.36 76 back subsumes 44.
% 0.13/0.36 76 back subsumes 43.
% 0.13/0.36 77 back subsumes 45.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.82/1.04
% 0.82/1.04 Model 1 (0.00 seconds, 0 Inserts)
% 0.82/1.04
% 0.82/1.04 Stopped by limit on number of solutions
% 0.82/1.04
% 0.82/1.04
% 0.82/1.04 -------------- Softie stats --------------
% 0.82/1.04
% 0.82/1.04 UPDATE_STOP: 300
% 0.82/1.04 SFINDER_TIME_LIMIT: 2
% 0.82/1.04 SHORT_CLAUSE_CUTOFF: 4
% 0.82/1.04 number of clauses in intial UL: 42
% 0.82/1.04 number of clauses initially in problem: 61
% 0.82/1.04 percentage of clauses intially in UL: 68
% 0.82/1.04 percentage of distinct symbols occuring in initial UL: 86
% 0.82/1.04 percent of all initial clauses that are short: 100
% 0.82/1.04 absolute distinct symbol count: 15
% 0.82/1.04 distinct predicate count: 3
% 0.82/1.04 distinct function count: 6
% 0.82/1.04 distinct constant count: 6
% 0.82/1.04
% 0.82/1.04 ---------- no more Softie stats ----------
% 0.82/1.04
% 0.82/1.04
% 0.82/1.04
% 0.82/1.04 Model 2 (0.00 seconds, 0 Inserts)
% 0.82/1.04
% 0.82/1.04 Stopped by limit on number of solutions
% 0.82/1.04
% 0.82/1.04 =========== start of search ===========
% 2.12/2.30
% 2.12/2.30 -------- PROOF --------
% 2.12/2.30 % SZS status Unsatisfiable
% 2.12/2.30 % SZS output start Refutation
% 2.12/2.30
% 2.12/2.30 Model 3 (0.00 seconds, 0 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on number of solutions
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 4 [ 5 21 80100 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 5 [ 3 22 89659 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 6 [ 4 24 104295 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 ----> UNIT CONFLICT at 1.91 sec ----> 290 [binary,288.1,38.1] {-} $F.
% 2.12/2.30
% 2.12/2.30 Length of proof is 4. Level of proof is 2.
% 2.12/2.30
% 2.12/2.30 ---------------- PROOF ----------------
% 2.12/2.30 % SZS status Unsatisfiable
% 2.12/2.30 % SZS output start Refutation
% 2.12/2.30
% 2.12/2.30 35 [] {+} -between(A,B,C)|between(C,B,A).
% 2.12/2.30 36 [] {+} -between(A,B,C)| -between(B,A,C)|A=B.
% 2.12/2.30 37 [] {-} v!=w.
% 2.12/2.30 38 [copy,37,flip.1] {+} w!=v.
% 2.12/2.30 78 [] {+} between(u,v,w).
% 2.12/2.30 79 [] {+} between(u,w,v).
% 2.12/2.30 86 [hyper,78,35] {+} between(w,v,u).
% 2.12/2.30 139 [hyper,79,35] {+} between(v,w,u).
% 2.12/2.30 288 [hyper,139,36,86] {-} w=v.
% 2.12/2.30 290 [binary,288.1,38.1] {-} $F.
% 2.12/2.30
% 2.12/2.30 % SZS output end Refutation
% 2.12/2.30 ------------ end of proof -------------
% 2.12/2.30
% 2.12/2.30
% 2.12/2.30 Search stopped by max_proofs option.
% 2.12/2.30
% 2.12/2.30
% 2.12/2.30 Search stopped by max_proofs option.
% 2.12/2.30
% 2.12/2.30 ============ end of search ============
% 2.12/2.30
% 2.12/2.30 ----------- soft-scott stats ----------
% 2.12/2.30
% 2.12/2.30 true clauses given 2 (28.6%)
% 2.12/2.30 false clauses given 5
% 2.12/2.30
% 2.12/2.30 FALSE TRUE
% 2.12/2.30 4 0 2
% 2.12/2.30 5 2 0
% 2.12/2.30 7 2 0
% 2.12/2.30 8 6 4
% 2.12/2.30 9 10 6
% 2.12/2.30 10 3 1
% 2.12/2.30 12 6 6
% 2.12/2.30 13 1 2
% 2.12/2.30 14 0 3
% 2.12/2.30 15 7 3
% 2.12/2.30 16 3 6
% 2.12/2.30 17 7 6
% 2.12/2.30 18 0 1
% 2.12/2.30 20 15 16
% 2.12/2.30 21 12 6
% 2.12/2.30 22 7 3
% 2.12/2.30 23 6 4
% 2.12/2.30 24 0 1
% 2.12/2.30 25 1 1
% 2.12/2.30 26 6 3
% 2.12/2.30 27 0 6
% 2.12/2.30 28 0 3
% 2.12/2.30 29 2 1
% 2.12/2.30 31 2 7
% 2.12/2.30 33 0 3
% 2.12/2.30 35 0 1
% 2.12/2.30 37 2 8
% 2.12/2.30 38 0 1
% 2.12/2.30 39 0 1
% 2.12/2.30 42 0 1
% 2.12/2.30 43 0 1
% 2.12/2.30 49 0 1
% 2.12/2.30 tot: 100 108 (51.9% true)
% 2.12/2.30
% 2.12/2.30
% 2.12/2.30 Model 6 [ 4 24 104295 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 That finishes the proof of the theorem.
% 2.12/2.30
% 2.12/2.30 Process 2793 finished Sat Jun 18 19:06:40 2022
%------------------------------------------------------------------------------