TSTP Solution File: GEO002-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:14 EDT 2022
% Result : Unsatisfiable 10.04s 10.23s
% Output : Refutation 10.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n011.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 : Sat Jun 18 05:53:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n011.cluster.edu,
% 0.12/0.36 Sat Jun 18 05:53:07 2022
% 0.12/0.36 The command was "./sos". The process ID is 20380.
% 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
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 35 back subsumes 32.
% 0.12/0.36 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.48
% 0.19/0.48 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 -------------- Softie stats --------------
% 0.19/0.48
% 0.19/0.48 UPDATE_STOP: 300
% 0.19/0.48 SFINDER_TIME_LIMIT: 2
% 0.19/0.48 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.48 number of clauses in intial UL: 33
% 0.19/0.48 number of clauses initially in problem: 37
% 0.19/0.48 percentage of clauses intially in UL: 89
% 0.19/0.48 percentage of distinct symbols occuring in initial UL: 92
% 0.19/0.48 percent of all initial clauses that are short: 100
% 0.19/0.48 absolute distinct symbol count: 13
% 0.19/0.48 distinct predicate count: 3
% 0.19/0.48 distinct function count: 5
% 0.19/0.48 distinct constant count: 5
% 0.19/0.48
% 0.19/0.48 ---------- no more Softie stats ----------
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48 =========== start of search ===========
% 10.04/10.23
% 10.04/10.23 -------- PROOF --------
% 10.04/10.23 % SZS status Unsatisfiable
% 10.04/10.23 % SZS output start Refutation
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 3 [ 72 11 27134 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 4 [ 64 93 234701 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 5 [ 174 65 236958 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 6 [ 137 48 182660 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 7 [ 128 3 9706 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 8 [ 138 65 223706 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 9 [ 132 25 83046 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 10 [ 96 55 220245 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 11 [ 170 15 36400 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 12 [ 190 27 100685 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Stopped by limit on insertions
% 10.04/10.23
% 10.04/10.23 Model 13 [ 251 38 93167 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 ----> UNIT CONFLICT at 9.85 sec ----> 762 [binary,761.1,16.1] {+} $F.
% 10.04/10.23
% 10.04/10.23 Length of proof is 7. Level of proof is 5.
% 10.04/10.23
% 10.04/10.23 ---------------- PROOF ----------------
% 10.04/10.23 % SZS status Unsatisfiable
% 10.04/10.23 % SZS output start Refutation
% 10.04/10.23
% 10.04/10.23 2 [] {+} -equidistant(A,B,C,C)|A=B.
% 10.04/10.23 4 [] {+} -between(A,B,A)|A=B.
% 10.04/10.23 5 [] {+} -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 10.04/10.23 6 [] {+} -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 10.04/10.23 16 [] {+} -between(a,a,b).
% 10.04/10.23 36 [] {-} between(A,B,extension(A,B,C,D)).
% 10.04/10.23 37 [] {+} equidistant(A,extension(B,A,C,D),C,D).
% 10.04/10.23 71,70 [hyper,37,2,flip.1] {+} extension(A,B,C,C)=B.
% 10.04/10.23 180 [para_into,70.1.1,4.2.1,demod,71,71] {+} A=B| -between(B,A,B).
% 10.04/10.23 185 [para_from,70.1.1,36.1.3] {-} between(A,B,B).
% 10.04/10.23 218 [hyper,185,6,185] {+} between(A,inner_pasch(B,A,A,A,C),B).
% 10.04/10.23 223 [hyper,185,5,185] {-} between(A,inner_pasch(B,A,A,A,C),C).
% 10.04/10.23 657 [hyper,223,180] {+} inner_pasch(A,B,B,B,B)=B.
% 10.04/10.23 761 [para_from,657.1.1,218.1.2] {-} between(A,A,B).
% 10.04/10.23 762 [binary,761.1,16.1] {+} $F.
% 10.04/10.23
% 10.04/10.23 % SZS output end Refutation
% 10.04/10.23 ------------ end of proof -------------
% 10.04/10.23
% 10.04/10.23
% 10.04/10.23 Search stopped by max_proofs option.
% 10.04/10.23
% 10.04/10.23
% 10.04/10.23 Search stopped by max_proofs option.
% 10.04/10.23
% 10.04/10.23 ============ end of search ============
% 10.04/10.23
% 10.04/10.23 ----------- soft-scott stats ----------
% 10.04/10.23
% 10.04/10.23 true clauses given 3 (15.0%)
% 10.04/10.23 false clauses given 17
% 10.04/10.23
% 10.04/10.23 FALSE TRUE
% 10.04/10.23 8 1 19
% 10.04/10.23 9 6 3
% 10.04/10.23 10 1 0
% 10.04/10.23 11 1 0
% 10.04/10.23 12 4 0
% 10.04/10.23 13 21 2
% 10.04/10.23 14 12 0
% 10.04/10.23 15 3 0
% 10.04/10.23 16 4 2
% 10.04/10.23 17 9 9
% 10.04/10.23 18 10 1
% 10.04/10.23 19 6 2
% 10.04/10.23 20 6 5
% 10.04/10.23 21 5 9
% 10.04/10.23 22 14 5
% 10.04/10.23 23 5 7
% 10.04/10.23 24 10 2
% 10.04/10.23 25 12 13
% 10.04/10.23 26 3 3
% 10.04/10.23 27 14 3
% 10.04/10.23 28 9 1
% 10.04/10.23 29 8 4
% 10.04/10.23 30 5 1
% 10.04/10.23 31 16 7
% 10.04/10.23 32 18 1
% 10.04/10.23 33 11 4
% 10.04/10.23 34 16 0
% 10.04/10.23 35 5 0
% 10.04/10.23 36 13 5
% 10.04/10.23 37 9 6
% 10.04/10.23 38 21 10
% 10.04/10.23 39 14 0
% 10.04/10.23 40 8 1
% 10.04/10.23 41 18 1
% 10.04/10.23 42 17 0
% 10.04/10.23 43 10 0
% 10.04/10.23 44 6 0
% 10.04/10.23 45 19 4
% 10.04/10.23 46 3 0
% 10.04/10.23 47 10 0
% 10.04/10.23 48 9 0
% 10.04/10.23 49 14 1
% 10.04/10.23 50 3 5
% 10.04/10.23 51 8 3
% 10.04/10.23 52 4 2
% 10.04/10.23 53 20 0
% 10.04/10.23 54 7 1
% 10.04/10.23 55 2 0
% 10.04/10.23 56 3 0
% 10.04/10.23 57 6 0
% 10.04/10.23 58 6 0
% 10.04/10.23 59 10 0
% 10.04/10.23 60 0 1
% 10.04/10.23 tot: 475 143 (23.1% true)
% 10.04/10.23
% 10.04/10.23
% 10.04/10.23 Model 13 [ 251 38 93167 ] (0.00 seconds, 250000 Inserts)
% 10.04/10.23
% 10.04/10.23 That finishes the proof of the theorem.
% 10.04/10.23
% 10.04/10.23 Process 20380 finished Sat Jun 18 05:53:17 2022
%------------------------------------------------------------------------------