%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : KLE006+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 : n013.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 24.06s 8.78s
% Output : CNFRefutation 24.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 38 ( 16 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 39 ( 20 ~; 12 |; 2 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [X0,X1] : addition(X0,X1) = addition(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] :
( test(X0)
=> one = addition(X0,c(X0)) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( test(X0)
=> one = addition(X0,c(X0)) ),
inference(negate_conjecture,[status(cth)],[goals]) ).
cnf(c0,plain,
addition(X0,X1) = addition(X1,X0),
inference(clausification,[status(esa)],[additive_commutativity]) ).
cnf(c17,plain,
( addition(X1,X0) = one
| ~ 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(c20,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,
one != addition(sK30,c(sK30)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[status(thm)],[c19]) ).
cnf(d1,plain,
( ~ complement(sK30,X0)
| ~ test(sK30)
| one != addition(sK30,X0) ),
inference(superposition,[status(thm)],[c20,c23]) ).
cnf(d2,plain,
( ~ complement(sK30,X0)
| one != addition(sK30,X0) ),
inference(resolution,[status(thm)],[c22,d1]) ).
cnf(d3,plain,
( ~ complement(sK30,X0)
| one != addition(X0,sK30) ),
inference(superposition,[status(thm)],[c0,d2]) ).
cnf(d4,plain,
( ~ complement(sK30,X0)
| ~ complement(sK30,X0)
| one != one ),
inference(superposition,[status(thm)],[c17,d3]) ).
cnf(d5,plain,
~ complement(sK30,X0),
inference(equality_resolution,[status(thm)],[d4]) ).
cnf(d6,plain,
~ test(sK30),
inference(resolution,[status(thm)],[d5,d0]) ).
cnf(d7,plain,
$false,
inference(resolution,[status(thm)],[c22,d6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE006+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.09/5.57 % Computer : n013.cluster.edu
% 0.09/5.57 % Model : x86_64 x86_64
% 0.09/5.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.57 % Memory : 8046.5625MB
% 0.09/5.57 % OS : Linux 6.8.0-71-generic
% 0.09/5.57 % CPULimit : 300
% 0.09/5.57 % WCLimit : 300
% 0.09/5.57 % DateTime : Fri Sep 25 19:11:21 UTC 2026
% 0.09/5.58 % CPUTime :
% 0.09/5.58 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.06/8.78 % SZS status Theorem for theBenchmark.p
% 24.06/8.78 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------