TSTP Solution File: GEO001-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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 4.13s 4.35s
% Output : Refutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 9 unt; 0 nHn; 9 RR)
% Number of literals : 21 ( 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 : 5 ( 5 usr; 3 con; 0-5 aty)
% Number of variables : 31 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ e_quidistant(A,B,C,C)
| A = B ),
file('GEO001-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ between(A,B,A)
| A = B ),
file('GEO001-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ between(A,B,C)
| ~ between(D,E,C)
| between(B,inner_pasch(A,B,C,E,D),D) ),
file('GEO001-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ between(A,B,C)
| ~ between(D,E,C)
| between(E,inner_pasch(A,B,C,E,D),A) ),
file('GEO001-2.p',unknown),
[] ).
cnf(16,axiom,
~ between(c,b,a),
file('GEO001-2.p',unknown),
[] ).
cnf(37,axiom,
between(A,B,extension(A,B,C,D)),
file('GEO001-2.p',unknown),
[] ).
cnf(38,axiom,
e_quidistant(A,extension(B,A,C,D),C,D),
file('GEO001-2.p',unknown),
[] ).
cnf(39,axiom,
between(a,b,c),
file('GEO001-2.p',unknown),
[] ).
cnf(145,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(181,plain,
( A = B
| ~ between(B,A,B) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[145,4]),145,145]),
[iquote('para_into,144.1.1,4.2.1,demod,145,145')] ).
cnf(185,plain,
between(A,B,B),
inference(para_from,[status(thm),theory(equality)],[145,37]),
[iquote('para_from,144.1.1,37.1.3')] ).
cnf(226,plain,
between(b,inner_pasch(A,c,c,b,a),A),
inference(hyper,[status(thm)],[185,6,39]),
[iquote('hyper,185,6,39')] ).
cnf(1850,plain,
inner_pasch(b,c,c,b,a) = b,
inference(hyper,[status(thm)],[226,181]),
[iquote('hyper,226,181')] ).
cnf(1852,plain,
$false,
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1850,5]),185,39,16]),
[iquote('para_from,1850.1.1,5.3.2,unit_del,185,39,16')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:29:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.12 ----- Otter 3.3f, August 2004 -----
% 1.93/2.12 The process was started by sandbox2 on n025.cluster.edu,
% 1.93/2.12 Wed Jul 27 07:29:00 2022
% 1.93/2.12 The command was "./otter". The process ID is 12126.
% 1.93/2.12
% 1.93/2.12 set(prolog_style_variables).
% 1.93/2.12 set(auto).
% 1.93/2.12 dependent: set(auto1).
% 1.93/2.12 dependent: set(process_input).
% 1.93/2.12 dependent: clear(print_kept).
% 1.93/2.12 dependent: clear(print_new_demod).
% 1.93/2.12 dependent: clear(print_back_demod).
% 1.93/2.12 dependent: clear(print_back_sub).
% 1.93/2.12 dependent: set(control_memory).
% 1.93/2.12 dependent: assign(max_mem, 12000).
% 1.93/2.12 dependent: assign(pick_given_ratio, 4).
% 1.93/2.12 dependent: assign(stats_level, 1).
% 1.93/2.12 dependent: assign(max_seconds, 10800).
% 1.93/2.12 clear(print_given).
% 1.93/2.12
% 1.93/2.12 list(usable).
% 1.93/2.12 0 [] A=A.
% 1.93/2.12 0 [] e_quidistant(X,Y,Y,X).
% 1.93/2.12 0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.93/2.12 0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.93/2.12 0 [] between(X,Y,extension(X,Y,W,V)).
% 1.93/2.12 0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.93/2.12 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.12 0 [] -between(X,Y,X)|X=Y.
% 1.93/2.12 0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.93/2.12 0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.93/2.12 0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.93/2.12 0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.93/2.12 0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.93/2.12 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.12 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,V,euclid1(U,V,W,X,Y)).
% 1.93/2.12 0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,X,euclid2(U,V,W,X,Y)).
% 1.93/2.12 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.12 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.12 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.12 0 [] between(a,b,c).
% 1.93/2.12 0 [] -between(c,b,a).
% 1.93/2.12 end_of_list.
% 1.93/2.12
% 1.93/2.12 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.93/2.12
% 1.93/2.12 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.12 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.12 deletion, with positive clauses in sos and nonpositive
% 1.93/2.12 clauses in usable.
% 1.93/2.12
% 1.93/2.12 dependent: set(knuth_bendix).
% 1.93/2.12 dependent: set(anl_eq).
% 1.93/2.12 dependent: set(para_from).
% 1.93/2.12 dependent: set(para_into).
% 1.93/2.12 dependent: clear(para_from_right).
% 1.93/2.12 dependent: clear(para_into_right).
% 1.93/2.12 dependent: set(para_from_vars).
% 1.93/2.12 dependent: set(eq_units_both_ways).
% 1.93/2.12 dependent: set(dynamic_demod_all).
% 1.93/2.12 dependent: set(dynamic_demod).
% 1.93/2.12 dependent: set(order_eq).
% 1.93/2.12 dependent: set(back_demod).
% 1.93/2.12 dependent: set(lrpo).
% 1.93/2.12 dependent: set(hyper_res).
% 1.93/2.12 dependent: set(unit_deletion).
% 1.93/2.12 dependent: set(factor).
% 1.93/2.12
% 1.93/2.12 ------------> process usable:
% 1.93/2.12 ** 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.12 ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|A=B.
% 1.93/2.12 ** 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.93/2.12 ** KEPT (pick-wt=7): 4 [] -between(A,B,A)|A=B.
% 1.93/2.12 ** KEPT (pick-wt=17): 5 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 1.93/2.12 ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 1.93/2.12 ** KEPT (pick-wt=4): 7 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.93/2.12 ** KEPT (pick-wt=4): 8 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.93/2.12 ** KEPT (pick-wt=4): 9 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.93/2.12 ** 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.93/2.12 ** KEPT (pick-wt=20): 11 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,D,euclid1(A,D,B,E,C)).
% 4.13/4.35 ** KEPT (pick-wt=20): 12 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,E,euclid2(A,D,B,E,C)).
% 4.13/4.35 ** 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)).
% 4.13/4.35 ** 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).
% 4.13/4.35 ** 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)).
% 4.13/4.35 ** KEPT (pick-wt=4): 16 [] -between(c,b,a).
% 4.13/4.35
% 4.13/4.35 ------------> process sos:
% 4.13/4.35 ** KEPT (pick-wt=3): 35 [] A=A.
% 4.13/4.35 ** KEPT (pick-wt=5): 36 [] e_quidistant(A,B,B,A).
% 4.13/4.35 ** KEPT (pick-wt=8): 37 [] between(A,B,extension(A,B,C,D)).
% 4.13/4.35 ** KEPT (pick-wt=9): 38 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 4.13/4.35 ** KEPT (pick-wt=4): 39 [] between(a,b,c).
% 4.13/4.35 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] A=A.
% 4.13/4.35 36 back subsumes 32.
% 4.13/4.35
% 4.13/4.35 ======= end of input processing =======
% 4.13/4.35
% 4.13/4.35 =========== start of search ===========
% 4.13/4.35
% 4.13/4.35
% 4.13/4.35 Resetting weight limit to 10.
% 4.13/4.35
% 4.13/4.35
% 4.13/4.35 Resetting weight limit to 10.
% 4.13/4.35
% 4.13/4.35 sos_size=1646
% 4.13/4.35
% 4.13/4.35 -------- PROOF --------
% 4.13/4.35
% 4.13/4.35 -----> EMPTY CLAUSE at 2.23 sec ----> 1852 [para_from,1850.1.1,5.3.2,unit_del,185,39,16] $F.
% 4.13/4.35
% 4.13/4.35 Length of proof is 5. Level of proof is 4.
% 4.13/4.35
% 4.13/4.35 ---------------- PROOF ----------------
% 4.13/4.35 % SZS status Unsatisfiable
% 4.13/4.35 % SZS output start Refutation
% See solution above
% 4.13/4.35 ------------ end of proof -------------
% 4.13/4.35
% 4.13/4.35
% 4.13/4.35 Search stopped by max_proofs option.
% 4.13/4.35
% 4.13/4.35
% 4.13/4.35 Search stopped by max_proofs option.
% 4.13/4.35
% 4.13/4.35 ============ end of search ============
% 4.13/4.35
% 4.13/4.35 -------------- statistics -------------
% 4.13/4.35 clauses given 83
% 4.13/4.35 clauses generated 14507
% 4.13/4.35 clauses kept 1848
% 4.13/4.35 clauses forward subsumed 5711
% 4.13/4.35 clauses back subsumed 323
% 4.13/4.35 Kbytes malloced 4882
% 4.13/4.35
% 4.13/4.35 ----------- times (seconds) -----------
% 4.13/4.35 user CPU time 2.23 (0 hr, 0 min, 2 sec)
% 4.13/4.35 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 4.13/4.35 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 4.13/4.35
% 4.13/4.35 That finishes the proof of the theorem.
% 4.13/4.35
% 4.13/4.35 Process 12126 finished Wed Jul 27 07:29:04 2022
% 4.13/4.35 Otter interrupted
% 4.13/4.35 PROOF FOUND
%------------------------------------------------------------------------------