%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM603+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 : n020.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:32 AM UTC 2026
% Result : Theorem 0.16s 5.66s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 40 ( 4 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 32 ( 11 ~; 9 |; 7 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mZeroLess,axiom,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> sdtlseqdt0(sz00,W0) ),
file('theBenchmark.p',mZeroLess) ).
fof(m__3623,axiom,
( ! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,W0))
& aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(W0)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(W0)),sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0)))) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
file('theBenchmark.p',m__3623) ).
fof(m__3754,axiom,
! [W0,W1] :
( ( aElementOf0(W1,szNzAzT0)
& aElementOf0(W0,szNzAzT0) )
=> ( sdtlseqdt0(W1,W0)
=> aSubsetOf0(sdtlpdtrp0(xN,W0),sdtlpdtrp0(xN,W1)) ) ),
file('theBenchmark.p',m__3754) ).
fof(m__5034,axiom,
( sdtlpdtrp0(xe,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('theBenchmark.p',m__5034) ).
fof(m__,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('theBenchmark.p',m__) ).
fof(m___neg,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(assume_negation,[status(cth)],[m__]) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('theBenchmark.p',mZeroNum) ).
cnf(c_134,plain,
aElementOf0(sz00,szNzAzT0),
inference(clausify,[status(thm)],[mZeroNum]) ).
cnf(c_141,plain,
( sdtlseqdt0(sz00,A)
| ~ aElementOf0(A,szNzAzT0) ),
inference(clausify,[status(thm)],[mZeroLess]) ).
cnf(c_251,plain,
sdtlpdtrp0(xN,sz00) = xS,
inference(clausify,[status(thm)],[m__3623]) ).
cnf(c_256,plain,
( aSubsetOf0(sdtlpdtrp0(xN,A),sdtlpdtrp0(xN,B))
| ~ sdtlseqdt0(B,A)
| ~ aElementOf0(B,szNzAzT0)
| ~ aElementOf0(A,szNzAzT0) ),
inference(clausify,[status(thm)],[m__3754]) ).
cnf(c_292,plain,
aElementOf0(xi,szNzAzT0),
inference(clausify,[status(thm)],[m__5034]) ).
cnf(c_294,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(clausify,[status(thm)],[m___neg]) ).
cnf(c_835,plain,
sdtlseqdt0(sz00,xi),
inference(resolve,[status(thm)],[c_292,c_141]) ).
cnf(c_1218,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,sz00))
| ~ aElementOf0(sz00,szNzAzT0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(resolve,[status(thm)],[c_835,c_256]) ).
cnf(c_1219,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
| ~ aElementOf0(sz00,szNzAzT0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(paramod,[status(thm)],[c_251,c_1218]) ).
cnf(c_1220,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
| ~ aElementOf0(sz00,szNzAzT0) ),
inference(resolve,[status(thm)],[c_292,c_1219]) ).
cnf(c_1221,plain,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(resolve,[status(thm)],[c_134,c_1220]) ).
cnf(c_1217,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_294,c_1221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM603+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.13/5.38 % Computer : n020.cluster.edu
% 0.13/5.38 % Model : x86_64 x86_64
% 0.13/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.38 % Memory : 8046.5625MB
% 0.13/5.38 % OS : Linux 6.8.0-71-generic
% 0.13/5.38 % CPULimit : 300
% 0.13/5.38 % WCLimit : 300
% 0.13/5.38 % DateTime : Sat Sep 26 03:25:55 UTC 2026
% 0.13/5.38 % CPUTime :
% 0.13/5.39 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/5.39 % Process 495327 was started by sandbox on n020,
% 0.13/5.39 % Sat Sep 26 03:25:55 2026
% 0.13/5.39 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/5.43
% 0.16/5.43 % From the command line: assign(max_seconds, 300).
% 0.16/5.66
% 0.16/5.66 % SZS status Theorem for theBenchmark
% 0.16/5.66
% 0.16/5.66 % Proof 1 at 0.16 (+ 0.05) seconds.
% 0.16/5.66 % Length of proof is 13.
% 0.16/5.66 % Level of proof is 3.
% 0.16/5.66 % Maximum clause weight is 16.000.
% 0.16/5.66 % Given clauses 289.
% 0.16/5.66
% 0.16/5.66 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------