%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE076+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 : 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:44:16 AM UTC 2026
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 5 ( 1 sgn 3 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(right_annihilation,axiom,
! [A] : multiplication(A,zero) = zero,
file('theBenchmark.p',right_annihilation) ).
fof(goals,conjecture,
! [X0] : domain(multiplication(X0,domain(zero))) = zero,
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0] : domain(multiplication(X0,domain(zero))) = zero,
inference(assume_negation,[status(cth)],[goals]) ).
fof(nnf_17,plain,
? [X0] : domain(multiplication(X0,domain(zero))) != zero,
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
domain(multiplication(sK0,domain(zero))) != zero,
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_17]) ).
cnf(c_20,negated_conjecture,
domain(multiplication(sK0,domain(zero))) != zero,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
fof(domain4,axiom,
domain(zero) = zero,
file('theBenchmark.p',domain4) ).
cnf(c_22,plain,
domain(zero) = zero,
inference(clausify,[status(thm)],[domain4]) ).
cnf(c_28,plain,
multiplication(A,zero) = zero,
inference(clausify,[status(thm)],[right_annihilation]) ).
cnf(c_41,negated_conjecture,
domain(multiplication(sK0,zero)) != zero,
inference(paramod,[status(thm)],[c_22,c_20]) ).
cnf(c_42,negated_conjecture,
domain(zero) != zero,
inference(paramod,[status(thm)],[c_28,c_41]) ).
cnf(c_43,negated_conjecture,
zero != zero,
inference(paramod,[status(thm)],[c_22,c_42]) ).
cnf(c_40,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE076+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n011.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Fri Sep 25 19:19:43 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.34 % Process 2667323 was started by sandbox on n011,
% 0.09/0.34 % Fri Sep 25 19:19:43 2026
% 0.09/0.34 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.35
% 0.09/0.35 % From the command line: assign(max_seconds, 300).
% 0.13/0.36
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36
% 0.13/0.36 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.36 % Length of proof is 6.
% 0.13/0.36 % Level of proof is 2.
% 0.13/0.36 % Maximum clause weight is 7.000.
% 0.13/0.36 % Given clauses 0.
% 0.13/0.36
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------