%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM500+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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 : Fri Sep 25 02:25:20 PM UTC 2026
% Result : Theorem 8.36s 2.50s
% Output : CNFRefutation 8.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 80 ( 18 unt; 1 def)
% Number of atoms : 354 ( 171 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 415 ( 141 ~; 140 |; 124 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 63 !; 28 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(f3,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f8,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( X0 = sdtpldt0(sz00,X0)
& sdtpldt0(X0,sz00) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_AddZero) ).
fof(f11,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( X0 = sdtasdt0(sz10,X0)
& sdtasdt0(X0,sz10) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulUnit) ).
fof(f16,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( sdtpldt0(X0,X1) = sz00
=> ( X1 = sz00
& X0 = sz00 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroAdd) ).
fof(f38,axiom,
! [X0] :
( ( X0 != sz10
& X0 != sz00
& aNaturalNumber0(X0) )
=> ? [X1] :
( isPrime0(X1)
& doDivides0(X1,X0)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mPrimDiv) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f41,axiom,
( doDivides0(xp,sdtasdt0(xn,xm))
& ? [X0] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X0)
& aNaturalNumber0(X0) )
& isPrime0(xp)
& ! [X0] :
( ( ( doDivides0(X0,xp)
| ? [X1] :
( xp = sdtasdt0(X0,X1)
& aNaturalNumber0(X1) ) )
& aNaturalNumber0(X0) )
=> ( X0 = xp
| X0 = sz10 ) )
& xp != sz10
& xp != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1860) ).
fof(f45,axiom,
( xk = sdtsldt0(sdtasdt0(xn,xm),xp)
& sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
& aNaturalNumber0(xk) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2306) ).
fof(f47,axiom,
( xk != sz10
& xk != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2327) ).
fof(f48,conjecture,
? [X0] :
( ( isPrime0(X0)
| ( ! [X1] :
( ( doDivides0(X1,X0)
& ? [X2] :
( X0 = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) )
& aNaturalNumber0(X1) )
=> ( X1 = X0
| X1 = sz10 ) )
& X0 != sz10
& X0 != sz00 ) )
& ( doDivides0(X0,xk)
| ? [X1] :
( xk = sdtasdt0(X0,X1)
& aNaturalNumber0(X1) ) )
& aNaturalNumber0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f49,negated_conjecture,
~ ? [X0] :
( ( isPrime0(X0)
| ( ! [X1] :
( ( doDivides0(X1,X0)
& ? [X2] :
( X0 = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) )
& aNaturalNumber0(X1) )
=> ( X1 = X0
| X1 = sz10 ) )
& X0 != sz10
& X0 != sz00 ) )
& ( doDivides0(X0,xk)
| ? [X1] :
( xk = sdtasdt0(X0,X1)
& aNaturalNumber0(X1) ) )
& aNaturalNumber0(X0) ),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f53,plain,
( doDivides0(xp,sdtasdt0(xn,xm))
& ? [X2] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X2)
& aNaturalNumber0(X2) )
& isPrime0(xp)
& ! [X0] :
( ( ( doDivides0(X0,xp)
| ? [X1] :
( xp = sdtasdt0(X0,X1)
& aNaturalNumber0(X1) ) )
& aNaturalNumber0(X0) )
=> ( X0 = xp
| X0 = sz10 ) )
& xp != sz10
& xp != sz00 ),
inference(rectify,[],[f41]) ).
fof(f55,plain,
~ ? [X0] :
( ( isPrime0(X0)
| ( ! [X2] :
( ( doDivides0(X2,X0)
& ? [X3] :
( sdtasdt0(X2,X3) = X0
& aNaturalNumber0(X3) )
& aNaturalNumber0(X2) )
=> ( X0 = X2
| sz10 = X2 ) )
& X0 != sz10
& X0 != sz00 ) )
& ( doDivides0(X0,xk)
| ? [X1] :
( xk = sdtasdt0(X0,X1)
& aNaturalNumber0(X1) ) )
& aNaturalNumber0(X0) ),
inference(rectify,[],[f49]) ).
fof(f64,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( X0 = sdtpldt0(sz00,X0)
& sdtpldt0(X0,sz00) = X0 ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f69,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( X0 = sdtasdt0(sz10,X0)
& sdtasdt0(X0,sz10) = X0 ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f77,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sz00 != sdtpldt0(X0,X1)
| ( X1 = sz00
& X0 = sz00 ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f78,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sz00 != sdtpldt0(X0,X1)
| ( X1 = sz00
& X0 = sz00 ) ),
inference(flattening,[],[f77]) ).
fof(f118,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| ? [X1] :
( isPrime0(X1)
& doDivides0(X1,X0)
& aNaturalNumber0(X1) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f119,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| ? [X1] :
( isPrime0(X1)
& doDivides0(X1,X0)
& aNaturalNumber0(X1) ) ),
inference(flattening,[],[f118]) ).
fof(f122,plain,
( doDivides0(xp,sdtasdt0(xn,xm))
& ? [X2] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X2)
& aNaturalNumber0(X2) )
& isPrime0(xp)
& ! [X0] :
( ( ~ doDivides0(X0,xp)
& ! [X1] :
( sdtasdt0(X0,X1) != xp
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0)
| X0 = xp
| X0 = sz10 )
& xp != sz10
& xp != sz00 ),
inference(ennf_transformation,[],[f53]) ).
fof(f123,plain,
( doDivides0(xp,sdtasdt0(xn,xm))
& ? [X2] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X2)
& aNaturalNumber0(X2) )
& isPrime0(xp)
& ! [X0] :
( ( ~ doDivides0(X0,xp)
& ! [X1] :
( sdtasdt0(X0,X1) != xp
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0)
| X0 = xp
| X0 = sz10 )
& xp != sz10
& xp != sz00 ),
inference(flattening,[],[f122]) ).
fof(f127,plain,
! [X0] :
( ( ~ isPrime0(X0)
& ( ? [X2] :
( doDivides0(X2,X0)
& ? [X3] :
( sdtasdt0(X2,X3) = X0
& aNaturalNumber0(X3) )
& aNaturalNumber0(X2)
& X0 != X2
& sz10 != X2 )
| sz10 = X0
| sz00 = X0 ) )
| ( ~ doDivides0(X0,xk)
& ! [X1] :
( sdtasdt0(X0,X1) != xk
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f128,plain,
! [X0] :
( ( ~ isPrime0(X0)
& ( ? [X2] :
( doDivides0(X2,X0)
& ? [X3] :
( sdtasdt0(X2,X3) = X0
& aNaturalNumber0(X3) )
& aNaturalNumber0(X2)
& X0 != X2
& sz10 != X2 )
| sz10 = X0
| sz00 = X0 ) )
| ( ~ doDivides0(X0,xk)
& ! [X1] :
( sdtasdt0(X0,X1) != xk
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f127]) ).
fof(f148,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| ( isPrime0(sK6(X0))
& doDivides0(sK6(X0),X0)
& aNaturalNumber0(sK6(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X1,sK6(X0))],[f119]) ).
fof(f157,plain,
( doDivides0(xp,sdtasdt0(xn,xm))
& sdtasdt0(xn,xm) = sdtasdt0(xp,sK11)
& aNaturalNumber0(sK11)
& isPrime0(xp)
& ! [X0] :
( ( ~ doDivides0(X0,xp)
& ! [X1] :
( sdtasdt0(X0,X1) != xp
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0)
| X0 = xp
| X0 = sz10 )
& xp != sz10
& xp != sz00 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X2,sK11)],[f123]) ).
fof(f162,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f164,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f169,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sdtpldt0(sz00,X0) = X0 ),
inference(cnf_transformation,[],[f64]) ).
fof(f173,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sdtasdt0(sz10,X0) = X0 ),
inference(cnf_transformation,[],[f69]) ).
fof(f183,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sz00 != sdtpldt0(X0,X1)
| sz00 = X1 ),
inference(cnf_transformation,[],[f78]) ).
fof(f227,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| isPrime0(sK6(X0)) ),
inference(cnf_transformation,[],[f148]) ).
fof(f228,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| doDivides0(sK6(X0),X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f229,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sK6(X0)) ),
inference(cnf_transformation,[],[f148]) ).
fof(f230,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f254,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) != xp
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| xp = X0
| sz10 = X0 ),
inference(cnf_transformation,[],[f157]) ).
fof(f255,plain,
sz10 != xp,
inference(cnf_transformation,[],[f157]) ).
fof(f271,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f45]) ).
fof(f274,plain,
sz10 != xk,
inference(cnf_transformation,[],[f47]) ).
fof(f275,plain,
sz00 != xk,
inference(cnf_transformation,[],[f47]) ).
fof(f283,plain,
! [X0] :
( sP2(X0)
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_49,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f162]) ).
tcf(c_50,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f164]) ).
tcf(c_57,plain,
! [X0: $i] :
( ( sdtpldt0(sz00,X0) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_61,plain,
! [X0: $i] :
( ( sdtasdt0(sz10,X0) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f173]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( ( X1 = sz00 )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( sdtpldt0(X0,X1) != sz00 ) ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_113,plain,
! [X0: $i] :
( aNaturalNumber0(sK6(X0))
| ( X0 = sz10 )
| ( X0 = sz00 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_114,plain,
! [X0: $i] :
( doDivides0(sK6(X0),X0)
| ( X0 = sz10 )
| ( X0 = sz00 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f228]) ).
tcf(c_115,plain,
! [X0: $i] :
( isPrime0(sK6(X0))
| ( X0 = sz10 )
| ( X0 = sz00 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_118,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f230]) ).
tcf(c_136,plain,
sz10 != xp,
inference(cnf_transformation,[],[f255]) ).
tcf(c_137,plain,
! [X0: $i,X1: $i] :
( ( X0 = xp )
| ( X0 = sz10 )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( sdtasdt0(X0,X1) != xp ) ),
inference(cnf_transformation,[],[f254]) ).
tcf(c_155,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f271]) ).
tcf(c_160,plain,
sz00 != xk,
inference(cnf_transformation,[],[f275]) ).
tcf(c_161,plain,
sz10 != xk,
inference(cnf_transformation,[],[f274]) ).
tcf(c_170,negated_conjecture,
! [X0: $i] :
( sP2(X0)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,xk) ),
inference(cnf_transformation,[],[f283]) ).
tcf(c_180,plain,
( ( sdtpldt0(sz00,sz00) = sz00 )
| ~ aNaturalNumber0(sz00) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_213,plain,
( ( sz00 = sz00 )
| ~ aNaturalNumber0(sz00)
| ( sdtpldt0(sz00,sz00) != sz00 ) ),
inference(instantiation,[status(thm)],[c_71]) ).
tcf(c_9993,negated_conjecture,
! [X0: $i] :
( sP2(X0)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,xk) ),
inference(demodulation,[status(thm)],[c_170]) ).
tcf(c_9997,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_11858,plain,
sdtasdt0(sz10,xp) = xp,
inference(superposition,[status(thm)],[c_118,c_61]) ).
tcf(c_12216,plain,
( ( sz10 = xp )
| ( sz10 = sz10 )
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sz10)
| ( sdtasdt0(sz10,xp) != xp ) ),
inference(instantiation,[status(thm)],[c_137]) ).
tcf(c_12235,plain,
! [X0: $i] :
( ( sz00 = xk )
| ( xk != X0 )
| ( sz00 != X0 ) ),
inference(instantiation,[status(thm)],[c_9997]) ).
tcf(c_12236,plain,
( ( sz00 = xk )
| ( xk != sz00 )
| ( sz00 != sz00 ) ),
inference(instantiation,[status(thm)],[c_12235]) ).
tcf(c_12237,plain,
! [X0: $i] :
( ( sz10 = xk )
| ( xk != X0 )
| ( sz10 != X0 ) ),
inference(instantiation,[status(thm)],[c_9997]) ).
tcf(c_13127,plain,
( sP2(sK6(xk))
| ( sz10 = xk )
| ( sz00 = xk )
| ~ aNaturalNumber0(xk)
| ~ aNaturalNumber0(sK6(xk)) ),
inference(superposition,[status(thm)],[c_114,c_9993]) ).
tcf(c_13128,plain,
( sP2(sK6(xk))
| ~ aNaturalNumber0(sK6(xk)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13127,c_161,c_160,c_155]) ).
tcf(c_13135,plain,
( sP2(sK6(xk))
| ( sz10 = xk )
| ( sz00 = xk )
| ~ aNaturalNumber0(xk) ),
inference(superposition,[status(thm)],[c_113,c_13128]) ).
tcf(c_13136,plain,
sP2(sK6(xk)),
inference(forward_subsumption_resolution,[status(thm)],[c_13135,c_161,c_160,c_155]) ).
tcf(c_13596,plain,
( isPrime0(sK6(xk))
| ( xk = sz10 )
| ( xk = sz00 )
| ~ aNaturalNumber0(xk) ),
inference(instantiation,[status(thm)],[c_115]) ).
tcf(c_17572,plain,
( ( sz10 = xk )
| ( xk != sz10 )
| ( sz10 != sz10 ) ),
inference(instantiation,[status(thm)],[c_12237]) ).
fof(f132,definition,
! [X0] :
( ~ sP2(X0)
| ( ~ isPrime0(X0)
& ( ? [X2] :
( doDivides0(X2,X0)
& ? [X3] :
( sdtasdt0(X2,X3) = X0
& aNaturalNumber0(X3) )
& aNaturalNumber0(X2)
& X0 != X2
& sz10 != X2 )
| sz10 = X0
| sz00 = X0 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f133,plain,
! [X0] :
( sP2(X0)
| ( ~ doDivides0(X0,xk)
& ! [X1] :
( sdtasdt0(X0,X1) != xk
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0) ),
inference(definition_folding,[],[f128,f132]) ).
fof(f159,plain,
! [X0] :
( ~ sP2(X0)
| ( ~ isPrime0(X0)
& ( ? [X2] :
( doDivides0(X2,X0)
& ? [X3] :
( sdtasdt0(X2,X3) = X0
& aNaturalNumber0(X3) )
& aNaturalNumber0(X2)
& X0 != X2
& sz10 != X2 )
| sz10 = X0
| sz00 = X0 ) ) ),
inference(nnf_transformation,[],[f132]) ).
fof(f160,plain,
! [X0] :
( ~ sP2(X0)
| ( ~ isPrime0(X0)
& ( ? [X1] :
( doDivides0(X1,X0)
& ? [X2] :
( sdtasdt0(X1,X2) = X0
& aNaturalNumber0(X2) )
& aNaturalNumber0(X1)
& X0 != X1
& sz10 != X1 )
| sz10 = X0
| sz00 = X0 ) ) ),
inference(rectify,[],[f159]) ).
fof(f161,plain,
! [X0] :
( ~ sP2(X0)
| ( ~ isPrime0(X0)
& ( ( doDivides0(sK14(X0),X0)
& sdtasdt0(sK14(X0),sK15(X0)) = X0
& aNaturalNumber0(sK15(X0))
& aNaturalNumber0(sK14(X0))
& sK14(X0) != X0
& sz10 != sK14(X0) )
| sz10 = X0
| sz00 = X0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0))],[f160]) ).
fof(f276,plain,
! [X0] :
( ~ sP2(X0)
| ~ isPrime0(X0) ),
inference(cnf_transformation,[],[f161]) ).
tcf(c_168,plain,
! [X0: $i] :
( ~ sP2(X0)
| ~ isPrime0(X0) ),
inference(cnf_transformation,[],[f276]) ).
tcf(c_22026,plain,
( ~ sP2(sK6(xk))
| ~ isPrime0(sK6(xk)) ),
inference(instantiation,[status(thm)],[c_168]) ).
tcf(c_22027,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_22026,c_17572,c_13596,c_13136,c_12236,c_12216,c_11858,c_213,c_180,c_136,c_160,c_161,c_49,c_50,c_118,c_155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM500+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/1.12 % Computer : n013.cluster.edu
% 0.11/1.12 % Model : x86_64 x86_64
% 0.11/1.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/1.12 % Memory : 8046.5625MB
% 0.11/1.12 % OS : Linux 6.8.0-71-generic
% 0.11/1.12 % CPULimit : 300
% 0.11/1.12 % WCLimit : 300
% 0.11/1.12 % DateTime : Thu Sep 24 04:18:09 UTC 2026
% 0.11/1.12 % CPUTime :
% 0.11/1.12 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/1.16 Running first-order theorem proving
% 0.13/1.16 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/1.17
% 0.13/1.17 % ======== iProver multi-core TPTP/SMT =========
% 0.13/1.17
% 0.13/1.17 % Detected problem language: tptp
% 0.13/1.18 % Proving...
% 8.36/2.50 % SZS status Started for theBenchmark.p
% 8.36/2.50 % SZS status Theorem for theBenchmark.p
% 8.36/2.50
% 8.36/2.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.36/2.50
% 8.36/2.50 % ------ iProver source info
% 8.36/2.50
% 8.36/2.50 % git: date: 2026-07-19 20:42:38 +0200
% 8.36/2.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.36/2.50 % git: non_committed_changes: false
% 8.36/2.50
% 8.36/2.50 % ------ Parsing...
% 8.36/2.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.36/2.50
% 8.36/2.50 % ------ Preprocessing... sup_sim: 3 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 8.36/2.50
% 8.36/2.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.36/2.50
% 8.36/2.50 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.36/2.50 % ------ Proving...
% 8.36/2.50 % ------ Problem Properties
% 8.36/2.50
% 8.36/2.50 %
% 8.36/2.50 % clauses 115
% 8.36/2.50 % conjectures 2
% 8.36/2.50 % EPR 37
% 8.36/2.50 % Horn 71
% 8.36/2.50 % unary 29
% 8.36/2.50 % binary 14
% 8.36/2.50 % lits 403
% 8.36/2.50 % lits eq 126
% 8.36/2.50 % fd_pure 0
% 8.36/2.50 % fd_pseudo 0
% 8.36/2.50 % fd_cond 27
% 8.36/2.50 % fd_pseudo_cond 11
% 8.36/2.50 % AC symbols 0
% 8.36/2.50
% 8.36/2.50 % ------ Schedule dynamic 5 is on
% 8.36/2.50
% 8.36/2.50 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.36/2.50
% 8.36/2.50
% 8.36/2.50 % ------
% 8.36/2.50 % Current options:
% 8.36/2.50 % ------
% 8.36/2.50
% 8.36/2.50
% 8.36/2.50 %
% 8.36/2.50
% 8.36/2.50 % ------ Proving...
% 8.36/2.50 %
% 8.36/2.50
% 8.36/2.50 % SZS status Theorem for theBenchmark.p
% 8.36/2.50
% 8.36/2.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.36/2.50
% 8.36/2.50
%------------------------------------------------------------------------------