%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO003-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:16 EDT 2022
% Result : Unsatisfiable 1.81s 2.02s
% Output : Refutation 1.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO003-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n004.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 11:36:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n004.cluster.edu,
% 0.13/0.37 Sat Jun 18 11:36:38 2022
% 0.13/0.37 The command was "./sos". The process ID is 3746.
% 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 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 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 54 during input processing: 0 [demod,57] {-} between(A,B,extension(A,B,A,B)).
% 0.13/0.37 Following clause subsumed by 55 during input processing: 0 [demod,57] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.13/0.37 Following clause subsumed by 63 during input processing: 0 [] {-} A=A.
% 0.13/0.37 53 back subsumes 50.
% 0.13/0.37 58 back subsumes 48.
% 0.13/0.37 58 back subsumes 35.
% 0.13/0.37 Following clause subsumed by 63 during input processing: 0 [copy,63,flip.1] {-} A=A.
% 0.13/0.37 63 back subsumes 49.
% 0.13/0.37 64 back subsumes 36.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 1.17/1.33
% 1.17/1.33 Model 1 (0.00 seconds, 0 Inserts)
% 1.17/1.33
% 1.17/1.33 Stopped by limit on number of solutions
% 1.17/1.33
% 1.17/1.33
% 1.17/1.33 -------------- Softie stats --------------
% 1.17/1.33
% 1.17/1.33 UPDATE_STOP: 300
% 1.17/1.33 SFINDER_TIME_LIMIT: 2
% 1.17/1.33 SHORT_CLAUSE_CUTOFF: 4
% 1.17/1.33 number of clauses in intial UL: 42
% 1.17/1.33 number of clauses initially in problem: 57
% 1.17/1.33 percentage of clauses intially in UL: 73
% 1.17/1.33 percentage of distinct symbols occuring in initial UL: 92
% 1.17/1.33 percent of all initial clauses that are short: 100
% 1.17/1.33 absolute distinct symbol count: 14
% 1.17/1.33 distinct predicate count: 3
% 1.17/1.33 distinct function count: 6
% 1.17/1.33 distinct constant count: 5
% 1.17/1.33
% 1.17/1.33 ---------- no more Softie stats ----------
% 1.17/1.33
% 1.17/1.33
% 1.17/1.33
% 1.17/1.33 Stopped by limit on insertions
% 1.17/1.33
% 1.17/1.33 =========== start of search ===========
% 1.81/2.02
% 1.81/2.02 -------- PROOF --------
% 1.81/2.02 % SZS status Unsatisfiable
% 1.81/2.02 % SZS output start Refutation
% 1.81/2.02
% 1.81/2.02 Model 2 (0.00 seconds, 0 Inserts)
% 1.81/2.02
% 1.81/2.02 Stopped by limit on number of solutions
% 1.81/2.02
% 1.81/2.02 ----> UNIT CONFLICT at 1.63 sec ----> 138 [binary,137.1,34.1] {-} $F.
% 1.81/2.02
% 1.81/2.02 Length of proof is 2. Level of proof is 2.
% 1.81/2.02
% 1.81/2.02 ---------------- PROOF ----------------
% 1.81/2.02 % SZS status Unsatisfiable
% 1.81/2.02 % SZS output start Refutation
% 1.81/2.02
% 1.81/2.02 34 [] {+} -between(a,b,b).
% 1.81/2.02 54 [] {+} between(A,B,extension(A,B,C,D)).
% 1.81/2.02 59 [] {-} A=extension(B,A,C,C).
% 1.81/2.02 60 [copy,59,flip.1] {-} extension(A,B,C,C)=B.
% 1.81/2.02 137 [para_into,54.1.3,60.1.1] {-} between(A,B,B).
% 1.81/2.02 138 [binary,137.1,34.1] {-} $F.
% 1.81/2.02
% 1.81/2.02 % SZS output end Refutation
% 1.81/2.02 ------------ end of proof -------------
% 1.81/2.02
% 1.81/2.02
% 1.81/2.02 Search stopped by max_proofs option.
% 1.81/2.02
% 1.81/2.02
% 1.81/2.02 Search stopped by max_proofs option.
% 1.81/2.02
% 1.81/2.02 ============ end of search ============
% 1.81/2.02
% 1.81/2.02 ----------- soft-scott stats ----------
% 1.81/2.02
% 1.81/2.02 true clauses given 2 (33.3%)
% 1.81/2.02 false clauses given 4
% 1.81/2.02
% 1.81/2.02 FALSE TRUE
% 1.81/2.02 5 0 1
% 1.81/2.02 7 0 1
% 1.81/2.02 8 0 1
% 1.81/2.02 9 8 0
% 1.81/2.02 10 2 0
% 1.81/2.02 11 0 1
% 1.81/2.02 12 0 1
% 1.81/2.02 13 1 0
% 1.81/2.02 14 1 2
% 1.81/2.02 15 2 0
% 1.81/2.02 16 0 2
% 1.81/2.02 17 2 0
% 1.81/2.02 18 0 2
% 1.81/2.02 19 0 3
% 1.81/2.02 20 0 2
% 1.81/2.02 21 0 1
% 1.81/2.02 22 0 1
% 1.81/2.02 24 1 0
% 1.81/2.02 25 0 2
% 1.81/2.02 29 2 1
% 1.81/2.02 30 0 1
% 1.81/2.02 31 0 1
% 1.81/2.02 34 3 0
% 1.81/2.02 35 1 0
% 1.81/2.02 36 0 2
% 1.81/2.02 38 0 1
% 1.81/2.02 39 1 0
% 1.81/2.02 43 1 0
% 1.81/2.02 44 1 0
% 1.81/2.02 45 0 1
% 1.81/2.02 50 0 1
% 1.81/2.02 tot: 26 28 (51.9% true)
% 1.81/2.02
% 1.81/2.02
% 1.81/2.02 Model 2 (0.00 seconds, 0 Inserts)
% 1.81/2.02
% 1.81/2.02 That finishes the proof of the theorem.
% 1.81/2.02
% 1.81/2.02 Process 3746 finished Sat Jun 18 11:36:40 2022
%------------------------------------------------------------------------------