%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM490+3 : 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 : n005.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 08:17:10 AM UTC 2026
% Result : Theorem 1.81s 0.70s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 6 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 3 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdtasdt0(xr,xm) = sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
| sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm) ),
file('theBenchmark.p',m__) ).
fof(m___neg,negated_conjecture,
~ ( sdtasdt0(xr,xm) = sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
| sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_271,negated_conjecture,
sdtasdt0(xn,xm) != sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
inference(clausify,[status(thm)],[m___neg]) ).
cnf(c_272,negated_conjecture,
sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) != sdtasdt0(xn,xm),
inference(copy,[status(thm)],[c_271]) ).
fof(m__1951,axiom,
sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
file('theBenchmark.p',m__1951) ).
cnf(c_273,plain,
sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
inference(clausify,[status(thm)],[m__1951]) ).
cnf(c_275,plain,
sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm),
inference(copy,[status(thm)],[c_273]) ).
cnf(c_274,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_272,c_275]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM490+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 02:58:02 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 1050587 was started by sandbox2 on n005,
% 0.09/0.37 % Sat Sep 26 02:58:02 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.44
% 0.09/0.44 % From the command line: assign(max_seconds, 300).
% 1.81/0.70
% 1.81/0.70 % SZS status Theorem for theBenchmark
% 1.81/0.70
% 1.81/0.70 % Proof 1 at 0.25 (+ 0.00) seconds.
% 1.81/0.70 % Length of proof is 5.
% 1.81/0.70 % Level of proof is 3.
% 1.81/0.70 % Maximum clause weight is 26.000.
% 1.81/0.70 % Given clauses 0.
% 1.81/0.70
% 1.81/0.70 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------