%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KLE061+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:37 PM UTC 2026
% Result : Theorem 1.35s 1.76s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(goals,conjecture,
! [X4] : multiplication(domain(X4),domain(X4)) = domain(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_8,plain,
! [X58,X59] : domain(multiplication(X58,X59)) = domain(multiplication(X58,domain(X59))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_9,plain,
! [X46] : multiplication(one,X46) = X46,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_10,plain,
! [X57] : addition(X57,multiplication(domain(X57),X57)) = multiplication(domain(X57),X57),
inference(variable_rename,[status(thm)],[domain1]) ).
cnf(c_0_11,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X47,X48,X49] : multiplication(X47,addition(X48,X49)) = addition(multiplication(X47,X48),multiplication(X47,X49)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_14,plain,
! [X45] : multiplication(X45,one) = X45,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_15,plain,
! [X35,X36] : addition(X35,X36) = addition(X36,X35),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_16,plain,
! [X60] : addition(domain(X60),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_17,negated_conjecture,
~ ! [X4] : multiplication(domain(X4),domain(X4)) = domain(X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_18,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,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_20,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,negated_conjecture,
multiplication(domain(esk1_0),domain(esk1_0)) != domain(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_25,plain,
addition(domain(X1),multiplication(domain(X1),domain(X1))) = multiplication(domain(X1),domain(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
multiplication(domain(esk1_0),domain(esk1_0)) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
multiplication(domain(X1),domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_22]),c_0_27]),c_0_21]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.16 % Problem : KLE061+1 : TPTP v9.2.1. Released v4.0.0.
% 0.09/0.16 % 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.17/0.36 % Computer : n007.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Mon May 4 20:28:09 EDT 2026
% 0.17/0.36 % CPUTime :
% 0.17/0.37 % start to proof: theBenchmark
% 1.35/1.76 % Version : CSE_E---1.7
% 1.35/1.76 % Problem : theBenchmark.p
% 1.35/1.76 % SZS status Theorem for theBenchmark.p
% 1.35/1.76 % SZS output start CNFRefutation
% See solution above
% 1.35/1.77 % Total time : 1.368s
%------------------------------------------------------------------------------