TSTP Solution File: GEO026-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO026-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:30 EDT 2022
% Result : Unsatisfiable 2.52s 2.69s
% Output : Refutation 2.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO026-2 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n021.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 07:35:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox2 on n021.cluster.edu,
% 0.21/0.37 Sat Jun 18 07:35:01 2022
% 0.21/0.37 The command was "./sos". The process ID is 13406.
% 0.21/0.37
% 0.21/0.37 set(prolog_style_variables).
% 0.21/0.37 set(auto).
% 0.21/0.37 dependent: set(auto1).
% 0.21/0.37 dependent: set(process_input).
% 0.21/0.37 dependent: clear(print_kept).
% 0.21/0.37 dependent: clear(print_new_demod).
% 0.21/0.37 dependent: clear(print_back_demod).
% 0.21/0.37 dependent: clear(print_back_sub).
% 0.21/0.37 dependent: set(control_memory).
% 0.21/0.37 dependent: assign(max_mem, 12000).
% 0.21/0.37 dependent: assign(pick_given_ratio, 4).
% 0.21/0.37 dependent: assign(stats_level, 1).
% 0.21/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37 dependent: assign(sos_limit, 5000).
% 0.21/0.37 dependent: assign(max_weight, 60).
% 0.21/0.37 clear(print_given).
% 0.21/0.37
% 0.21/0.37 list(usable).
% 0.21/0.37
% 0.21/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.21/0.37
% 0.21/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.37 clauses in usable.
% 0.21/0.37
% 0.21/0.37 dependent: set(knuth_bendix).
% 0.21/0.37 dependent: set(para_from).
% 0.21/0.37 dependent: set(para_into).
% 0.21/0.37 dependent: clear(para_from_right).
% 0.21/0.37 dependent: clear(para_into_right).
% 0.21/0.37 dependent: set(para_from_vars).
% 0.21/0.37 dependent: set(eq_units_both_ways).
% 0.21/0.37 dependent: set(dynamic_demod_all).
% 0.21/0.37 dependent: set(dynamic_demod).
% 0.21/0.37 dependent: set(order_eq).
% 0.21/0.37 dependent: set(back_demod).
% 0.21/0.37 dependent: set(lrpo).
% 0.21/0.37 dependent: set(hyper_res).
% 0.21/0.37 dependent: set(unit_deletion).
% 0.21/0.37 dependent: set(factor).
% 0.21/0.37
% 0.21/0.37 ------------> process usable:
% 0.21/0.37
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 38 back subsumes 35.
% 0.21/0.37 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] {-} A=A.
% 0.21/0.37
% 0.21/0.37 ======= end of input processing =======
% 0.60/0.81
% 0.60/0.81 Model 1 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 -------------- Softie stats --------------
% 0.60/0.81
% 0.60/0.81 UPDATE_STOP: 300
% 0.60/0.81 SFINDER_TIME_LIMIT: 2
% 0.60/0.81 SHORT_CLAUSE_CUTOFF: 4
% 0.60/0.81 number of clauses in intial UL: 34
% 0.60/0.81 number of clauses initially in problem: 41
% 0.60/0.81 percentage of clauses intially in UL: 82
% 0.60/0.81 percentage of distinct symbols occuring in initial UL: 93
% 0.60/0.81 percent of all initial clauses that are short: 100
% 0.60/0.81 absolute distinct symbol count: 15
% 0.60/0.81 distinct predicate count: 3
% 0.60/0.81 distinct function count: 5
% 0.60/0.81 distinct constant count: 7
% 0.60/0.81
% 0.60/0.81 ---------- no more Softie stats ----------
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 Model 2 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 =========== start of search ===========
% 2.52/2.69
% 2.52/2.69 -------- PROOF --------
% 2.52/2.69 % SZS status Unsatisfiable
% 2.52/2.69 % SZS output start Refutation
% 2.52/2.69
% 2.52/2.69 Model 3 (0.00 seconds, 0 Inserts)
% 2.52/2.69
% 2.52/2.69 Stopped by limit on number of solutions
% 2.52/2.69
% 2.52/2.69 Stopped by limit on insertions
% 2.52/2.69
% 2.52/2.69 Model 4 [ 2 59 199721 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.69
% 2.52/2.69 Stopped by limit on insertions
% 2.52/2.69
% 2.52/2.69 Model 5 [ 5 3 6054 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.69
% 2.52/2.69 Stopped by limit on insertions
% 2.52/2.69
% 2.52/2.69 Model 6 [ 4 31 126652 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.69
% 2.52/2.69 Stopped by limit on insertions
% 2.52/2.69
% 2.52/2.69 Model 7 [ 58 21 69089 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.69
% 2.52/2.69 ----> UNIT CONFLICT at 2.30 sec ----> 284 [binary,282.1,19.1] {+} $F.
% 2.52/2.69
% 2.52/2.69 Length of proof is 6. Level of proof is 4.
% 2.52/2.69
% 2.52/2.69 ---------------- PROOF ----------------
% 2.52/2.69 % SZS status Unsatisfiable
% 2.52/2.69 % SZS output start Refutation
% 2.52/2.69
% 2.52/2.69 1 [] {+} -equidistant(A,B,C,D)| -equidistant(A,B,E,F)|equidistant(C,D,E,F).
% 2.52/2.69 2 [] {+} -equidistant(A,B,C,C)|A=B.
% 2.52/2.69 3 [] {+} -equidistant(A,B,C,D)| -equidistant(B,E,D,F)| -equidistant(A,G,C,H)| -equidistant(B,G,D,H)| -between(A,B,E)| -between(C,D,F)|A=B|equidistant(E,G,F,H).
% 2.52/2.69 16 [] {-} u!=v.
% 2.52/2.69 17 [copy,16,flip.1] {+} v!=u.
% 2.52/2.69 18 [] {-} w!=x.
% 2.52/2.69 19 [copy,18,flip.1] {+} x!=w.
% 2.52/2.69 20 [factor,1.1.2] {+} -equidistant(A,B,C,D)|equidistant(C,D,C,D).
% 2.52/2.69 38 [] {+} equidistant(A,B,B,A).
% 2.52/2.69 41 [] {+} between(u,v,w).
% 2.52/2.69 42 [] {+} between(u,v,x).
% 2.52/2.69 43 [] {+} equidistant(v,w,v,x).
% 2.52/2.69 45 [hyper,38,20] {+} equidistant(A,B,A,B).
% 2.52/2.69 280 [hyper,45,3,45,43,45,41,42,unit_del,17] {-} equidistant(w,A,x,A).
% 2.52/2.69 282 [hyper,280,2,flip.1] {-} x=w.
% 2.52/2.69 284 [binary,282.1,19.1] {+} $F.
% 2.52/2.69
% 2.52/2.69 % SZS output end Refutation
% 2.52/2.69 ------------ end of proof -------------
% 2.52/2.69
% 2.52/2.69
% 2.52/2.69 Search stopped by max_proofs option.
% 2.52/2.69
% 2.52/2.69
% 2.52/2.69 Search stopped by max_proofs option.
% 2.52/2.69
% 2.52/2.69 ============ end of search ============
% 2.52/2.69
% 2.52/2.69 ----------- soft-scott stats ----------
% 2.52/2.69
% 2.52/2.69 true clauses given 1 (12.5%)
% 2.52/2.69 false clauses given 7
% 2.52/2.69
% 2.52/2.69 FALSE TRUE
% 2.52/2.69 4 0 1
% 2.52/2.69 5 0 3
% 2.52/2.69 8 6 0
% 2.52/2.69 9 13 8
% 2.52/2.69 10 0 4
% 2.52/2.69 13 4 7
% 2.52/2.69 14 4 4
% 2.52/2.69 16 5 0
% 2.52/2.69 17 11 4
% 2.52/2.69 18 0 8
% 2.52/2.69 19 0 3
% 2.52/2.69 20 1 0
% 2.52/2.69 21 9 3
% 2.52/2.69 22 10 19
% 2.52/2.69 23 0 10
% 2.52/2.69 24 1 4
% 2.52/2.69 26 12 0
% 2.52/2.69 27 6 8
% 2.52/2.69 28 0 2
% 2.52/2.69 29 2 0
% 2.52/2.69 30 2 1
% 2.52/2.69 31 6 0
% 2.52/2.69 32 0 16
% 2.52/2.69 33 3 11
% 2.52/2.69 34 1 0
% 2.52/2.69 35 0 1
% 2.52/2.69 37 2 6
% 2.52/2.69 38 1 4
% 2.52/2.69 39 1 0
% 2.52/2.69 40 0 1
% 2.52/2.69 42 1 0
% 2.52/2.69 43 1 0
% 2.52/2.69 44 0 1
% 2.52/2.69 49 0 1
% 2.52/2.69 tot: 102 130 (56.0% true)
% 2.52/2.69
% 2.52/2.69
% 2.52/2.69 Model 7 [ 58 -10 69089 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.69
% 2.52/2.69 That finishes the proof of the theorem.
% 2.52/2.69
% 2.52/2.69 Process 13406 finished Sat Jun 18 07:35:04 2022
%------------------------------------------------------------------------------