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