TSTP Solution File: GEO002-4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO002-4 : TPTP v8.1.0. Released v1.1.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:04 EDT 2022
% Result : Unsatisfiable 1.93s 2.11s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 12 unt; 0 nHn; 7 RR)
% Number of literals : 26 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-5 aty)
% Number of variables : 49 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ between(A,B,C)
| ~ between(B,D,C)
| between(A,B,D) ),
file('GEO002-4.p',unknown),
[] ).
cnf(2,axiom,
( ~ e_quidistant(A,B,C,C)
| e_qualish(A,B) ),
file('GEO002-4.p',unknown),
[] ).
cnf(3,axiom,
( ~ between(A,B,C)
| ~ between(D,C,E)
| between(A,outer_pasch(B,A,D,E,C),D) ),
file('GEO002-4.p',unknown),
[] ).
cnf(4,axiom,
( ~ between(A,B,C)
| ~ between(D,C,E)
| between(E,B,outer_pasch(B,A,D,E,C)) ),
file('GEO002-4.p',unknown),
[] ).
cnf(5,axiom,
( ~ e_qualish(A,B)
| ~ between(C,D,A)
| between(C,D,B) ),
file('GEO002-4.p',unknown),
[] ).
cnf(6,axiom,
~ between(a,a,b),
file('GEO002-4.p',unknown),
[] ).
cnf(7,axiom,
between(A,B,extension(A,B,C,D)),
file('GEO002-4.p',unknown),
[] ).
cnf(8,axiom,
e_quidistant(A,extension(B,A,C,D),C,D),
file('GEO002-4.p',unknown),
[] ).
cnf(11,plain,
between(A,A,A),
inference(hyper,[status(thm)],[7,1,7]),
[iquote('hyper,7,1,7')] ).
cnf(18,plain,
e_qualish(A,extension(B,A,C,C)),
inference(hyper,[status(thm)],[8,2]),
[iquote('hyper,8,2')] ).
cnf(19,plain,
between(A,A,extension(B,A,C,C)),
inference(hyper,[status(thm)],[18,5,11]),
[iquote('hyper,18,5,11')] ).
cnf(32,plain,
between(A,B,B),
inference(hyper,[status(thm)],[19,1,7]),
[iquote('hyper,19,1,7')] ).
cnf(45,plain,
between(A,A,outer_pasch(A,B,C,A,A)),
inference(hyper,[status(thm)],[32,4,32]),
[iquote('hyper,32,4,32')] ).
cnf(52,plain,
between(A,outer_pasch(B,A,C,B,B),C),
inference(hyper,[status(thm)],[32,3,32]),
[iquote('hyper,32,3,32')] ).
cnf(170,plain,
between(A,B,outer_pasch(C,B,B,C,C)),
inference(hyper,[status(thm)],[52,1,32]),
[iquote('hyper,52,1,32')] ).
cnf(209,plain,
between(A,A,B),
inference(hyper,[status(thm)],[170,1,45]),
[iquote('hyper,170,1,45')] ).
cnf(210,plain,
$false,
inference(binary,[status(thm)],[209,6]),
[iquote('binary,209.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO002-4 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.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:14:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.11 ----- Otter 3.3f, August 2004 -----
% 1.93/2.11 The process was started by sandbox2 on n006.cluster.edu,
% 1.93/2.11 Wed Jul 27 07:14:47 2022
% 1.93/2.11 The command was "./otter". The process ID is 10633.
% 1.93/2.11
% 1.93/2.11 set(prolog_style_variables).
% 1.93/2.11 set(auto).
% 1.93/2.11 dependent: set(auto1).
% 1.93/2.11 dependent: set(process_input).
% 1.93/2.11 dependent: clear(print_kept).
% 1.93/2.11 dependent: clear(print_new_demod).
% 1.93/2.11 dependent: clear(print_back_demod).
% 1.93/2.11 dependent: clear(print_back_sub).
% 1.93/2.11 dependent: set(control_memory).
% 1.93/2.11 dependent: assign(max_mem, 12000).
% 1.93/2.11 dependent: assign(pick_given_ratio, 4).
% 1.93/2.11 dependent: assign(stats_level, 1).
% 1.93/2.11 dependent: assign(max_seconds, 10800).
% 1.93/2.11 clear(print_given).
% 1.93/2.11
% 1.93/2.11 list(usable).
% 1.93/2.11 0 [] -between(X,Y,V)| -between(Y,Z,V)|between(X,Y,Z).
% 1.93/2.11 0 [] -e_quidistant(X,Y,Z,Z)|e_qualish(X,Y).
% 1.93/2.11 0 [] -between(X,W,V)| -between(Y,V,Z)|between(X,outer_pasch(W,X,Y,Z,V),Y).
% 1.93/2.11 0 [] -between(X,W,V)| -between(Y,V,Z)|between(Z,W,outer_pasch(W,X,Y,Z,V)).
% 1.93/2.11 0 [] between(X,Y,extension(X,Y,W,V)).
% 1.93/2.11 0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.93/2.11 0 [] -e_qualish(X,Y)| -between(W,Z,X)|between(W,Z,Y).
% 1.93/2.11 0 [] -between(a,a,b).
% 1.93/2.11 end_of_list.
% 1.93/2.11
% 1.93/2.11 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.93/2.11
% 1.93/2.11 This is a Horn set without equality. The strategy will
% 1.93/2.11 be hyperresolution, with satellites in sos and nuclei
% 1.93/2.11 in usable.
% 1.93/2.11
% 1.93/2.11 dependent: set(hyper_res).
% 1.93/2.11 dependent: clear(order_hyper).
% 1.93/2.11
% 1.93/2.11 ------------> process usable:
% 1.93/2.11 ** KEPT (pick-wt=12): 1 [] -between(A,B,C)| -between(B,D,C)|between(A,B,D).
% 1.93/2.11 ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|e_qualish(A,B).
% 1.93/2.11 ** KEPT (pick-wt=17): 3 [] -between(A,B,C)| -between(D,C,E)|between(A,outer_pasch(B,A,D,E,C),D).
% 1.93/2.11 ** KEPT (pick-wt=17): 4 [] -between(A,B,C)| -between(D,C,E)|between(E,B,outer_pasch(B,A,D,E,C)).
% 1.93/2.11 ** KEPT (pick-wt=11): 5 [] -e_qualish(A,B)| -between(C,D,A)|between(C,D,B).
% 1.93/2.11 ** KEPT (pick-wt=4): 6 [] -between(a,a,b).
% 1.93/2.11
% 1.93/2.11 ------------> process sos:
% 1.93/2.11 ** KEPT (pick-wt=8): 7 [] between(A,B,extension(A,B,C,D)).
% 1.93/2.11 ** KEPT (pick-wt=9): 8 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 1.93/2.11
% 1.93/2.11 ======= end of input processing =======
% 1.93/2.11
% 1.93/2.11 =========== start of search ===========
% 1.93/2.11
% 1.93/2.11 -------- PROOF --------
% 1.93/2.11
% 1.93/2.11 ----> UNIT CONFLICT at 0.01 sec ----> 210 [binary,209.1,6.1] $F.
% 1.93/2.11
% 1.93/2.11 Length of proof is 8. Level of proof is 6.
% 1.93/2.11
% 1.93/2.11 ---------------- PROOF ----------------
% 1.93/2.11 % SZS status Unsatisfiable
% 1.93/2.11 % SZS output start Refutation
% See solution above
% 1.93/2.11 ------------ end of proof -------------
% 1.93/2.11
% 1.93/2.11
% 1.93/2.11 Search stopped by max_proofs option.
% 1.93/2.11
% 1.93/2.11
% 1.93/2.11 Search stopped by max_proofs option.
% 1.93/2.11
% 1.93/2.11 ============ end of search ============
% 1.93/2.11
% 1.93/2.11 -------------- statistics -------------
% 1.93/2.11 clauses given 13
% 1.93/2.11 clauses generated 259
% 1.93/2.11 clauses kept 209
% 1.93/2.11 clauses forward subsumed 58
% 1.93/2.11 clauses back subsumed 27
% 1.93/2.11 Kbytes malloced 2929
% 1.93/2.11
% 1.93/2.11 ----------- times (seconds) -----------
% 1.93/2.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.93/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.11 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.93/2.11
% 1.93/2.11 That finishes the proof of the theorem.
% 1.93/2.11
% 1.93/2.11 Process 10633 finished Wed Jul 27 07:14:48 2022
% 1.93/2.11 Otter interrupted
% 1.93/2.11 PROOF FOUND
%------------------------------------------------------------------------------