TSTP Solution File: GEO006-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO006-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:18 EDT 2022
% Result : Unsatisfiable 2.54s 2.74s
% Output : Refutation 2.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO006-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 14:41:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 ----- Otter 3.2, August 2001 -----
% 0.13/0.38 The process was started by sandbox on n020.cluster.edu,
% 0.13/0.38 Sat Jun 18 14:41:03 2022
% 0.13/0.38 The command was "./sos". The process ID is 11631.
% 0.13/0.38
% 0.13/0.38 set(prolog_style_variables).
% 0.13/0.38 set(auto).
% 0.13/0.38 dependent: set(auto1).
% 0.13/0.38 dependent: set(process_input).
% 0.13/0.38 dependent: clear(print_kept).
% 0.13/0.38 dependent: clear(print_new_demod).
% 0.13/0.38 dependent: clear(print_back_demod).
% 0.13/0.38 dependent: clear(print_back_sub).
% 0.13/0.38 dependent: set(control_memory).
% 0.13/0.38 dependent: assign(max_mem, 12000).
% 0.13/0.38 dependent: assign(pick_given_ratio, 4).
% 0.13/0.38 dependent: assign(stats_level, 1).
% 0.13/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.38 dependent: assign(sos_limit, 5000).
% 0.13/0.38 dependent: assign(max_weight, 60).
% 0.13/0.38 clear(print_given).
% 0.13/0.38
% 0.13/0.38 list(usable).
% 0.13/0.38
% 0.13/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.38
% 0.13/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.38 clauses in usable.
% 0.13/0.38
% 0.13/0.38 dependent: set(knuth_bendix).
% 0.13/0.38 dependent: set(para_from).
% 0.13/0.38 dependent: set(para_into).
% 0.13/0.38 dependent: clear(para_from_right).
% 0.13/0.38 dependent: clear(para_into_right).
% 0.13/0.38 dependent: set(para_from_vars).
% 0.13/0.38 dependent: set(eq_units_both_ways).
% 0.13/0.38 dependent: set(dynamic_demod_all).
% 0.13/0.38 dependent: set(dynamic_demod).
% 0.13/0.38 dependent: set(order_eq).
% 0.13/0.38 dependent: set(back_demod).
% 0.13/0.38 dependent: set(lrpo).
% 0.13/0.38 dependent: set(hyper_res).
% 0.13/0.38 dependent: set(unit_deletion).
% 0.13/0.38 dependent: set(factor).
% 0.13/0.38
% 0.13/0.38 ------------> process usable:
% 0.13/0.38
% 0.13/0.38 ------------> process sos:
% 0.13/0.38 Following clause subsumed by 65 during input processing: 0 [demod,68] {-} between(A,B,extension(A,B,A,B)).
% 0.13/0.38 Following clause subsumed by 66 during input processing: 0 [demod,68] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.13/0.38 Following clause subsumed by 74 during input processing: 0 [] {-} A=A.
% 0.13/0.38 64 back subsumes 61.
% 0.13/0.38 69 back subsumes 57.
% 0.13/0.38 69 back subsumes 44.
% 0.13/0.38 Following clause subsumed by 74 during input processing: 0 [copy,74,flip.1] {-} A=A.
% 0.13/0.38 74 back subsumes 60.
% 0.13/0.38 74 back subsumes 59.
% 0.13/0.38 74 back subsumes 58.
% 0.13/0.38 75 back subsumes 45.
% 0.13/0.38 82 back subsumes 49.
% 0.13/0.38 82 back subsumes 48.
% 0.13/0.38 83 back subsumes 50.
% 0.13/0.38
% 0.13/0.38 ======= end of input processing =======
% 0.82/1.01
% 0.82/1.01 Model 1 (0.00 seconds, 0 Inserts)
% 0.82/1.01
% 0.82/1.01 Stopped by limit on number of solutions
% 0.82/1.01
% 0.82/1.01
% 0.82/1.01 -------------- Softie stats --------------
% 0.82/1.01
% 0.82/1.01 UPDATE_STOP: 300
% 0.82/1.01 SFINDER_TIME_LIMIT: 2
% 0.82/1.01 SHORT_CLAUSE_CUTOFF: 4
% 0.82/1.01 number of clauses in intial UL: 45
% 0.82/1.01 number of clauses initially in problem: 64
% 0.82/1.01 percentage of clauses intially in UL: 70
% 0.82/1.01 percentage of distinct symbols occuring in initial UL: 93
% 0.82/1.01 percent of all initial clauses that are short: 100
% 0.82/1.01 absolute distinct symbol count: 15
% 0.82/1.01 distinct predicate count: 3
% 0.82/1.01 distinct function count: 6
% 0.82/1.01 distinct constant count: 6
% 0.82/1.01
% 0.82/1.01 ---------- no more Softie stats ----------
% 0.82/1.01
% 0.82/1.01
% 0.82/1.01
% 0.82/1.01 Model 2 (0.00 seconds, 0 Inserts)
% 0.82/1.01
% 0.82/1.01 Stopped by limit on number of solutions
% 0.82/1.01
% 0.82/1.01 =========== start of search ===========
% 2.54/2.74
% 2.54/2.74 -------- PROOF --------
% 2.54/2.74 % SZS status Unsatisfiable
% 2.54/2.74 % SZS output start Refutation
% 2.54/2.74
% 2.54/2.74 Stopped by limit on insertions
% 2.54/2.74
% 2.54/2.74 Model 3 [ 2 24 105396 ] (0.00 seconds, 250000 Inserts)
% 2.54/2.74
% 2.54/2.74 Stopped by limit on insertions
% 2.54/2.74
% 2.54/2.74 Model 4 [ 4 20 85680 ] (0.00 seconds, 250000 Inserts)
% 2.54/2.74
% 2.54/2.74 Stopped by limit on insertions
% 2.54/2.74
% 2.54/2.74 Model 5 [ 2 21 95124 ] (0.00 seconds, 250000 Inserts)
% 2.54/2.74
% 2.54/2.74 ----> UNIT CONFLICT at 2.34 sec ----> 572 [binary,570.1,43.1] {-} $F.
% 2.54/2.74
% 2.54/2.74 Length of proof is 4. Level of proof is 3.
% 2.54/2.74
% 2.54/2.74 ---------------- PROOF ----------------
% 2.54/2.74 % SZS status Unsatisfiable
% 2.54/2.74 % SZS output start Refutation
% 2.54/2.74
% 2.54/2.74 36 [] {+} -between(A,B,C)| -between(B,A,C)|A=B.
% 2.54/2.74 37 [] {+} -between(A,B,C)| -between(A,C,B)|B=C.
% 2.54/2.74 38 [] {-} a!=c.
% 2.54/2.74 39 [copy,38,flip.1] {+} c!=a.
% 2.54/2.74 42 [] {-} c!=d.
% 2.54/2.74 43 [copy,42,flip.1] {+} d!=c.
% 2.54/2.74 84 [] {-} between(a,c,d).
% 2.54/2.74 85 [] {-} between(c,a,d)|between(a,d,c).
% 2.54/2.74 562 [hyper,85,36,84,unit_del,39] {-} between(a,d,c).
% 2.54/2.74 570 [hyper,562,37,84,flip.1] {-} d=c.
% 2.54/2.74 572 [binary,570.1,43.1] {-} $F.
% 2.54/2.74
% 2.54/2.74 % SZS output end Refutation
% 2.54/2.74 ------------ end of proof -------------
% 2.54/2.74
% 2.54/2.74
% 2.54/2.74 Search stopped by max_proofs option.
% 2.54/2.74
% 2.54/2.74
% 2.54/2.74 Search stopped by max_proofs option.
% 2.54/2.74
% 2.54/2.74 ============ end of search ============
% 2.54/2.74
% 2.54/2.74 ----------- soft-scott stats ----------
% 2.54/2.74
% 2.54/2.74 true clauses given 4 (26.7%)
% 2.54/2.74 false clauses given 11
% 2.54/2.74
% 2.54/2.74 FALSE TRUE
% 2.54/2.74 4 1 0
% 2.54/2.74 7 0 1
% 2.54/2.74 8 6 2
% 2.54/2.74 9 42 14
% 2.54/2.74 10 2 9
% 2.54/2.74 11 8 9
% 2.54/2.74 12 26 4
% 2.54/2.74 13 5 6
% 2.54/2.74 14 7 5
% 2.54/2.74 15 22 3
% 2.54/2.74 16 4 7
% 2.54/2.74 17 12 6
% 2.54/2.74 18 5 5
% 2.54/2.74 19 0 5
% 2.54/2.74 20 24 12
% 2.54/2.74 21 15 3
% 2.54/2.74 22 7 5
% 2.54/2.74 23 21 11
% 2.54/2.74 24 17 1
% 2.54/2.74 25 4 6
% 2.54/2.74 26 8 7
% 2.54/2.74 27 7 1
% 2.54/2.74 28 1 14
% 2.54/2.74 29 11 4
% 2.54/2.74 30 2 1
% 2.54/2.74 31 8 1
% 2.54/2.74 33 0 3
% 2.54/2.74 34 11 0
% 2.54/2.74 35 0 1
% 2.54/2.74 36 1 1
% 2.54/2.74 37 6 1
% 2.54/2.74 38 0 1
% 2.54/2.74 39 2 1
% 2.54/2.74 40 8 0
% 2.54/2.74 42 1 1
% 2.54/2.74 43 1 1
% 2.54/2.74 44 1 0
% 2.54/2.74 45 0 1
% 2.54/2.74 46 1 0
% 2.54/2.74 47 1 0
% 2.54/2.74 49 0 1
% 2.54/2.74 50 1 0
% 2.54/2.74 tot: 299 154 (34.0% true)
% 2.54/2.74
% 2.54/2.74
% 2.54/2.74 Model 5 [ 2 -20 95124 ] (0.00 seconds, 250000 Inserts)
% 2.54/2.74
% 2.54/2.74 That finishes the proof of the theorem.
% 2.54/2.74
% 2.54/2.74 Process 11631 finished Sat Jun 18 14:41:06 2022
%------------------------------------------------------------------------------