TSTP Solution File: GEO046-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO046-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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 4.30s 4.50s
% Output : Refutation 4.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO046-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n016.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 17:17:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n016.cluster.edu,
% 0.12/0.36 Fri Jun 17 17:17:36 2022
% 0.12/0.36 The command was "./sos". The process ID is 25622.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.12/0.36 Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 64 during input processing: 0 [demod,67] {-} between(A,B,extension(A,B,A,B)).
% 0.12/0.36 Following clause subsumed by 65 during input processing: 0 [demod,67] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.12/0.36 Following clause subsumed by 73 during input processing: 0 [] {-} A=A.
% 0.12/0.36 63 back subsumes 60.
% 0.12/0.36 68 back subsumes 55.
% 0.12/0.36 68 back subsumes 42.
% 0.12/0.36 Following clause subsumed by 73 during input processing: 0 [copy,73,flip.1] {-} A=A.
% 0.12/0.36 73 back subsumes 58.
% 0.12/0.36 73 back subsumes 57.
% 0.12/0.36 73 back subsumes 56.
% 0.12/0.36 74 back subsumes 43.
% 0.12/0.36 81 back subsumes 59.
% 0.12/0.36 81 back subsumes 47.
% 0.12/0.36 81 back subsumes 46.
% 0.12/0.36 82 back subsumes 48.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.82/1.03
% 0.82/1.03 Model 1 (0.00 seconds, 0 Inserts)
% 0.82/1.03
% 0.82/1.03 Stopped by limit on number of solutions
% 0.82/1.03
% 0.82/1.03
% 0.82/1.03 -------------- Softie stats --------------
% 0.82/1.03
% 0.82/1.03 UPDATE_STOP: 300
% 0.82/1.03 SFINDER_TIME_LIMIT: 2
% 0.82/1.03 SHORT_CLAUSE_CUTOFF: 4
% 0.82/1.03 number of clauses in intial UL: 46
% 0.82/1.03 number of clauses initially in problem: 65
% 0.82/1.03 percentage of clauses intially in UL: 70
% 0.82/1.03 percentage of distinct symbols occuring in initial UL: 87
% 0.82/1.03 percent of all initial clauses that are short: 100
% 0.82/1.03 absolute distinct symbol count: 16
% 0.82/1.03 distinct predicate count: 3
% 0.82/1.03 distinct function count: 6
% 0.82/1.03 distinct constant count: 7
% 0.82/1.03
% 0.82/1.03 ---------- no more Softie stats ----------
% 0.82/1.03
% 0.82/1.03
% 0.82/1.03
% 0.82/1.03 Model 2 (0.00 seconds, 0 Inserts)
% 0.82/1.03
% 0.82/1.03 Stopped by limit on number of solutions
% 0.82/1.03
% 0.82/1.03 =========== start of search ===========
% 4.30/4.50
% 4.30/4.50 -------- PROOF --------
% 4.30/4.50 % SZS status Unsatisfiable
% 4.30/4.50 % SZS output start Refutation
% 4.30/4.50
% 4.30/4.50 Model 3 (0.00 seconds, 0 Inserts)
% 4.30/4.50
% 4.30/4.50 Stopped by limit on number of solutions
% 4.30/4.50
% 4.30/4.50 Stopped by limit on insertions
% 4.30/4.50
% 4.30/4.50 Model 4 [ 1 24 97653 ] (0.00 seconds, 250000 Inserts)
% 4.30/4.50
% 4.30/4.50 Stopped by limit on insertions
% 4.30/4.50
% 4.30/4.50 Model 5 [ 1 23 95521 ] (0.00 seconds, 250000 Inserts)
% 4.30/4.50
% 4.30/4.50 Stopped by limit on insertions
% 4.30/4.50
% 4.30/4.50 Model 6 [ 8 20 82412 ] (0.00 seconds, 250000 Inserts)
% 4.30/4.50
% 4.30/4.50 Stopped by limit on insertions
% 4.30/4.50
% 4.30/4.50 Model 7 [ 2 26 109089 ] (0.00 seconds, 250000 Inserts)
% 4.30/4.50
% 4.30/4.50 Stopped by limit on insertions
% 4.30/4.50
% 4.30/4.50 Model 8 [ 2 59 136625 ] (0.00 seconds, 250000 Inserts)
% 4.30/4.50
% 4.30/4.50 Stopped by limit on insertions
% 4.30/4.50
% 4.30/4.50 Model 9 [ 40 20 93795 ] (0.00 seconds, 250000 Inserts)
% 4.30/4.50
% 4.30/4.50 Stopped by limit on insertions
% 4.30/4.50
% 4.30/4.50 ----> UNIT CONFLICT at 4.11 sec ----> 849 [binary,848.1,41.1] {-} $F.
% 4.30/4.50
% 4.30/4.50 Length of proof is 6. Level of proof is 5.
% 4.30/4.50
% 4.30/4.50 ---------------- PROOF ----------------
% 4.30/4.50 % SZS status Unsatisfiable
% 4.30/4.50 % SZS output start Refutation
% 4.30/4.50
% 4.30/4.50 35 [] {+} -between(A,B,C)|between(C,B,A).
% 4.30/4.50 38 [] {+} -between(A,B,C)| -between(A,C,D)|between(B,C,D).
% 4.30/4.50 40 [] {+} -between(A,B,C)| -between(B,C,D)|between(A,B,D)|B=C.
% 4.30/4.50 41 [] {+} -between(u,w,x).
% 4.30/4.50 83 [] {+} between(u,v,x).
% 4.30/4.50 84 [] {+} between(v,w,x).
% 4.30/4.50 91 [hyper,83,35] {+} between(x,v,u).
% 4.30/4.50 154 [hyper,84,35] {+} between(x,w,v).
% 4.30/4.50 346 [hyper,154,38,91] {+} between(w,v,u).
% 4.30/4.50 568 [hyper,346,40,154] {-} between(x,w,u)|w=v.
% 4.30/4.50 841 [para_from,568.2.1,41.1.2,unit_del,83] {-} between(x,w,u).
% 4.30/4.50 848 [hyper,841,35] {-} between(u,w,x).
% 4.30/4.50 849 [binary,848.1,41.1] {-} $F.
% 4.30/4.50
% 4.30/4.50 % SZS output end Refutation
% 4.30/4.50 ------------ end of proof -------------
% 4.30/4.50
% 4.30/4.50
% 4.30/4.50 Search stopped by max_proofs option.
% 4.30/4.50
% 4.30/4.50
% 4.30/4.50 Search stopped by max_proofs option.
% 4.30/4.50
% 4.30/4.50 ============ end of search ============
% 4.30/4.50
% 4.30/4.50 ----------- soft-scott stats ----------
% 4.30/4.50
% 4.30/4.50 true clauses given 4 (26.7%)
% 4.30/4.50 false clauses given 11
% 4.30/4.50
% 4.30/4.50 FALSE TRUE
% 4.30/4.50 4 0 1
% 4.30/4.50 7 0 1
% 4.30/4.50 8 8 13
% 4.30/4.50 9 36 58
% 4.30/4.50 10 5 21
% 4.30/4.50 11 10 22
% 4.30/4.50 12 29 69
% 4.30/4.50 13 4 8
% 4.30/4.50 14 2 1
% 4.30/4.50 15 9 15
% 4.30/4.50 16 17 36
% 4.30/4.50 17 14 37
% 4.30/4.50 18 1 4
% 4.30/4.50 19 6 3
% 4.30/4.50 20 12 50
% 4.30/4.50 21 15 20
% 4.30/4.50 22 7 11
% 4.30/4.50 23 4 23
% 4.30/4.50 24 6 3
% 4.30/4.50 25 6 4
% 4.30/4.50 26 6 13
% 4.30/4.50 27 1 16
% 4.30/4.50 28 0 4
% 4.30/4.50 29 9 5
% 4.30/4.50 30 2 3
% 4.30/4.50 31 8 10
% 4.30/4.50 33 0 3
% 4.30/4.50 34 6 0
% 4.30/4.50 35 0 1
% 4.30/4.50 36 1 0
% 4.30/4.50 37 6 10
% 4.30/4.50 38 0 1
% 4.30/4.50 39 2 1
% 4.30/4.50 40 3 0
% 4.30/4.50 42 1 1
% 4.30/4.50 43 1 1
% 4.30/4.50 44 1 0
% 4.30/4.50 45 0 1
% 4.30/4.50 46 1 0
% 4.30/4.50 47 1 0
% 4.30/4.50 49 0 1
% 4.30/4.50 50 1 0
% 4.30/4.50 tot: 241 471 (66.2% true)
% 4.30/4.50
% 4.30/4.50
% 4.30/4.50 Model 9 [ 40 -22 93795 ] (0.00 seconds, 250000 Inserts)
% 4.30/4.50
% 4.30/4.50 That finishes the proof of the theorem.
% 4.30/4.50
% 4.30/4.50 Process 25622 finished Fri Jun 17 17:17:40 2022
%------------------------------------------------------------------------------