TSTP Solution File: GEO039-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO039-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:12 EDT 2022
% Result : Unsatisfiable 2.19s 2.39s
% Output : Refutation 2.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 13 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 6 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 18 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ e_quidistant(A,B,C,C)
| A = B ),
file('GEO039-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ between(A,B,A)
| A = B ),
file('GEO039-2.p',unknown),
[] ).
cnf(16,axiom,
~ between(v,w,x),
file('GEO039-2.p',unknown),
[] ).
cnf(37,axiom,
between(A,B,extension(A,B,C,D)),
file('GEO039-2.p',unknown),
[] ).
cnf(38,axiom,
e_quidistant(A,extension(B,A,C,D),C,D),
file('GEO039-2.p',unknown),
[] ).
cnf(39,axiom,
between(u,w,x),
file('GEO039-2.p',unknown),
[] ).
cnf(40,axiom,
u = x,
file('GEO039-2.p',unknown),
[] ).
cnf(42,plain,
x = u,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[40])]),
[iquote('copy,40,flip.1')] ).
cnf(43,plain,
between(u,w,u),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[39]),42]),
[iquote('back_demod,39,demod,42')] ).
cnf(44,plain,
~ between(v,w,u),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[16]),42]),
[iquote('back_demod,16,demod,42')] ).
cnf(66,plain,
w = u,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[43,4])]),
[iquote('hyper,43,4,flip.1')] ).
cnf(68,plain,
~ between(v,u,u),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[44]),66]),
[iquote('back_demod,44,demod,66')] ).
cnf(608,plain,
extension(A,B,C,C) = B,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[38,2])]),
[iquote('hyper,38,2,flip.1')] ).
cnf(651,plain,
between(A,B,B),
inference(para_from,[status(thm),theory(equality)],[608,37]),
[iquote('para_from,608.1.1,37.1.3')] ).
cnf(652,plain,
$false,
inference(binary,[status(thm)],[651,68]),
[iquote('binary,651.1,68.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO039-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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:23:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.56/2.16 ----- Otter 3.3f, August 2004 -----
% 1.56/2.16 The process was started by sandbox2 on n026.cluster.edu,
% 1.56/2.16 Wed Jul 27 07:23:54 2022
% 1.56/2.16 The command was "./otter". The process ID is 11998.
% 1.56/2.16
% 1.56/2.16 set(prolog_style_variables).
% 1.56/2.16 set(auto).
% 1.56/2.16 dependent: set(auto1).
% 1.56/2.16 dependent: set(process_input).
% 1.56/2.16 dependent: clear(print_kept).
% 1.56/2.16 dependent: clear(print_new_demod).
% 1.56/2.16 dependent: clear(print_back_demod).
% 1.56/2.16 dependent: clear(print_back_sub).
% 1.56/2.16 dependent: set(control_memory).
% 1.56/2.16 dependent: assign(max_mem, 12000).
% 1.56/2.16 dependent: assign(pick_given_ratio, 4).
% 1.56/2.16 dependent: assign(stats_level, 1).
% 1.56/2.16 dependent: assign(max_seconds, 10800).
% 1.56/2.16 clear(print_given).
% 1.56/2.16
% 1.56/2.16 list(usable).
% 1.56/2.16 0 [] A=A.
% 1.56/2.16 0 [] e_quidistant(X,Y,Y,X).
% 1.56/2.16 0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.56/2.16 0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.56/2.16 0 [] between(X,Y,extension(X,Y,W,V)).
% 1.56/2.16 0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.56/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.56/2.16 0 [] -between(X,Y,X)|X=Y.
% 1.56/2.16 0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.56/2.16 0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.56/2.16 0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.56/2.16 0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.56/2.16 0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.56/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.56/2.16 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,V,euclid1(U,V,W,X,Y)).
% 1.56/2.16 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,X,euclid2(U,V,W,X,Y)).
% 1.56/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.56/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.56/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.56/2.16 0 [] between(u,w,x).
% 1.56/2.16 0 [] u=x.
% 1.56/2.16 0 [] -between(v,w,x).
% 1.56/2.16 end_of_list.
% 1.56/2.16
% 1.56/2.16 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.56/2.16
% 1.56/2.16 This ia a non-Horn set with equality. The strategy will be
% 1.56/2.16 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.56/2.16 deletion, with positive clauses in sos and nonpositive
% 1.56/2.16 clauses in usable.
% 1.56/2.16
% 1.56/2.16 dependent: set(knuth_bendix).
% 1.56/2.16 dependent: set(anl_eq).
% 1.56/2.16 dependent: set(para_from).
% 1.56/2.16 dependent: set(para_into).
% 1.56/2.16 dependent: clear(para_from_right).
% 1.56/2.16 dependent: clear(para_into_right).
% 1.56/2.16 dependent: set(para_from_vars).
% 1.56/2.16 dependent: set(eq_units_both_ways).
% 1.56/2.16 dependent: set(dynamic_demod_all).
% 1.56/2.16 dependent: set(dynamic_demod).
% 1.56/2.16 dependent: set(order_eq).
% 1.56/2.16 dependent: set(back_demod).
% 1.56/2.16 dependent: set(lrpo).
% 1.56/2.16 dependent: set(hyper_res).
% 1.56/2.16 dependent: set(unit_deletion).
% 1.56/2.16 dependent: set(factor).
% 1.56/2.16
% 1.56/2.16 ------------> process usable:
% 1.56/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.56/2.16 ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|A=B.
% 1.56/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).
% 1.56/2.16 ** KEPT (pick-wt=7): 4 [] -between(A,B,A)|A=B.
% 1.56/2.16 ** KEPT (pick-wt=17): 5 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 1.56/2.16 ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 1.56/2.16 ** KEPT (pick-wt=4): 7 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.56/2.16 ** KEPT (pick-wt=4): 8 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.56/2.16 ** KEPT (pick-wt=4): 9 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.56/2.16 ** 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.
% 1.56/2.16 ** 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.19/2.39 ** 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.19/2.39 ** 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.19/2.39 ** 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.19/2.39 ** 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.19/2.39 ** KEPT (pick-wt=4): 16 [] -between(v,w,x).
% 2.19/2.39
% 2.19/2.39 ------------> process sos:
% 2.19/2.39 ** KEPT (pick-wt=3): 35 [] A=A.
% 2.19/2.39 ** KEPT (pick-wt=5): 36 [] e_quidistant(A,B,B,A).
% 2.19/2.39 ** KEPT (pick-wt=8): 37 [] between(A,B,extension(A,B,C,D)).
% 2.19/2.39 ** KEPT (pick-wt=9): 38 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 2.19/2.39 ** KEPT (pick-wt=4): 39 [] between(u,w,x).
% 2.19/2.39 ** KEPT (pick-wt=3): 41 [copy,40,flip.1] x=u.
% 2.19/2.39 ---> New Demodulator: 42 [new_demod,41] x=u.
% 2.19/2.39 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] A=A.
% 2.19/2.39 36 back subsumes 32.
% 2.19/2.39 >>>> Starting back demodulation with 42.
% 2.19/2.39 >> back demodulating 39 with 42.
% 2.19/2.39 >> back demodulating 16 with 42.
% 2.19/2.39
% 2.19/2.39 ======= end of input processing =======
% 2.19/2.39
% 2.19/2.39 =========== start of search ===========
% 2.19/2.39
% 2.19/2.39 -------- PROOF --------
% 2.19/2.39
% 2.19/2.39 ----> UNIT CONFLICT at 0.24 sec ----> 652 [binary,651.1,68.1] $F.
% 2.19/2.39
% 2.19/2.39 Length of proof is 7. Level of proof is 4.
% 2.19/2.39
% 2.19/2.39 ---------------- PROOF ----------------
% 2.19/2.39 % SZS status Unsatisfiable
% 2.19/2.39 % SZS output start Refutation
% See solution above
% 2.19/2.39 ------------ end of proof -------------
% 2.19/2.39
% 2.19/2.39
% 2.19/2.39 Search stopped by max_proofs option.
% 2.19/2.39
% 2.19/2.39
% 2.19/2.39 Search stopped by max_proofs option.
% 2.19/2.39
% 2.19/2.39 ============ end of search ============
% 2.19/2.39
% 2.19/2.39 -------------- statistics -------------
% 2.19/2.39 clauses given 17
% 2.19/2.39 clauses generated 2294
% 2.19/2.39 clauses kept 646
% 2.19/2.39 clauses forward subsumed 1448
% 2.19/2.39 clauses back subsumed 41
% 2.19/2.39 Kbytes malloced 1953
% 2.19/2.39
% 2.19/2.39 ----------- times (seconds) -----------
% 2.19/2.39 user CPU time 0.24 (0 hr, 0 min, 0 sec)
% 2.19/2.39 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.19/2.39 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.19/2.39
% 2.19/2.39 That finishes the proof of the theorem.
% 2.19/2.39
% 2.19/2.39 Process 11998 finished Wed Jul 27 07:23:56 2022
% 2.19/2.39 Otter interrupted
% 2.19/2.39 PROOF FOUND
%------------------------------------------------------------------------------