%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE005+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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.08s 10.39s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 17 unt; 0 def)
% Number of atoms : 45 ( 33 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 12 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 2 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('theBenchmark.p',additive_commutativity) ).
fof(additive_identity,axiom,
! [A] : addition(A,zero) = A,
file('theBenchmark.p',additive_identity) ).
fof(right_annihilation,axiom,
! [A] : multiplication(A,zero) = zero,
file('theBenchmark.p',right_annihilation) ).
fof(left_annihilation,axiom,
! [A] : multiplication(zero,A) = zero,
file('theBenchmark.p',left_annihilation) ).
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(test_4,axiom,
! [X0] :
( ~ test(X0)
=> c(X0) = zero ),
file('theBenchmark.p',test_4) ).
fof(goals,conjecture,
c(one) = zero,
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
c(one) != zero,
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_20,plain,
( ~ complement(A,B)
| c(A) = B
| ~ test(A) ),
inference(clausify,[status(thm)],[test_3]) ).
cnf(c_21,plain,
( c(A) = zero
| test(A) ),
inference(clausify,[status(thm)],[test_4]) ).
cnf(c_30,plain,
( c(A) = zero
| ~ complement(A,B)
| c(A) = B ),
inference(resolve,[status(thm)],[c_20,c_21]) ).
cnf(c_31,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_33,plain,
addition(A,zero) = A,
inference(clausify,[status(thm)],[additive_identity]) ).
cnf(c_42,plain,
multiplication(A,zero) = zero,
inference(clausify,[status(thm)],[right_annihilation]) ).
cnf(c_43,plain,
multiplication(zero,A) = zero,
inference(clausify,[status(thm)],[left_annihilation]) ).
cnf(c_47,plain,
( addition(B,A) != one
| multiplication(A,B) != zero
| multiplication(B,A) != zero
| complement(A,B) ),
inference(clausify,[status(thm)],[test_2]) ).
cnf(c_48,negated_conjecture,
c(one) != zero,
inference(clausify,[status(thm)],[goals_neg]) ).
cnf(c_85,plain,
A = addition(zero,A),
inference(paramod,[status(thm)],[c_33,c_31]) ).
cnf(c_59,plain,
addition(zero,A) = A,
inference(copy,[status(thm)],[c_85]) ).
cnf(c_86,negated_conjecture,
( c(one) = zero
| ~ complement(one,zero) ),
inference(resolve,[status(thm)],[c_30,c_48]) ).
cnf(c_83,negated_conjecture,
~ complement(one,zero),
inference(resolve,[status(thm)],[c_86,c_48]) ).
cnf(c_87,plain,
( addition(zero,one) != one
| multiplication(one,zero) != zero
| multiplication(zero,one) != zero ),
inference(resolve,[status(thm)],[c_47,c_83]) ).
cnf(c_88,plain,
( addition(zero,one) != one
| multiplication(one,zero) != zero ),
inference(resolve,[status(thm)],[c_87,c_43]) ).
cnf(c_89,plain,
addition(zero,one) != one,
inference(resolve,[status(thm)],[c_88,c_42]) ).
cnf(c_90,plain,
one != one,
inference(paramod,[status(thm)],[c_59,c_89]) ).
cnf(c_84,plain,
$false,
inference(copy,[status(thm)],[c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE005+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/10.37 % Computer : n016.cluster.edu
% 0.08/10.37 % Model : x86_64 x86_64
% 0.08/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.37 % Memory : 8046.5625MB
% 0.08/10.37 % OS : Linux 6.8.0-71-generic
% 0.08/10.37 % CPULimit : 300
% 0.08/10.37 % WCLimit : 300
% 0.08/10.37 % DateTime : Fri Sep 25 19:16:55 UTC 2026
% 0.08/10.37 % CPUTime :
% 0.08/10.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/10.38 % Process 3075214 was started by sandbox2 on n016,
% 0.08/10.38 % Fri Sep 25 19:16:55 2026
% 0.08/10.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/10.38
% 0.08/10.38 % From the command line: assign(max_seconds, 300).
% 0.08/10.39
% 0.08/10.39 % SZS status Theorem for theBenchmark
% 0.08/10.39
% 0.08/10.39 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.08/10.39 % Length of proof is 20.
% 0.08/10.39 % Level of proof is 4.
% 0.08/10.39 % Maximum clause weight is 18.000.
% 0.08/10.39 % Given clauses 27.
% 0.08/10.39
% 0.08/10.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------