%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO021-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:28 EDT 2022
% Result : Unsatisfiable 1.92s 2.10s
% Output : Refutation 1.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO021-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jun 17 23:17:27 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n007.cluster.edu,
% 0.14/0.37 Fri Jun 17 23:17:27 2022
% 0.14/0.37 The command was "./sos". The process ID is 13795.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.14/0.37
% 0.14/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.37 clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 37 back subsumes 34.
% 0.14/0.37 40 back subsumes 33.
% 0.14/0.37 40 back subsumes 19.
% 0.14/0.37 Following clause subsumed by 42 during input processing: 0 [copy,42,flip.1] {-} A=A.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.47/0.71
% 0.47/0.71 Model 1 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 -------------- Softie stats --------------
% 0.47/0.71
% 0.47/0.71 UPDATE_STOP: 300
% 0.47/0.71 SFINDER_TIME_LIMIT: 2
% 0.47/0.71 SHORT_CLAUSE_CUTOFF: 4
% 0.47/0.71 number of clauses in intial UL: 33
% 0.47/0.71 number of clauses initially in problem: 39
% 0.47/0.71 percentage of clauses intially in UL: 84
% 0.47/0.71 percentage of distinct symbols occuring in initial UL: 93
% 0.47/0.71 percent of all initial clauses that are short: 100
% 0.47/0.71 absolute distinct symbol count: 15
% 0.47/0.71 distinct predicate count: 3
% 0.47/0.71 distinct function count: 5
% 0.47/0.71 distinct constant count: 7
% 0.47/0.71
% 0.47/0.71 ---------- no more Softie stats ----------
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 Model 2 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71 =========== start of search ===========
% 1.92/2.10
% 1.92/2.10 -------- PROOF --------
% 1.92/2.10 % SZS status Unsatisfiable
% 1.92/2.10 % SZS output start Refutation
% 1.92/2.10
% 1.92/2.10 Stopped by limit on insertions
% 1.92/2.10
% 1.92/2.10 Model 3 [ 2 64 222769 ] (0.00 seconds, 250000 Inserts)
% 1.92/2.10
% 1.92/2.10 Model 4 (0.00 seconds, 250000 Inserts)
% 1.92/2.10
% 1.92/2.10 Stopped by limit on number of solutions
% 1.92/2.10
% 1.92/2.10 ----> UNIT CONFLICT at 1.71 sec ----> 281 [binary,280.1,18.1] {-} $F.
% 1.92/2.10
% 1.92/2.10 Length of proof is 2. Level of proof is 2.
% 1.92/2.10
% 1.92/2.10 ---------------- PROOF ----------------
% 1.92/2.10 % SZS status Unsatisfiable
% 1.92/2.10 % SZS output start Refutation
% 1.92/2.10
% 1.92/2.10 1 [] {+} -equidistant(A,B,C,D)| -equidistant(A,B,E,F)|equidistant(C,D,E,F).
% 1.92/2.10 17 [] {+} -equidistant(A,B,C,D)|equidistant(B,A,C,D).
% 1.92/2.10 18 [] {+} -equidistant(x,w,v,u).
% 1.92/2.10 37 [] {+} equidistant(A,B,B,A).
% 1.92/2.10 41 [] {-} equidistant(u,v,w,x).
% 1.92/2.10 45 [hyper,41,1,37] {-} equidistant(w,x,v,u).
% 1.92/2.10 280 [hyper,45,17] {-} equidistant(x,w,v,u).
% 1.92/2.10 281 [binary,280.1,18.1] {-} $F.
% 1.92/2.10
% 1.92/2.10 % SZS output end Refutation
% 1.92/2.10 ------------ end of proof -------------
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Search stopped by max_proofs option.
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Search stopped by max_proofs option.
% 1.92/2.10
% 1.92/2.10 ============ end of search ============
% 1.92/2.10
% 1.92/2.10 ----------- soft-scott stats ----------
% 1.92/2.10
% 1.92/2.10 true clauses given 1 (12.5%)
% 1.92/2.10 false clauses given 7
% 1.92/2.10
% 1.92/2.10 FALSE TRUE
% 1.92/2.10 5 2 0
% 1.92/2.10 9 13 0
% 1.92/2.10 10 12 0
% 1.92/2.10 13 0 3
% 1.92/2.10 14 0 12
% 1.92/2.10 16 0 1
% 1.92/2.10 17 0 1
% 1.92/2.10 18 12 12
% 1.92/2.10 19 0 1
% 1.92/2.10 20 0 1
% 1.92/2.10 22 24 1
% 1.92/2.10 23 6 9
% 1.92/2.10 24 12 1
% 1.92/2.10 27 12 12
% 1.92/2.10 28 0 7
% 1.92/2.10 30 0 3
% 1.92/2.10 32 12 0
% 1.92/2.10 33 8 31
% 1.92/2.10 34 0 1
% 1.92/2.10 35 0 1
% 1.92/2.10 37 0 2
% 1.92/2.10 38 12 1
% 1.92/2.10 39 0 1
% 1.92/2.10 40 0 1
% 1.92/2.10 42 0 1
% 1.92/2.10 43 0 1
% 1.92/2.10 44 0 1
% 1.92/2.10 49 0 1
% 1.92/2.10 tot: 125 106 (45.9% true)
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Model 4 (0.00 seconds, 250000 Inserts)
% 1.92/2.10
% 1.92/2.10 That finishes the proof of the theorem.
% 1.92/2.10
% 1.92/2.10 Process 13795 finished Fri Jun 17 23:17:29 2022
%------------------------------------------------------------------------------