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