%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KLE051+1 : TPTP v9.2.1. Released v4.0.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 : n012.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 04:35:36 PM UTC 2026
% Result : Theorem 0.12s 1.52s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 7 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 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4] : addition(X4,X4) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_2,negated_conjecture,
~ ! [X4] : addition(X4,X4) = X4,
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_3,negated_conjecture,
addition(esk1_0,esk1_0) != esk1_0,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X41] : addition(X41,X41) = X41,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_5,negated_conjecture,
addition(esk1_0,esk1_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : KLE051+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.06 % 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.07/0.24 % Computer : n012.cluster.edu
% 0.07/0.24 % Model : x86_64 x86_64
% 0.07/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.24 % Memory : 8042.1875MB
% 0.07/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25 % CPULimit : 300
% 0.07/0.25 % WCLimit : 300
% 0.07/0.25 % DateTime : Mon May 4 20:26:46 EDT 2026
% 0.07/0.25 % CPUTime :
% 0.07/0.25 % start to proof: theBenchmark
% 0.12/1.52 % Version : CSE_E---1.7
% 0.12/1.52 % Problem : theBenchmark.p
% 0.12/1.52 % SZS status Theorem for theBenchmark.p
% 0.12/1.52 % SZS output start CNFRefutation
% See solution above
% 0.12/1.52 % Total time : 1.261s
%------------------------------------------------------------------------------