%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE006+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:44:02 AM UTC 2026
% Result : Theorem 0.14s 0.58s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 30 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 8 ~; 4 |; 4 &)
% ( 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 : 16 ( 0 sgn 8 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('theBenchmark.p',additive_commutativity) ).
fof(test_2,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) ),
file('theBenchmark.p',test_2) ).
fof(test_3,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('theBenchmark.p',test_3) ).
fof(goals,conjecture,
! [X0] :
( test(X0)
=> one = addition(X0,c(X0)) ),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0] :
( test(X0)
=> one = addition(X0,c(X0)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(nnf_17,plain,
? [X0] :
( addition(X0,c(X0)) != one
& test(X0) ),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
( addition(sK0,c(sK0)) != one
& test(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_17]) ).
cnf(c_22,negated_conjecture,
test(sK0),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_23,plain,
( complement(A,B)
| c(A) != B
| ~ test(A) ),
inference(clausify,[status(thm)],[test_3]) ).
cnf(c_31,negated_conjecture,
( complement(sK0,A)
| c(sK0) != A ),
inference(resolve,[status(thm)],[c_23,c_22]) ).
cnf(c_35,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_50,plain,
( addition(B,A) = one
| ~ complement(A,B) ),
inference(clausify,[status(thm)],[test_2]) ).
cnf(c_52,negated_conjecture,
addition(sK0,c(sK0)) != one,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_58,plain,
complement(sK0,c(sK0)),
inference(xxres,[status(thm)],[c_31]) ).
cnf(c_101,plain,
addition(c(sK0),sK0) = one,
inference(resolve,[status(thm)],[c_58,c_50]) ).
cnf(c_102,plain,
addition(sK0,c(sK0)) = one,
inference(paramod,[status(thm)],[c_35,c_101]) ).
cnf(c_100,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_52,c_102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE006+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.54 % Computer : n017.cluster.edu
% 0.11/0.54 % Model : x86_64 x86_64
% 0.11/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.54 % Memory : 8046.5625MB
% 0.11/0.54 % OS : Linux 6.8.0-71-generic
% 0.11/0.54 % CPULimit : 300
% 0.11/0.54 % WCLimit : 300
% 0.11/0.54 % DateTime : Fri Sep 25 19:07:18 UTC 2026
% 0.11/0.55 % CPUTime :
% 0.11/0.55 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.55 % Process 2924236 was started by sandbox on n017,
% 0.11/0.55 % Fri Sep 25 19:07:18 2026
% 0.11/0.55 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.56
% 0.11/0.56 % From the command line: assign(max_seconds, 300).
% 0.14/0.58
% 0.14/0.58 % SZS status Theorem for theBenchmark
% 0.14/0.58
% 0.14/0.58 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.14/0.58 % Length of proof is 12.
% 0.14/0.58 % Level of proof is 4.
% 0.14/0.58 % Maximum clause weight is 8.000.
% 0.14/0.58 % Given clauses 32.
% 0.14/0.58
% 0.14/0.58 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------