%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KLE038+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 : n009.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:34 PM UTC 2026
% Result : Theorem 1.38s 1.75s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 40 unt; 0 def)
% Number of atoms : 50 ( 37 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 4 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(goals,conjecture,
! [X4] : leq(X4,star(X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(c_0_10,plain,
! [X36,X37] : addition(X36,X37) = addition(X37,X36),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_11,plain,
! [X38,X39,X40] : addition(X40,addition(X39,X38)) = addition(addition(X40,X39),X38),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_12,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X42] : addition(X42,X42) = X42,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_15,plain,
! [X56,X57] :
( ( ~ leq(X56,X57)
| addition(X56,X57) = X57 )
& ( addition(X56,X57) != X57
| leq(X56,X57) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_16,plain,
! [X58] : leq(addition(one,multiplication(X58,star(X58))),star(X58)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
cnf(c_0_17,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X51,X52,X53] : multiplication(addition(X51,X52),X53) = addition(multiplication(X51,X53),multiplication(X52,X53)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_22,plain,
! [X47] : multiplication(one,X47) = X47,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_23,negated_conjecture,
~ ! [X4] : leq(X4,star(X4)),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_24,plain,
! [X48,X49,X50] : multiplication(X48,addition(X49,X50)) = addition(multiplication(X48,X49),multiplication(X48,X50)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_25,plain,
! [X46] : multiplication(X46,one) = X46,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_26,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13]),c_0_12]) ).
cnf(c_0_28,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_29,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_31,negated_conjecture,
~ leq(esk1_0,star(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_32,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13]),c_0_12]),c_0_28]) ).
cnf(c_0_35,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_12]) ).
cnf(c_0_36,negated_conjecture,
~ leq(esk1_0,star(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_38,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_12]) ).
cnf(c_0_39,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_41,negated_conjecture,
addition(esk1_0,star(esk1_0)) != star(esk1_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_13]),c_0_40]),c_0_12]),c_0_40]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE038+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % 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.14/0.32 % Computer : n009.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:25:56 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.38/1.75 % Version : CSE_E---1.7
% 1.38/1.75 % Problem : theBenchmark.p
% 1.38/1.75 % SZS status Theorem for theBenchmark.p
% 1.38/1.75 % SZS output start CNFRefutation
% See solution above
% 1.38/1.75 % Total time : 1.371s
%------------------------------------------------------------------------------