%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN986+1.000 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n020.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:51:12 PM UTC 2026
% Result : Theorem 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 7 ( 1 sgn 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ck,conjecture,
? [X5] : r(zero,zero,X5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ck) ).
fof(hyp1,axiom,
! [X1] : r(X1,zero,succ(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN002+0.ax',hyp1) ).
fof(c_0_2,negated_conjecture,
~ ? [X5] : r(zero,zero,X5),
inference(assume_negation,[status(cth)],[ck]) ).
fof(c_0_3,negated_conjecture,
! [X17] : ~ r(zero,zero,X17),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_4,plain,
! [X12] : r(X12,zero,succ(X12)),
inference(variable_rename,[status(thm)],[hyp1]) ).
cnf(c_0_5,negated_conjecture,
~ r(zero,zero,X1),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
r(X1,zero,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN986+1.000 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.34 % Computer : n020.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue May 5 08:52:05 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 0.25/1.62 % Version : CSE_E---1.7
% 0.25/1.62 % Problem : theBenchmark.p
% 0.25/1.62 % SZS status Theorem for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.62 % Total time : 1.272s
%------------------------------------------------------------------------------