%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KLE025+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 : n021.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:31 PM UTC 2026
% Result : Theorem 1.63s 1.86s
% Output : CNFRefutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 23 unt; 0 def)
% Number of atoms : 67 ( 42 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 52 ( 19 ~; 15 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(multiplication(X5,X4),c(X6)) = zero
=> multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
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(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(multiplication(X5,X4),c(X6)) = zero
=> multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero
& multiplication(esk3_0,esk2_0) != multiplication(multiplication(esk3_0,esk2_0),esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X46,X47,X48] : multiplication(X46,multiplication(X47,X48)) = multiplication(multiplication(X46,X47),X48),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_11,plain,
! [X51,X52,X53] : multiplication(X51,addition(X52,X53)) = addition(multiplication(X51,X52),multiplication(X51,X53)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_12,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X44] : addition(X44,zero) = X44,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_15,plain,
! [X67,X68] :
( ( c(X67) != X68
| complement(X67,X68)
| ~ test(X67) )
& ( ~ complement(X67,X68)
| c(X67) = X68
| ~ test(X67) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
cnf(c_0_16,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X65,X66] :
( ( multiplication(X65,X66) = zero
| ~ complement(X66,X65) )
& ( multiplication(X66,X65) = zero
| ~ complement(X66,X65) )
& ( addition(X65,X66) = one
| ~ complement(X66,X65) )
& ( multiplication(X65,X66) != zero
| multiplication(X66,X65) != zero
| addition(X65,X66) != one
| complement(X66,X65) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_20,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X39,X40] : addition(X39,X40) = addition(X40,X39),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_22,negated_conjecture,
multiplication(esk3_0,addition(X1,multiplication(esk2_0,c(esk4_0)))) = multiplication(esk3_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
! [X49] : multiplication(X49,one) = X49,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_27,negated_conjecture,
multiplication(esk3_0,esk2_0) != multiplication(multiplication(esk3_0,esk2_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,addition(X1,c(esk4_0)))) = multiplication(esk3_0,multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_29,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,esk4_0)) != multiplication(esk3_0,esk2_0),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE025+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % 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.14/0.32 % Computer : n021.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 20:27:40 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.63/1.86 % Version : CSE_E---1.7
% 1.63/1.86 % Problem : theBenchmark.p
% 1.63/1.86 % SZS status Theorem for theBenchmark.p
% 1.63/1.86 % SZS output start CNFRefutation
% See solution above
% 1.63/1.86 % Total time : 1.370s
%------------------------------------------------------------------------------