TSTP Solution File: GEO067-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO067-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:18 EDT 2022
% Result : Unsatisfiable 1.80s 2.06s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 9 RR)
% Number of literals : 30 ( 5 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 35 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ e_quidistant(A,B,C,C)
| A = B ),
file('GEO067-2.p',unknown),
[] ).
cnf(16,axiom,
( ~ between(A,B,C)
| colinear(A,B,C) ),
file('GEO067-2.p',unknown),
[] ).
cnf(17,axiom,
( ~ between(A,B,C)
| colinear(C,A,B) ),
file('GEO067-2.p',unknown),
[] ).
cnf(18,axiom,
( ~ between(A,B,C)
| colinear(B,C,A) ),
file('GEO067-2.p',unknown),
[] ).
cnf(20,axiom,
( ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x)
| x = y ),
file('GEO067-2.p',unknown),
[] ).
cnf(21,plain,
( ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x)
| y = x ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[20])]),
[iquote('copy,20,flip.4')] ).
cnf(22,axiom,
( ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x)
| ~ colinear(x,z,y) ),
file('GEO067-2.p',unknown),
[] ).
cnf(44,axiom,
between(A,B,extension(A,B,C,D)),
file('GEO067-2.p',unknown),
[] ).
cnf(45,axiom,
e_quidistant(A,extension(B,A,C,D),C,D),
file('GEO067-2.p',unknown),
[] ).
cnf(53,plain,
colinear(A,extension(B,A,C,D),B),
inference(hyper,[status(thm)],[44,18]),
[iquote('hyper,44,18')] ).
cnf(99,plain,
extension(A,B,C,C) = B,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[45,2])]),
[iquote('hyper,45,2,flip.1')] ).
cnf(139,plain,
colinear(A,A,B),
inference(para_from,[status(thm),theory(equality)],[99,53]),
[iquote('para_from,99.1.1,53.1.2')] ).
cnf(141,plain,
between(A,B,B),
inference(para_from,[status(thm),theory(equality)],[99,44]),
[iquote('para_from,99.1.1,44.1.3')] ).
cnf(152,plain,
colinear(A,B,A),
inference(hyper,[status(thm)],[141,17]),
[iquote('hyper,141,17')] ).
cnf(153,plain,
colinear(A,B,B),
inference(hyper,[status(thm)],[141,16]),
[iquote('hyper,141,16')] ).
cnf(242,plain,
y = x,
inference(hyper,[status(thm)],[153,21,139,152]),
[iquote('hyper,153,21,139,152')] ).
cnf(243,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[22]),242,242,242,242]),139,139,139,152]),
[iquote('back_demod,22,demod,242,242,242,242,unit_del,139,139,139,152')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO067-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n009.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:21:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.80/2.02 ----- Otter 3.3f, August 2004 -----
% 1.80/2.02 The process was started by sandbox on n009.cluster.edu,
% 1.80/2.02 Wed Jul 27 07:21:51 2022
% 1.80/2.02 The command was "./otter". The process ID is 25949.
% 1.80/2.02
% 1.80/2.02 set(prolog_style_variables).
% 1.80/2.02 set(auto).
% 1.80/2.02 dependent: set(auto1).
% 1.80/2.02 dependent: set(process_input).
% 1.80/2.02 dependent: clear(print_kept).
% 1.80/2.02 dependent: clear(print_new_demod).
% 1.80/2.02 dependent: clear(print_back_demod).
% 1.80/2.02 dependent: clear(print_back_sub).
% 1.80/2.02 dependent: set(control_memory).
% 1.80/2.02 dependent: assign(max_mem, 12000).
% 1.80/2.02 dependent: assign(pick_given_ratio, 4).
% 1.80/2.02 dependent: assign(stats_level, 1).
% 1.80/2.02 dependent: assign(max_seconds, 10800).
% 1.80/2.02 clear(print_given).
% 1.80/2.02
% 1.80/2.02 list(usable).
% 1.80/2.02 0 [] A=A.
% 1.80/2.02 0 [] e_quidistant(X,Y,Y,X).
% 1.80/2.02 0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.80/2.02 0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.80/2.02 0 [] between(X,Y,extension(X,Y,W,V)).
% 1.80/2.02 0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.80/2.02 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.80/2.02 0 [] -between(X,Y,X)|X=Y.
% 1.80/2.02 0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.80/2.02 0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.80/2.02 0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.80/2.02 0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.80/2.02 0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.80/2.02 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.80/2.02 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,V,euclid1(U,V,W,X,Y)).
% 1.80/2.02 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,X,euclid2(U,V,W,X,Y)).
% 1.80/2.02 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.80/2.02 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.80/2.02 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.80/2.02 0 [] -between(X,Y,Z)|colinear(X,Y,Z).
% 1.80/2.02 0 [] -between(Y,Z,X)|colinear(X,Y,Z).
% 1.80/2.02 0 [] -between(Z,X,Y)|colinear(X,Y,Z).
% 1.80/2.02 0 [] -colinear(X,Y,Z)|between(X,Y,Z)|between(Y,Z,X)|between(Z,X,Y).
% 1.80/2.02 0 [] -colinear(x,x,y)| -colinear(x,y,x)| -colinear(y,x,x)|x=y.
% 1.80/2.02 0 [] -colinear(x,x,y)| -colinear(x,y,x)| -colinear(y,x,x)| -colinear(x,z,y).
% 1.80/2.02 end_of_list.
% 1.80/2.02
% 1.80/2.02 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.80/2.02
% 1.80/2.02 This ia a non-Horn set with equality. The strategy will be
% 1.80/2.02 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.80/2.02 deletion, with positive clauses in sos and nonpositive
% 1.80/2.02 clauses in usable.
% 1.80/2.02
% 1.80/2.02 dependent: set(knuth_bendix).
% 1.80/2.02 dependent: set(anl_eq).
% 1.80/2.02 dependent: set(para_from).
% 1.80/2.02 dependent: set(para_into).
% 1.80/2.02 dependent: clear(para_from_right).
% 1.80/2.02 dependent: clear(para_into_right).
% 1.80/2.02 dependent: set(para_from_vars).
% 1.80/2.02 dependent: set(eq_units_both_ways).
% 1.80/2.02 dependent: set(dynamic_demod_all).
% 1.80/2.02 dependent: set(dynamic_demod).
% 1.80/2.02 dependent: set(order_eq).
% 1.80/2.02 dependent: set(back_demod).
% 1.80/2.02 dependent: set(lrpo).
% 1.80/2.02 dependent: set(hyper_res).
% 1.80/2.02 dependent: set(unit_deletion).
% 1.80/2.02 dependent: set(factor).
% 1.80/2.02
% 1.80/2.02 ------------> process usable:
% 1.80/2.02 ** KEPT (pick-wt=15): 1 [] -e_quidistant(A,B,C,D)| -e_quidistant(A,B,E,F)|e_quidistant(C,D,E,F).
% 1.80/2.02 ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|A=B.
% 1.80/2.02 ** 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.80/2.02 ** KEPT (pick-wt=7): 4 [] -between(A,B,A)|A=B.
% 1.80/2.02 ** KEPT (pick-wt=17): 5 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 1.80/2.02 ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 1.80/2.02 ** KEPT (pick-wt=4): 7 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.80/2.02 ** KEPT (pick-wt=4): 8 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.80/2.02 ** KEPT (pick-wt=4): 9 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.80/2.06 ** 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.80/2.06 ** KEPT (pick-wt=20): 11 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,D,euclid1(A,D,B,E,C)).
% 1.80/2.06 ** KEPT (pick-wt=20): 12 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,E,euclid2(A,D,B,E,C)).
% 1.80/2.06 ** 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)).
% 1.80/2.06 ** 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).
% 1.80/2.06 ** 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)).
% 1.80/2.06 ** KEPT (pick-wt=8): 16 [] -between(A,B,C)|colinear(A,B,C).
% 1.80/2.06 ** KEPT (pick-wt=8): 17 [] -between(A,B,C)|colinear(C,A,B).
% 1.80/2.06 ** KEPT (pick-wt=8): 18 [] -between(A,B,C)|colinear(B,C,A).
% 1.80/2.06 ** KEPT (pick-wt=16): 19 [] -colinear(A,B,C)|between(A,B,C)|between(B,C,A)|between(C,A,B).
% 1.80/2.06 ** KEPT (pick-wt=15): 21 [copy,20,flip.4] -colinear(x,x,y)| -colinear(x,y,x)| -colinear(y,x,x)|y=x.
% 1.80/2.06 ** KEPT (pick-wt=16): 22 [] -colinear(x,x,y)| -colinear(x,y,x)| -colinear(y,x,x)| -colinear(x,z,y).
% 1.80/2.06
% 1.80/2.06 ------------> process sos:
% 1.80/2.06 ** KEPT (pick-wt=3): 42 [] A=A.
% 1.80/2.06 ** KEPT (pick-wt=5): 43 [] e_quidistant(A,B,B,A).
% 1.80/2.06 ** KEPT (pick-wt=8): 44 [] between(A,B,extension(A,B,C,D)).
% 1.80/2.06 ** KEPT (pick-wt=9): 45 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 1.80/2.06 Following clause subsumed by 42 during input processing: 0 [copy,42,flip.1] A=A.
% 1.80/2.06 43 back subsumes 39.
% 1.80/2.06
% 1.80/2.06 ======= end of input processing =======
% 1.80/2.06
% 1.80/2.06 =========== start of search ===========
% 1.80/2.06
% 1.80/2.06 -------- PROOF --------
% 1.80/2.06
% 1.80/2.06 -----> EMPTY CLAUSE at 0.04 sec ----> 243 [back_demod,22,demod,242,242,242,242,unit_del,139,139,139,152] $F.
% 1.80/2.06
% 1.80/2.06 Length of proof is 8. Level of proof is 4.
% 1.80/2.06
% 1.80/2.06 ---------------- PROOF ----------------
% 1.80/2.06 % SZS status Unsatisfiable
% 1.80/2.06 % SZS output start Refutation
% See solution above
% 1.80/2.06 ------------ end of proof -------------
% 1.80/2.06
% 1.80/2.06
% 1.80/2.06 Search stopped by max_proofs option.
% 1.80/2.06
% 1.80/2.06
% 1.80/2.06 Search stopped by max_proofs option.
% 1.80/2.06
% 1.80/2.06 ============ end of search ============
% 1.80/2.06
% 1.80/2.06 -------------- statistics -------------
% 1.80/2.06 clauses given 12
% 1.80/2.06 clauses generated 810
% 1.80/2.06 clauses kept 239
% 1.80/2.06 clauses forward subsumed 560
% 1.80/2.06 clauses back subsumed 38
% 1.80/2.06 Kbytes malloced 2929
% 1.80/2.06
% 1.80/2.06 ----------- times (seconds) -----------
% 1.80/2.06 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 1.80/2.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.80/2.06 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.80/2.06
% 1.80/2.06 That finishes the proof of the theorem.
% 1.80/2.06
% 1.80/2.06 Process 25949 finished Wed Jul 27 07:21:53 2022
% 1.80/2.06 Otter interrupted
% 1.80/2.06 PROOF FOUND
%------------------------------------------------------------------------------