%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYO691-1.000 : TPTP v9.2.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n018.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 : Tue May 5 05:54:40 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.73s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 9 unt; 0 nHn; 15 RR)
% Number of literals : 47 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rewrite_sequence_succ,axiom,
( seq(succ(X1),X2,X4)
| ~ seq(X1,X2,X3)
| ~ step(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_sequence_succ) ).
cnf(rewrite_sequence_zero,axiom,
seq(zero,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_sequence_zero) ).
cnf(rewrite_right,axiom,
( step(f(X3,X1),f(X3,X2))
| ~ step(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_right) ).
cnf(rewrite_left,axiom,
( step(f(X1,X3),f(X2,X3))
| ~ step(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_left) ).
cnf(rewrite_top,axiom,
( step(X1,X2)
| ~ top(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_top) ).
cnf(rule_1,axiom,
top(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
cnf(prove,negated_conjecture,
~ seq(succ(succ(succ(zero))),X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
cnf(c_0_7,axiom,
( seq(succ(X1),X2,X4)
| ~ seq(X1,X2,X3)
| ~ step(X3,X4) ),
rewrite_sequence_succ ).
cnf(c_0_8,axiom,
seq(zero,X1,X1),
rewrite_sequence_zero ).
cnf(c_0_9,plain,
( seq(succ(zero),X1,X2)
| ~ step(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
( seq(succ(succ(zero)),X1,X2)
| ~ step(X3,X2)
| ~ step(X1,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_11,axiom,
( step(f(X3,X1),f(X3,X2))
| ~ step(X1,X2) ),
rewrite_right ).
cnf(c_0_12,plain,
( seq(succ(succ(zero)),X1,f(X2,X3))
| ~ step(X1,f(X2,X4))
| ~ step(X4,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( step(f(X1,X3),f(X2,X3))
| ~ step(X1,X2) ),
rewrite_left ).
cnf(c_0_14,plain,
( seq(succ(succ(zero)),f(X1,X2),f(X3,X4))
| ~ step(X2,X4)
| ~ step(X1,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
( step(X1,X2)
| ~ top(X1,X2) ),
rewrite_top ).
cnf(c_0_16,axiom,
top(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
rule_1 ).
cnf(c_0_17,plain,
( seq(succ(succ(succ(zero))),f(X1,X2),X3)
| ~ step(f(X4,X5),X3)
| ~ step(X2,X5)
| ~ step(X1,X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_18,plain,
step(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ seq(succ(succ(succ(zero))),X1,X1),
prove ).
cnf(c_0_20,plain,
( seq(succ(succ(succ(zero))),f(X1,X2),f(f(X3,f(X4,a)),X5))
| ~ step(X2,f(X3,a))
| ~ step(X1,f(X5,X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ step(f(X1,f(X2,a)),f(X3,X2))
| ~ step(X3,f(X1,a)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
~ step(f(X1,f(X2,a)),f(f(X1,X2),a)),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_22,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO691-1.000 : TPTP v9.2.1. Released v7.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n018.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 09:21:02 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.25/1.73 % Version : CSE_E---1.7
% 1.25/1.73 % Problem : theBenchmark.p
% 1.25/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.73 % SZS output start CNFRefutation
% See solution above
% 1.25/1.73 % Total time : 1.379s
%------------------------------------------------------------------------------