TSTP Solution File: GEO026-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO026-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-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 : 300s
% DateTime : Wed Jul 27 12:54:10 EDT 2022
% Result : Unsatisfiable 2.13s 2.31s
% Output : Refutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 11 unt; 1 nHn; 11 RR)
% Number of literals : 21 ( 7 equ; 11 neg)
% Maximal clause size : 8 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ e_quidistant(A,B,C,C)
| A = B ),
file('GEO026-3.p',unknown),
[] ).
cnf(3,axiom,
( ~ e_quidistant(A,B,C,D)
| ~ e_quidistant(B,E,D,F)
| ~ e_quidistant(A,G,C,H)
| ~ e_quidistant(B,G,D,H)
| ~ between(A,B,E)
| ~ between(C,D,F)
| A = B
| e_quidistant(E,G,F,H) ),
file('GEO026-3.p',unknown),
[] ).
cnf(30,axiom,
u != v,
file('GEO026-3.p',unknown),
[] ).
cnf(31,plain,
v != u,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[30])]),
[iquote('copy,30,flip.1')] ).
cnf(32,axiom,
w != x,
file('GEO026-3.p',unknown),
[] ).
cnf(33,plain,
x != w,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[32])]),
[iquote('copy,32,flip.1')] ).
cnf(57,axiom,
e_quidistant(A,B,A,B),
file('GEO026-3.p',unknown),
[] ).
cnf(62,axiom,
between(u,v,w),
file('GEO026-3.p',unknown),
[] ).
cnf(63,axiom,
between(u,v,x),
file('GEO026-3.p',unknown),
[] ).
cnf(64,axiom,
e_quidistant(v,w,v,x),
file('GEO026-3.p',unknown),
[] ).
cnf(226,plain,
e_quidistant(w,A,x,A),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[64,3,57,57,57,62,63]),31]),
[iquote('hyper,64,3,57,57,57,62,63,unit_del,31')] ).
cnf(891,plain,
x = w,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[226,2])]),
[iquote('hyper,226,2,flip.1')] ).
cnf(893,plain,
$false,
inference(binary,[status(thm)],[891,33]),
[iquote('binary,891.1,33.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO026-3 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : otter-tptp-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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 07:18:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.16 ----- Otter 3.3f, August 2004 -----
% 1.93/2.16 The process was started by sandbox2 on n011.cluster.edu,
% 1.93/2.16 Wed Jul 27 07:18:40 2022
% 1.93/2.16 The command was "./otter". The process ID is 19653.
% 1.93/2.16
% 1.93/2.16 set(prolog_style_variables).
% 1.93/2.16 set(auto).
% 1.93/2.16 dependent: set(auto1).
% 1.93/2.16 dependent: set(process_input).
% 1.93/2.16 dependent: clear(print_kept).
% 1.93/2.16 dependent: clear(print_new_demod).
% 1.93/2.16 dependent: clear(print_back_demod).
% 1.93/2.16 dependent: clear(print_back_sub).
% 1.93/2.16 dependent: set(control_memory).
% 1.93/2.16 dependent: assign(max_mem, 12000).
% 1.93/2.16 dependent: assign(pick_given_ratio, 4).
% 1.93/2.16 dependent: assign(stats_level, 1).
% 1.93/2.16 dependent: assign(max_seconds, 10800).
% 1.93/2.16 clear(print_given).
% 1.93/2.16
% 1.93/2.16 list(usable).
% 1.93/2.16 0 [] A=A.
% 1.93/2.16 0 [] e_quidistant(X,Y,Y,X).
% 1.93/2.16 0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.93/2.16 0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.93/2.16 0 [] between(X,Y,extension(X,Y,W,V)).
% 1.93/2.16 0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.93/2.16 0 [] -e_quidistant(X,Y,X1,Y1)| -e_quidistant(Y,Z,Y1,Z1)| -e_quidistant(X,V,X1,V1)| -e_quidistant(Y,V,Y1,V1)| -between(X,Y,Z)| -between(X1,Y1,Z1)|X=Y|e_quidistant(Z,V,Z1,V1).
% 1.93/2.16 0 [] -between(X,Y,X)|X=Y.
% 1.93/2.16 0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.93/2.16 0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.93/2.16 0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.93/2.16 0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.93/2.16 0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.93/2.16 0 [] -e_quidistant(X,W,X,V)| -e_quidistant(Y,W,Y,V)| -e_quidistant(Z,W,Z,V)|between(X,Y,Z)|between(Y,Z,X)|between(Z,X,Y)|W=V.
% 1.93/2.16 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,V,euclid1(U,V,W,X,Y)).
% 1.93/2.16 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,X,euclid2(U,V,W,X,Y)).
% 1.93/2.16 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(euclid1(U,V,W,X,Y),Y,euclid2(U,V,W,X,Y)).
% 1.93/2.16 0 [] -e_quidistant(U,V,U,V1)| -e_quidistant(U,X,U,X1)| -between(U,V,X)| -between(V,W,X)|between(V1,continuous(U,V,V1,W,X,X1),X1).
% 1.93/2.16 0 [] -e_quidistant(U,V,U,V1)| -e_quidistant(U,X,U,X1)| -between(U,V,X)| -between(V,W,X)|e_quidistant(U,W,U,continuous(U,V,V1,W,X,X1)).
% 1.93/2.16 0 [] reflection(U,V)=extension(U,V,U,V).
% 1.93/2.16 0 [] e_quidistant(U,V,U,V).
% 1.93/2.16 0 [] -e_quidistant(U,V,W,X)|e_quidistant(W,X,U,V).
% 1.93/2.16 0 [] -e_quidistant(U,V,W,X)|e_quidistant(V,U,W,X).
% 1.93/2.16 0 [] -e_quidistant(U,V,W,X)|e_quidistant(U,V,X,W).
% 1.93/2.16 0 [] -e_quidistant(U,V,W,X)|e_quidistant(V,U,X,W).
% 1.93/2.16 0 [] -e_quidistant(U,V,W,X)|e_quidistant(W,X,V,U).
% 1.93/2.16 0 [] -e_quidistant(U,V,W,X)|e_quidistant(X,W,U,V).
% 1.93/2.16 0 [] -e_quidistant(U,V,W,X)|e_quidistant(X,W,V,U).
% 1.93/2.16 0 [] -e_quidistant(U,V,W,X)| -e_quidistant(W,X,Y,Z)|e_quidistant(U,V,Y,Z).
% 1.93/2.16 0 [] V=extension(U,V,W,W).
% 1.93/2.16 0 [] Y!=extension(U,V,W,X)|between(U,V,Y).
% 1.93/2.16 0 [] between(U,V,reflection(U,V)).
% 1.93/2.16 0 [] e_quidistant(V,reflection(U,V),U,V).
% 1.93/2.16 0 [] U!=V|V=reflection(U,V).
% 1.93/2.16 0 [] U=reflection(U,U).
% 1.93/2.16 0 [] V!=reflection(U,V)|U=V.
% 1.93/2.16 0 [] e_quidistant(U,U,V,V).
% 1.93/2.16 0 [] -e_quidistant(U,V,U1,V1)| -e_quidistant(V,W,V1,W1)| -between(U,V,W)| -between(U1,V1,W1)|e_quidistant(U,W,U1,W1).
% 1.93/2.16 0 [] between(u,v,w).
% 1.93/2.16 0 [] between(u,v,x).
% 1.93/2.16 0 [] e_quidistant(v,w,v,x).
% 1.93/2.16 0 [] u!=v.
% 1.93/2.16 0 [] w!=x.
% 1.93/2.16 end_of_list.
% 1.93/2.16
% 1.93/2.16 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.93/2.16
% 1.93/2.16 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.16 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.16 deletion, with positive clauses in sos and nonpositive
% 1.93/2.16 clauses in usable.
% 1.93/2.16
% 1.93/2.16 dependent: set(knuth_bendix).
% 1.93/2.16 dependent: set(anl_eq).
% 1.93/2.16 dependent: set(para_from).
% 1.93/2.16 dependent: set(para_into).
% 1.93/2.16 dependent: clear(para_from_right).
% 1.93/2.16 dependent: clear(para_into_right).
% 1.93/2.16 dependent: set(para_from_vars).
% 1.93/2.16 dependent: set(eq_units_both_ways).
% 1.93/2.16 dependent: set(dynamic_demod_all).
% 1.93/2.16 dependent: set(dynamic_demod).
% 1.93/2.16 dependent: set(order_eq).
% 1.93/2.16 dependent: set(back_demod).
% 1.93/2.16 dependent: set(lrpo).
% 1.93/2.16 dependent: set(hyper_res).
% 1.93/2.16 dependent: set(unit_deletion).
% 1.93/2.16 dependent: set(factor).
% 1.93/2.16
% 1.93/2.16 ------------> process usable:
% 1.93/2.16 ** KEPT (pick-wt=15): 1 [] -e_quidistant(A,B,C,D)| -e_quidistant(A,B,E,F)|e_quidistant(C,D,E,F).
% 1.93/2.16 ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|A=B.
% 1.93/2.16 ** KEPT (pick-wt=36): 3 [] -e_quidistant(A,B,C,D)| -e_quidistant(B,E,D,F)| -e_quidistant(A,G,C,H)| -e_quidistant(B,G,D,H)| -between(A,B,E)| -between(C,D,F)|A=B|e_quidistant(E,G,F,H).
% 2.05/2.31 ** KEPT (pick-wt=7): 4 [] -between(A,B,A)|A=B.
% 2.05/2.31 ** KEPT (pick-wt=17): 5 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 2.05/2.31 ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 2.05/2.31 ** KEPT (pick-wt=4): 7 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 2.05/2.31 ** KEPT (pick-wt=4): 8 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 2.05/2.31 ** KEPT (pick-wt=4): 9 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 2.05/2.31 ** KEPT (pick-wt=30): 10 [] -e_quidistant(A,B,A,C)| -e_quidistant(D,B,D,C)| -e_quidistant(E,B,E,C)|between(A,D,E)|between(D,E,A)|between(E,A,D)|B=C.
% 2.05/2.31 ** KEPT (pick-wt=20): 11 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,D,euclid1(A,D,B,E,C)).
% 2.05/2.31 ** KEPT (pick-wt=20): 12 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,E,euclid2(A,D,B,E,C)).
% 2.05/2.31 ** KEPT (pick-wt=25): 13 [] -between(A,B,C)| -between(D,B,E)|A=B|between(euclid1(A,D,B,E,C),C,euclid2(A,D,B,E,C)).
% 2.05/2.31 ** KEPT (pick-wt=28): 14 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|between(C,continuous(A,B,C,F,D,E),E).
% 2.05/2.31 ** KEPT (pick-wt=29): 15 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|e_quidistant(A,F,A,continuous(A,B,C,F,D,E)).
% 2.05/2.31 ** KEPT (pick-wt=10): 16 [] -e_quidistant(A,B,C,D)|e_quidistant(C,D,A,B).
% 2.05/2.31 ** KEPT (pick-wt=10): 17 [] -e_quidistant(A,B,C,D)|e_quidistant(B,A,C,D).
% 2.05/2.31 ** KEPT (pick-wt=10): 18 [] -e_quidistant(A,B,C,D)|e_quidistant(A,B,D,C).
% 2.05/2.31 ** KEPT (pick-wt=10): 19 [] -e_quidistant(A,B,C,D)|e_quidistant(B,A,D,C).
% 2.05/2.31 ** KEPT (pick-wt=10): 20 [] -e_quidistant(A,B,C,D)|e_quidistant(C,D,B,A).
% 2.05/2.31 ** KEPT (pick-wt=10): 21 [] -e_quidistant(A,B,C,D)|e_quidistant(D,C,A,B).
% 2.05/2.31 ** KEPT (pick-wt=10): 22 [] -e_quidistant(A,B,C,D)|e_quidistant(D,C,B,A).
% 2.05/2.31 ** KEPT (pick-wt=15): 23 [] -e_quidistant(A,B,C,D)| -e_quidistant(C,D,E,F)|e_quidistant(A,B,E,F).
% 2.05/2.31 ** KEPT (pick-wt=11): 24 [] A!=extension(B,C,D,E)|between(B,C,A).
% 2.05/2.31 ** KEPT (pick-wt=8): 26 [copy,25,flip.2] A!=B|reflection(A,B)=B.
% 2.05/2.31 ** KEPT (pick-wt=8): 28 [copy,27,flip.1] reflection(A,B)!=B|A=B.
% 2.05/2.31 ** KEPT (pick-wt=23): 29 [] -e_quidistant(A,B,C,D)| -e_quidistant(B,E,D,F)| -between(A,B,E)| -between(C,D,F)|e_quidistant(A,E,C,F).
% 2.05/2.31 ** KEPT (pick-wt=3): 31 [copy,30,flip.1] v!=u.
% 2.05/2.31 ** KEPT (pick-wt=3): 33 [copy,32,flip.1] x!=w.
% 2.05/2.31
% 2.05/2.31 ------------> process sos:
% 2.05/2.31 ** KEPT (pick-wt=3): 51 [] A=A.
% 2.05/2.31 ** KEPT (pick-wt=5): 52 [] e_quidistant(A,B,B,A).
% 2.05/2.31 ** KEPT (pick-wt=8): 53 [] between(A,B,extension(A,B,C,D)).
% 2.05/2.31 ** KEPT (pick-wt=9): 54 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 2.05/2.31 ** KEPT (pick-wt=9): 55 [] reflection(A,B)=extension(A,B,A,B).
% 2.05/2.31 ---> New Demodulator: 56 [new_demod,55] reflection(A,B)=extension(A,B,A,B).
% 2.05/2.31 ** KEPT (pick-wt=5): 57 [] e_quidistant(A,B,A,B).
% 2.05/2.31 ** KEPT (pick-wt=7): 59 [copy,58,flip.1] extension(A,B,C,C)=B.
% 2.05/2.31 ---> New Demodulator: 60 [new_demod,59] extension(A,B,C,C)=B.
% 2.05/2.31 Following clause subsumed by 53 during input processing: 0 [demod,56] between(A,B,extension(A,B,A,B)).
% 2.13/2.31 Following clause subsumed by 54 during input processing: 0 [demod,56] e_quidistant(A,extension(B,A,B,A),B,A).
% 2.13/2.31 Following clause subsumed by 51 during input processing: 0 [demod,56,60] A=A.
% 2.13/2.31 ** KEPT (pick-wt=5): 61 [] e_quidistant(A,A,B,B).
% 2.13/2.31 ** KEPT (pick-wt=4): 62 [] between(u,v,w).
% 2.13/2.31 ** KEPT (pick-wt=4): 63 [] between(u,v,x).
% 2.13/2.31 ** KEPT (pick-wt=5): 64 [] e_quidistant(v,w,v,x).
% 2.13/2.31 Following clause subsumed by 51 during input processing: 0 [copy,51,flip.1] A=A.
% 2.13/2.31 52 back subsumes 48.
% 2.13/2.31 >>>> Starting back demodulation with 56.
% 2.13/2.31 >> back demodulating 28 with 56.
% 2.13/2.31 >> back demodulating 26 with 56.
% 2.13/2.31 57 back subsumes 47.
% 2.13/2.31 57 back subsumes 34.
% 2.13/2.31 >>>> Starting back demodulation with 60.
% 2.13/2.31 61 back subsumes 35.
% 2.13/2.31
% 2.13/2.31 ======= end of input processing =======
% 2.13/2.31
% 2.13/2.31 =========== start of search ===========
% 2.13/2.31
% 2.13/2.31 -------- PROOF --------
% 2.13/2.31
% 2.13/2.31 ----> UNIT CONFLICT at 0.15 sec ----> 893 [binary,891.1,33.1] $F.
% 2.13/2.31
% 2.13/2.31 Length of proof is 4. Level of proof is 3.
% 2.13/2.31
% 2.13/2.31 ---------------- PROOF ----------------
% 2.13/2.31 % SZS status Unsatisfiable
% 2.13/2.31 % SZS output start Refutation
% See solution above
% 2.13/2.31 ------------ end of proof -------------
% 2.13/2.31
% 2.13/2.31
% 2.13/2.31 Search stopped by max_proofs option.
% 2.13/2.31
% 2.13/2.31
% 2.13/2.31 Search stopped by max_proofs option.
% 2.13/2.31
% 2.13/2.31 ============ end of search ============
% 2.13/2.31
% 2.13/2.31 -------------- statistics -------------
% 2.13/2.31 clauses given 20
% 2.13/2.31 clauses generated 3690
% 2.13/2.31 clauses kept 884
% 2.13/2.31 clauses forward subsumed 2778
% 2.13/2.31 clauses back subsumed 18
% 2.13/2.31 Kbytes malloced 2929
% 2.13/2.31
% 2.13/2.31 ----------- times (seconds) -----------
% 2.13/2.31 user CPU time 0.15 (0 hr, 0 min, 0 sec)
% 2.13/2.31 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.13/2.31 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.13/2.31
% 2.13/2.31 That finishes the proof of the theorem.
% 2.13/2.31
% 2.13/2.31 Process 19653 finished Wed Jul 27 07:18:42 2022
% 2.13/2.31 Otter interrupted
% 2.13/2.31 PROOF FOUND
%------------------------------------------------------------------------------