%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : KLE007+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:43:23 AM UTC 2026
% Result : Theorem 31.17s 4.43s
% Output : CNFRefutation 31.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 32 unt; 0 def)
% Number of atoms : 85 ( 55 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 30 ~; 24 |; 4 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 3 sgn 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0) ).
fof(additive_identity,axiom,
! [X0] : addition(X0,zero) = X0 ).
fof(multiplicative_associativity,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2) ).
fof(multiplicative_right_identity,axiom,
! [X0] : multiplication(X0,one) = X0 ).
fof(right_distributivity,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)) ).
fof(right_annihilation,axiom,
! [X0] : multiplication(X0,zero) = zero ).
fof(left_annihilation,axiom,
! [X0] : multiplication(zero,X0) = zero ).
fof(test_1,axiom,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ) ).
fof(test_2,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) ) ).
fof(test_3,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ) ).
fof(goals,conjecture,
! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
inference(negate_conjecture,[status(cth)],[goals]) ).
cnf(c0,plain,
addition(X0,X1) = addition(X1,X0),
inference(clausification,[status(esa)],[additive_commutativity]) ).
cnf(c2,plain,
addition(X0,zero) = X0,
inference(clausification,[status(esa)],[additive_identity]) ).
cnf(c4,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(clausification,[status(esa)],[multiplicative_associativity]) ).
cnf(c5,plain,
multiplication(X0,one) = X0,
inference(clausification,[status(esa)],[multiplicative_right_identity]) ).
cnf(c7,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(clausification,[status(esa)],[right_distributivity]) ).
cnf(c9,plain,
multiplication(X0,zero) = zero,
inference(clausification,[status(esa)],[right_annihilation]) ).
cnf(c10,plain,
multiplication(zero,X0) = zero,
inference(clausification,[status(esa)],[left_annihilation]) ).
cnf(c13,plain,
( complement(sK23(X0),X0)
| ~ test(X0) ),
inference(clausification,[status(esa)],[test_1]) ).
cnf(c15,plain,
( multiplication(X1,X0) = zero
| ~ complement(X0,X1) ),
inference(clausification,[status(esa)],[test_2]) ).
cnf(c16,plain,
( addition(X1,X0) = one
| ~ complement(X0,X1) ),
inference(clausification,[status(esa)],[test_2]) ).
cnf(c18,plain,
( multiplication(X1,X0) != zero
| addition(X1,X0) != one
| multiplication(X0,X1) != zero
| complement(X0,X1) ),
inference(clausification,[status(esa)],[test_2]) ).
cnf(c19,plain,
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(clausification,[status(esa)],[test_3]) ).
cnf(c22,plain,
test(sK30),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c23,plain,
test(sK31),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c24,plain,
addition(multiplication(addition(sK30,c(sK30)),sK31),multiplication(addition(sK30,c(sK30)),c(sK31))) != one,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[status(thm)],[c19]) ).
cnf(d1,plain,
( addition(c(X0),X0) = one
| ~ test(X0) ),
inference(resolution,[status(thm)],[d0,c16]) ).
cnf(d2,plain,
( ~ test(X0)
| addition(X0,c(X0)) = one ),
inference(demodulation,[status(thm)],[d1,c0]) ).
cnf(d3,plain,
addition(sK30,c(sK30)) = one,
inference(resolution,[status(thm)],[d2,c22]) ).
cnf(d4,plain,
addition(sK31,c(sK31)) = one,
inference(resolution,[status(thm)],[d2,c23]) ).
cnf(d5,plain,
multiplication(addition(sK30,c(sK30)),addition(sK31,c(sK31))) != one,
inference(demodulation,[status(thm)],[c24,c7]) ).
cnf(d6,plain,
multiplication(addition(sK30,c(sK30)),one) != one,
inference(demodulation,[status(thm)],[d5,d4]) ).
cnf(d7,plain,
addition(sK30,c(sK30)) != one,
inference(demodulation,[status(thm)],[d6,c5]) ).
cnf(d8,plain,
one != one,
inference(demodulation,[status(thm)],[d7,d3]) ).
cnf(d9,plain,
( complement(zero,X0)
| multiplication(zero,X0) != zero
| addition(X0,zero) != one
| zero != zero ),
inference(superposition,[status(thm)],[c9,c18]) ).
cnf(d10,plain,
( complement(zero,X0)
| multiplication(zero,X0) != zero
| zero != zero
| X0 != one ),
inference(demodulation,[status(thm)],[d9,c2]) ).
cnf(d11,plain,
( complement(zero,X0)
| zero != zero
| zero != zero
| X0 != one ),
inference(demodulation,[status(thm)],[d10,c10]) ).
cnf(d12,plain,
( ~ test(X0)
| multiplication(X0,sK23(X0)) = zero ),
inference(resolution,[status(thm)],[c15,c13]) ).
cnf(d13,plain,
multiplication(sK31,sK23(sK31)) = zero,
inference(resolution,[status(thm)],[d12,c23]) ).
cnf(d14,plain,
multiplication(zero,X0) = multiplication(sK31,multiplication(sK23(sK31),X0)),
inference(superposition,[status(thm)],[d13,c4]) ).
cnf(d15,plain,
zero = multiplication(sK31,multiplication(sK23(sK31),X0)),
inference(demodulation,[status(thm)],[d14,c10]) ).
cnf(d16,plain,
zero = multiplication(sK31,zero),
inference(superposition,[status(thm)],[c9,d15]) ).
cnf(d17,plain,
zero = zero,
inference(demodulation,[status(thm)],[d16,c9]) ).
cnf(d18,plain,
( complement(zero,X0)
| zero != zero
| X0 != one ),
inference(resolution,[status(thm)],[d17,d11]) ).
cnf(d19,plain,
( complement(zero,X0)
| X0 != one ),
inference(equality_resolution,[status(thm)],[d18]) ).
cnf(d20,plain,
complement(zero,one),
inference(equality_resolution,[status(thm)],[d19]) ).
cnf(d21,plain,
addition(one,zero) = one,
inference(resolution,[status(thm)],[d20,c16]) ).
cnf(d22,plain,
one = one,
inference(demodulation,[status(thm)],[d21,c2]) ).
cnf(d23,plain,
$false,
inference(resolution,[status(thm)],[d22,d8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE007+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n011.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Fri Sep 25 19:11:44 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.17/4.43 % SZS status Theorem for theBenchmark.p
% 31.17/4.43 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------