TSTP Solution File: GEO020-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO020-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:27 EDT 2022
% Result : Unsatisfiable 1.64s 1.84s
% Output : Refutation 1.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO020-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.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 : Fri Jun 17 16:25:24 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 sandbox on n026.cluster.edu,
% 0.12/0.35 Fri Jun 17 16:25:24 2022
% 0.12/0.35 The command was "./sos". The process ID is 14071.
% 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
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 35 back subsumes 32.
% 0.12/0.35 Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.47
% 0.19/0.47 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.47
% 0.19/0.47 Stopped by limit on number of solutions
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 -------------- Softie stats --------------
% 0.19/0.47
% 0.19/0.47 UPDATE_STOP: 300
% 0.19/0.47 SFINDER_TIME_LIMIT: 2
% 0.19/0.47 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.47 number of clauses in intial UL: 33
% 0.19/0.47 number of clauses initially in problem: 38
% 0.19/0.47 percentage of clauses intially in UL: 86
% 0.19/0.47 percentage of distinct symbols occuring in initial UL: 93
% 0.19/0.47 percent of all initial clauses that are short: 100
% 0.19/0.47 absolute distinct symbol count: 15
% 0.19/0.47 distinct predicate count: 3
% 0.19/0.47 distinct function count: 5
% 0.19/0.47 distinct constant count: 7
% 0.19/0.47
% 0.19/0.47 ---------- no more Softie stats ----------
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.47
% 0.19/0.47 Stopped by limit on number of solutions
% 0.19/0.47
% 0.19/0.47 =========== start of search ===========
% 1.64/1.84
% 1.64/1.84 -------- PROOF --------
% 1.64/1.84 % SZS status Unsatisfiable
% 1.64/1.84 % SZS output start Refutation
% 1.64/1.84
% 1.64/1.84 Stopped by limit on insertions
% 1.64/1.84
% 1.64/1.84 Model 3 [ 2 55 182578 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.84
% 1.64/1.84 Model 4 (0.00 seconds, 250000 Inserts)
% 1.64/1.84
% 1.64/1.84 Stopped by limit on number of solutions
% 1.64/1.84
% 1.64/1.84 ----> UNIT CONFLICT at 1.46 sec ----> 279 [binary,278.1,16.1] {-} $F.
% 1.64/1.84
% 1.64/1.84 Length of proof is 3. Level of proof is 3.
% 1.64/1.84
% 1.64/1.84 ---------------- PROOF ----------------
% 1.64/1.84 % SZS status Unsatisfiable
% 1.64/1.84 % SZS output start Refutation
% 1.64/1.84
% 1.64/1.84 1 [] {+} -equidistant(A,B,C,D)| -equidistant(A,B,E,F)|equidistant(C,D,E,F).
% 1.64/1.84 16 [] {+} -equidistant(x,w,u,v).
% 1.64/1.84 35 [] {+} equidistant(A,B,B,A).
% 1.64/1.84 38 [] {-} equidistant(u,v,w,x).
% 1.64/1.84 41 [hyper,38,1,35] {-} equidistant(v,u,w,x).
% 1.64/1.84 111 [hyper,41,1,35] {-} equidistant(w,x,u,v).
% 1.64/1.84 278 [hyper,111,1,35] {-} equidistant(x,w,u,v).
% 1.64/1.84 279 [binary,278.1,16.1] {-} $F.
% 1.64/1.84
% 1.64/1.84 % SZS output end Refutation
% 1.64/1.84 ------------ end of proof -------------
% 1.64/1.84
% 1.64/1.84
% 1.64/1.84 Search stopped by max_proofs option.
% 1.64/1.84
% 1.64/1.84
% 1.64/1.84 Search stopped by max_proofs option.
% 1.64/1.84
% 1.64/1.84 ============ end of search ============
% 1.64/1.84
% 1.64/1.84 ----------- soft-scott stats ----------
% 1.64/1.84
% 1.64/1.84 true clauses given 1 (12.5%)
% 1.64/1.84 false clauses given 7
% 1.64/1.84
% 1.64/1.84 FALSE TRUE
% 1.64/1.84 5 2 0
% 1.64/1.84 9 13 0
% 1.64/1.84 10 12 0
% 1.64/1.84 13 0 3
% 1.64/1.84 14 0 12
% 1.64/1.84 16 0 1
% 1.64/1.84 17 0 1
% 1.64/1.84 18 12 12
% 1.64/1.84 19 0 1
% 1.64/1.84 20 0 1
% 1.64/1.84 22 24 1
% 1.64/1.84 23 12 3
% 1.64/1.84 24 0 13
% 1.64/1.84 27 12 12
% 1.64/1.84 28 0 7
% 1.64/1.84 30 0 3
% 1.64/1.84 32 12 0
% 1.64/1.84 33 0 39
% 1.64/1.84 34 0 1
% 1.64/1.84 35 0 1
% 1.64/1.84 37 0 2
% 1.64/1.84 38 0 13
% 1.64/1.84 39 0 1
% 1.64/1.84 40 0 1
% 1.64/1.84 42 0 1
% 1.64/1.84 43 0 1
% 1.64/1.84 44 0 1
% 1.64/1.84 49 0 1
% 1.64/1.84 tot: 99 132 (57.1% true)
% 1.64/1.84
% 1.64/1.84
% 1.64/1.84 Model 4 (0.00 seconds, 250000 Inserts)
% 1.64/1.84
% 1.64/1.84 That finishes the proof of the theorem.
% 1.64/1.84
% 1.64/1.84 Process 14071 finished Fri Jun 17 16:25:25 2022
%------------------------------------------------------------------------------