TSTP Solution File: SYO691-1.000 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYO691-1.000 : TPTP v8.1.0. Released v7.3.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 13:26:34 EDT 2022
% Result : Unsatisfiable 1.97s 2.15s
% Output : Refutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 10 unt; 0 nHn; 4 RR)
% Number of literals : 19 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ se_q(succ(succ(succ(zero))),A,A),
file('SYO691-1.000.p',unknown),
[] ).
cnf(2,axiom,
( ~ top(A,B)
| step(A,B) ),
file('SYO691-1.000.p',unknown),
[] ).
cnf(3,axiom,
( ~ step(A,B)
| step(f(A,C),f(B,C)) ),
file('SYO691-1.000.p',unknown),
[] ).
cnf(4,axiom,
( ~ step(A,B)
| step(f(C,A),f(C,B)) ),
file('SYO691-1.000.p',unknown),
[] ).
cnf(5,axiom,
( ~ se_q(A,B,C)
| ~ step(C,D)
| se_q(succ(A),B,D) ),
file('SYO691-1.000.p',unknown),
[] ).
cnf(6,axiom,
top(f(f(A,B),f(C,a)),f(f(C,f(B,a)),A)),
file('SYO691-1.000.p',unknown),
[] ).
cnf(7,axiom,
se_q(zero,A,A),
file('SYO691-1.000.p',unknown),
[] ).
cnf(8,plain,
step(f(f(A,B),f(C,a)),f(f(C,f(B,a)),A)),
inference(hyper,[status(thm)],[6,2]),
[iquote('hyper,6,2')] ).
cnf(9,plain,
se_q(succ(zero),f(f(A,B),f(C,a)),f(f(C,f(B,a)),A)),
inference(hyper,[status(thm)],[8,5,7]),
[iquote('hyper,8,5,7')] ).
cnf(10,plain,
step(f(A,f(f(B,C),f(D,a))),f(A,f(f(D,f(C,a)),B))),
inference(hyper,[status(thm)],[8,4]),
[iquote('hyper,8,4')] ).
cnf(11,plain,
step(f(f(f(A,B),f(C,a)),D),f(f(f(C,f(B,a)),A),D)),
inference(hyper,[status(thm)],[8,3]),
[iquote('hyper,8,3')] ).
cnf(17,plain,
se_q(succ(succ(zero)),f(f(A,B),f(f(C,D),a)),f(f(f(B,f(D,a)),C),A)),
inference(hyper,[status(thm)],[11,5,9]),
[iquote('hyper,11,5,9')] ).
cnf(30,plain,
se_q(succ(succ(succ(zero))),f(f(f(f(A,B),f(C,a)),D),f(f(E,F),a)),f(f(f(D,f(F,a)),E),f(f(C,f(B,a)),A))),
inference(hyper,[status(thm)],[17,5,10]),
[iquote('hyper,17,5,10')] ).
cnf(31,plain,
$false,
inference(binary,[status(thm)],[30,1]),
[iquote('binary,30.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO691-1.000 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 10:22:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.97/2.15 ----- Otter 3.3f, August 2004 -----
% 1.97/2.15 The process was started by sandbox on n026.cluster.edu,
% 1.97/2.15 Wed Jul 27 10:22:09 2022
% 1.97/2.15 The command was "./otter". The process ID is 26738.
% 1.97/2.15
% 1.97/2.15 set(prolog_style_variables).
% 1.97/2.15 set(auto).
% 1.97/2.15 dependent: set(auto1).
% 1.97/2.15 dependent: set(process_input).
% 1.97/2.15 dependent: clear(print_kept).
% 1.97/2.15 dependent: clear(print_new_demod).
% 1.97/2.15 dependent: clear(print_back_demod).
% 1.97/2.15 dependent: clear(print_back_sub).
% 1.97/2.15 dependent: set(control_memory).
% 1.97/2.15 dependent: assign(max_mem, 12000).
% 1.97/2.15 dependent: assign(pick_given_ratio, 4).
% 1.97/2.15 dependent: assign(stats_level, 1).
% 1.97/2.15 dependent: assign(max_seconds, 10800).
% 1.97/2.15 clear(print_given).
% 1.97/2.15
% 1.97/2.15 list(usable).
% 1.97/2.15 0 [] top(f(f(Z,Y),f(X,a)),f(f(X,f(Y,a)),Z)).
% 1.97/2.15 0 [] -se_q(succ(succ(succ(zero))),X,X).
% 1.97/2.15 0 [] -top(X,Y)|step(X,Y).
% 1.97/2.15 0 [] -step(X,Y)|step(f(X,Z),f(Y,Z)).
% 1.97/2.15 0 [] -step(Y,Z)|step(f(X,Y),f(X,Z)).
% 1.97/2.15 0 [] se_q(zero,X,X).
% 1.97/2.15 0 [] -se_q(N,X,Y)| -step(Y,Z)|se_q(succ(N),X,Z).
% 1.97/2.15 end_of_list.
% 1.97/2.15
% 1.97/2.15 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.97/2.15
% 1.97/2.15 This is a Horn set without equality. The strategy will
% 1.97/2.15 be hyperresolution, with satellites in sos and nuclei
% 1.97/2.15 in usable.
% 1.97/2.15
% 1.97/2.15 dependent: set(hyper_res).
% 1.97/2.15 dependent: clear(order_hyper).
% 1.97/2.15
% 1.97/2.15 ------------> process usable:
% 1.97/2.15 ** KEPT (pick-wt=7): 1 [] -se_q(succ(succ(succ(zero))),A,A).
% 1.97/2.15 ** KEPT (pick-wt=6): 2 [] -top(A,B)|step(A,B).
% 1.97/2.15 ** KEPT (pick-wt=10): 3 [] -step(A,B)|step(f(A,C),f(B,C)).
% 1.97/2.15 ** KEPT (pick-wt=10): 4 [] -step(A,B)|step(f(C,A),f(C,B)).
% 1.97/2.15 ** KEPT (pick-wt=12): 5 [] -se_q(A,B,C)| -step(C,D)|se_q(succ(A),B,D).
% 1.97/2.15
% 1.97/2.15 ------------> process sos:
% 1.97/2.15 ** KEPT (pick-wt=15): 6 [] top(f(f(A,B),f(C,a)),f(f(C,f(B,a)),A)).
% 1.97/2.15 ** KEPT (pick-wt=4): 7 [] se_q(zero,A,A).
% 1.97/2.15
% 1.97/2.15 ======= end of input processing =======
% 1.97/2.15
% 1.97/2.15 =========== start of search ===========
% 1.97/2.15
% 1.97/2.15 -------- PROOF --------
% 1.97/2.15
% 1.97/2.15 ----> UNIT CONFLICT at 0.00 sec ----> 31 [binary,30.1,1.1] $F.
% 1.97/2.15
% 1.97/2.15 Length of proof is 6. Level of proof is 4.
% 1.97/2.15
% 1.97/2.15 ---------------- PROOF ----------------
% 1.97/2.15 % SZS status Unsatisfiable
% 1.97/2.15 % SZS output start Refutation
% See solution above
% 1.97/2.15 ------------ end of proof -------------
% 1.97/2.15
% 1.97/2.15
% 1.97/2.15 Search stopped by max_proofs option.
% 1.97/2.15
% 1.97/2.15
% 1.97/2.15 Search stopped by max_proofs option.
% 1.97/2.15
% 1.97/2.15 ============ end of search ============
% 1.97/2.15
% 1.97/2.15 -------------- statistics -------------
% 1.97/2.15 clauses given 10
% 1.97/2.15 clauses generated 24
% 1.97/2.15 clauses kept 30
% 1.97/2.15 clauses forward subsumed 1
% 1.97/2.15 clauses back subsumed 0
% 1.97/2.15 Kbytes malloced 976
% 1.97/2.15
% 1.97/2.15 ----------- times (seconds) -----------
% 1.97/2.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.97/2.15
% 1.97/2.15 That finishes the proof of the theorem.
% 1.97/2.15
% 1.97/2.15 Process 26738 finished Wed Jul 27 10:22:11 2022
% 1.97/2.15 Otter interrupted
% 1.97/2.15 PROOF FOUND
%------------------------------------------------------------------------------