TSTP Solution File: GEO002-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO002-1 : TPTP v8.1.0. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:03 EDT 2022
% Result : Unsatisfiable 2.46s 2.68s
% Output : Refutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 7 RR)
% Number of literals : 22 ( 5 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-5 aty)
% Number of variables : 40 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ between(A,B,A)
| A = B ),
file('GEO002-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ e_quidistant(A,B,C,C)
| A = B ),
file('GEO002-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ between(A,B,C)
| ~ between(D,C,E)
| between(A,outer_pasch(B,A,D,E,C),D) ),
file('GEO002-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ between(A,B,C)
| ~ between(D,C,E)
| between(E,B,outer_pasch(B,A,D,E,C)) ),
file('GEO002-1.p',unknown),
[] ).
cnf(18,axiom,
~ between(a,a,b),
file('GEO002-1.p',unknown),
[] ).
cnf(42,axiom,
between(A,B,extension(A,B,C,D)),
file('GEO002-1.p',unknown),
[] ).
cnf(43,axiom,
e_quidistant(A,extension(B,A,C,D),C,D),
file('GEO002-1.p',unknown),
[] ).
cnf(97,plain,
extension(A,B,C,C) = B,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[43,4])]),
[iquote('hyper,43,4,flip.1')] ).
cnf(134,plain,
( A = B
| ~ between(B,A,B) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[97,1]),97,97]),
[iquote('para_into,96.1.1,1.2.1,demod,97,97')] ).
cnf(136,plain,
between(A,B,B),
inference(para_from,[status(thm),theory(equality)],[97,42]),
[iquote('para_from,96.1.1,42.1.3')] ).
cnf(165,plain,
between(A,A,outer_pasch(A,B,C,A,A)),
inference(hyper,[status(thm)],[136,7,136]),
[iquote('hyper,136,7,136')] ).
cnf(168,plain,
between(A,outer_pasch(B,A,C,B,B),C),
inference(hyper,[status(thm)],[136,6,136]),
[iquote('hyper,136,6,136')] ).
cnf(820,plain,
outer_pasch(A,B,B,A,A) = B,
inference(hyper,[status(thm)],[168,134]),
[iquote('hyper,168,134')] ).
cnf(826,plain,
between(A,A,B),
inference(para_from,[status(thm),theory(equality)],[820,165]),
[iquote('para_from,820.1.1,165.1.3')] ).
cnf(827,plain,
$false,
inference(binary,[status(thm)],[826,18]),
[iquote('binary,826.1,18.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO002-1 : TPTP v8.1.0. Bugfixed v2.5.0.
% 0.00/0.12 % Command : otter-tptp-script %s
% 0.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Wed Jul 27 07:20:01 EDT 2022
% 0.12/0.32 % CPUTime :
% 1.95/2.14 ----- Otter 3.3f, August 2004 -----
% 1.95/2.14 The process was started by sandbox on n006.cluster.edu,
% 1.95/2.14 Wed Jul 27 07:20:02 2022
% 1.95/2.14 The command was "./otter". The process ID is 13496.
% 1.95/2.14
% 1.95/2.14 set(prolog_style_variables).
% 1.95/2.14 set(auto).
% 1.95/2.14 dependent: set(auto1).
% 1.95/2.14 dependent: set(process_input).
% 1.95/2.14 dependent: clear(print_kept).
% 1.95/2.14 dependent: clear(print_new_demod).
% 1.95/2.14 dependent: clear(print_back_demod).
% 1.95/2.14 dependent: clear(print_back_sub).
% 1.95/2.14 dependent: set(control_memory).
% 1.95/2.14 dependent: assign(max_mem, 12000).
% 1.95/2.14 dependent: assign(pick_given_ratio, 4).
% 1.95/2.14 dependent: assign(stats_level, 1).
% 1.95/2.14 dependent: assign(max_seconds, 10800).
% 1.95/2.14 clear(print_given).
% 1.95/2.14
% 1.95/2.14 list(usable).
% 1.95/2.14 0 [] A=A.
% 1.95/2.14 0 [] -between(X,Y,X)|X=Y.
% 1.95/2.14 0 [] -between(X,Y,V)| -between(Y,Z,V)|between(X,Y,Z).
% 1.95/2.14 0 [] -between(X,Y,Z)| -between(X,Y,V)|X=Y|between(X,Z,V)|between(X,V,Z).
% 1.95/2.14 0 [] e_quidistant(X,Y,Y,X).
% 1.95/2.14 0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.95/2.14 0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.95/2.14 0 [] -between(X,W,V)| -between(Y,V,Z)|between(X,outer_pasch(W,X,Y,Z,V),Y).
% 1.95/2.14 0 [] -between(X,W,V)| -between(Y,V,Z)|between(Z,W,outer_pasch(W,X,Y,Z,V)).
% 1.95/2.14 0 [] -between(X,V,W)| -between(Y,V,Z)|X=V|between(X,Z,euclid1(W,X,Y,Z,V)).
% 1.95/2.14 0 [] -between(X,V,W)| -between(Y,V,Z)|X=V|between(X,Y,euclid2(W,X,Y,Z,V)).
% 1.95/2.14 0 [] -between(X,V,W)| -between(Y,V,Z)|X=V|between(euclid1(W,X,Y,Z,V),W,euclid2(W,X,Y,Z,V)).
% 1.95/2.14 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.95/2.14 0 [] between(X,Y,extension(X,Y,W,V)).
% 1.95/2.14 0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.95/2.14 0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.95/2.14 0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.95/2.14 0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.95/2.14 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.95/2.14 0 [] -e_quidistant(V,X,V,X1)| -e_quidistant(V,Z,V,Z1)| -between(V,X,Z)| -between(X,Y,Z)|e_quidistant(V,Y,V,continuous(X,Y,Z,X1,Z1,V)).
% 1.95/2.14 0 [] -e_quidistant(V,X,V,X1)| -e_quidistant(V,Z,V,Z1)| -between(V,X,Z)| -between(X,Y,Z)|between(X1,continuous(X,Y,Z,X1,Z1,V),Z1).
% 1.95/2.14 0 [] -between(a,a,b).
% 1.95/2.14 end_of_list.
% 1.95/2.14
% 1.95/2.14 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.95/2.14
% 1.95/2.14 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.14 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.14 deletion, with positive clauses in sos and nonpositive
% 1.95/2.14 clauses in usable.
% 1.95/2.14
% 1.95/2.14 dependent: set(knuth_bendix).
% 1.95/2.14 dependent: set(anl_eq).
% 1.95/2.14 dependent: set(para_from).
% 1.95/2.14 dependent: set(para_into).
% 1.95/2.14 dependent: clear(para_from_right).
% 1.95/2.14 dependent: clear(para_into_right).
% 1.95/2.14 dependent: set(para_from_vars).
% 1.95/2.14 dependent: set(eq_units_both_ways).
% 1.95/2.14 dependent: set(dynamic_demod_all).
% 1.95/2.14 dependent: set(dynamic_demod).
% 1.95/2.14 dependent: set(order_eq).
% 1.95/2.14 dependent: set(back_demod).
% 1.95/2.14 dependent: set(lrpo).
% 1.95/2.14 dependent: set(hyper_res).
% 1.95/2.14 dependent: set(unit_deletion).
% 1.95/2.14 dependent: set(factor).
% 1.95/2.14
% 1.95/2.14 ------------> process usable:
% 1.95/2.14 ** KEPT (pick-wt=7): 1 [] -between(A,B,A)|A=B.
% 1.95/2.14 ** KEPT (pick-wt=12): 2 [] -between(A,B,C)| -between(B,D,C)|between(A,B,D).
% 1.95/2.14 ** KEPT (pick-wt=19): 3 [] -between(A,B,C)| -between(A,B,D)|A=B|between(A,C,D)|between(A,D,C).
% 1.95/2.14 ** KEPT (pick-wt=8): 4 [] -e_quidistant(A,B,C,C)|A=B.
% 1.95/2.14 ** KEPT (pick-wt=15): 5 [] -e_quidistant(A,B,C,D)| -e_quidistant(A,B,E,F)|e_quidistant(C,D,E,F).
% 1.95/2.14 ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,C,E)|between(A,outer_pasch(B,A,D,E,C),D).
% 1.95/2.14 ** KEPT (pick-wt=17): 7 [] -between(A,B,C)| -between(D,C,E)|between(E,B,outer_pasch(B,A,D,E,C)).
% 1.95/2.14 ** KEPT (pick-wt=20): 8 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,E,euclid1(C,A,D,E,B)).
% 1.95/2.14 ** KEPT (pick-wt=20): 9 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,D,euclid2(C,A,D,E,B)).
% 1.95/2.14 ** KEPT (pick-wt=25): 10 [] -between(A,B,C)| -between(D,B,E)|A=B|between(euclid1(C,A,D,E,B),C,euclid2(C,A,D,E,B)).
% 1.95/2.14 ** KEPT (pick-wt=36): 11 [] -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.46/2.68 ** KEPT (pick-wt=4): 12 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 2.46/2.68 ** KEPT (pick-wt=4): 13 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 2.46/2.68 ** KEPT (pick-wt=4): 14 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 2.46/2.68 ** KEPT (pick-wt=30): 15 [] -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.46/2.68 ** KEPT (pick-wt=29): 16 [] -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(B,F,D,C,E,A)).
% 2.46/2.68 ** KEPT (pick-wt=28): 17 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|between(C,continuous(B,F,D,C,E,A),E).
% 2.46/2.68 ** KEPT (pick-wt=4): 18 [] -between(a,a,b).
% 2.46/2.68
% 2.46/2.68 ------------> process sos:
% 2.46/2.68 ** KEPT (pick-wt=3): 40 [] A=A.
% 2.46/2.68 ** KEPT (pick-wt=5): 41 [] e_quidistant(A,B,B,A).
% 2.46/2.68 ** KEPT (pick-wt=8): 42 [] between(A,B,extension(A,B,C,D)).
% 2.46/2.68 ** KEPT (pick-wt=9): 43 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 2.46/2.68 Following clause subsumed by 40 during input processing: 0 [copy,40,flip.1] A=A.
% 2.46/2.68 41 back subsumes 37.
% 2.46/2.68
% 2.46/2.68 ======= end of input processing =======
% 2.46/2.68
% 2.46/2.68 =========== start of search ===========
% 2.46/2.68
% 2.46/2.68
% 2.46/2.68 Resetting weight limit to 9.
% 2.46/2.68
% 2.46/2.68
% 2.46/2.68 Resetting weight limit to 9.
% 2.46/2.68
% 2.46/2.68 sos_size=709
% 2.46/2.68
% 2.46/2.68 -------- PROOF --------
% 2.46/2.68
% 2.46/2.68 ----> UNIT CONFLICT at 0.54 sec ----> 827 [binary,826.1,18.1] $F.
% 2.46/2.68
% 2.46/2.68 Length of proof is 7. Level of proof is 5.
% 2.46/2.68
% 2.46/2.68 ---------------- PROOF ----------------
% 2.46/2.68 % SZS status Unsatisfiable
% 2.46/2.68 % SZS output start Refutation
% See solution above
% 2.46/2.68 ------------ end of proof -------------
% 2.46/2.68
% 2.46/2.68
% 2.46/2.68 Search stopped by max_proofs option.
% 2.46/2.68
% 2.46/2.68
% 2.46/2.68 Search stopped by max_proofs option.
% 2.46/2.68
% 2.46/2.68 ============ end of search ============
% 2.46/2.68
% 2.46/2.68 -------------- statistics -------------
% 2.46/2.68 clauses given 55
% 2.46/2.68 clauses generated 7291
% 2.46/2.68 clauses kept 824
% 2.46/2.68 clauses forward subsumed 2476
% 2.46/2.68 clauses back subsumed 63
% 2.46/2.68 Kbytes malloced 4882
% 2.46/2.68
% 2.46/2.68 ----------- times (seconds) -----------
% 2.46/2.68 user CPU time 0.54 (0 hr, 0 min, 0 sec)
% 2.46/2.68 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.46/2.68 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.46/2.68
% 2.46/2.68 That finishes the proof of the theorem.
% 2.46/2.68
% 2.46/2.68 Process 13496 finished Wed Jul 27 07:20:04 2022
% 2.46/2.68 Otter interrupted
% 2.46/2.68 PROOF FOUND
%------------------------------------------------------------------------------