%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KLE067+1 : 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 : n007.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:38 PM UTC 2026
% Result : Theorem 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] : domain(addition(domain(X4),domain(X5))) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(c_0_4,negated_conjecture,
~ ! [X4,X5] : domain(addition(domain(X4),domain(X5))) = addition(domain(X4),domain(X5)),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_5,negated_conjecture,
domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X62,X63] : domain(addition(X62,X63)) = addition(domain(X62),domain(X63)),
inference(variable_rename,[status(thm)],[domain5]) ).
fof(c_0_7,plain,
! [X59,X60] : domain(multiplication(X59,X60)) = domain(multiplication(X59,domain(X60))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_8,plain,
! [X47] : multiplication(one,X47) = X47,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_9,negated_conjecture,
domain(addition(domain(esk1_0),domain(esk2_0))) != addition(domain(esk1_0),domain(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
domain(domain(addition(esk1_0,esk2_0))) != domain(addition(esk1_0,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE067+1 : 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.16/0.33 % Computer : n007.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 : Mon May 4 20:27:54 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Theorem for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.370s
%------------------------------------------------------------------------------