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