%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM430+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 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 : Fri Sep 25 02:24:13 PM UTC 2026
% Result : Theorem 3.71s 1.18s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 84 ( 16 unt; 0 def)
% Number of atoms : 285 ( 100 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 350 ( 149 ~; 150 |; 38 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 112 ( 0 sgn 105 !; 7 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntZero) ).
fof(f4,axiom,
! [X0] :
( aInteger0(X0)
=> aInteger0(smndt0(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
fof(f5,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).
fof(f8,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> sdtpldt0(X0,X1) = sdtpldt0(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(f15,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulZero) ).
fof(f17,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> ( sdtasdt0(X0,X1) = sz00
=> ( X1 = sz00
| X0 = sz00 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroDiv) ).
fof(f18,axiom,
! [X0] :
( aInteger0(X0)
=> ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& X1 != sz00
& aInteger0(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivisor) ).
fof(f19,axiom,
! [X0,X1,X2] :
( ( X2 != sz00
& aInteger0(X2)
& aInteger0(X1)
& aInteger0(X0) )
=> ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEquMod) ).
fof(f22,axiom,
( aInteger0(xc)
& xq != sz00
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).
fof(f23,axiom,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).
fof(f25,conjecture,
? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f26,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) ),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f28,plain,
! [X0] :
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f29,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f30,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(flattening,[],[f29]) ).
fof(f35,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sdtpldt0(X0,X1) = sdtpldt0(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f36,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sdtpldt0(X0,X1) = sdtpldt0(X1,X0) ),
inference(flattening,[],[f35]) ).
fof(f46,plain,
! [X0] :
( ~ aInteger0(X0)
| ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f48,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| X1 = sz00
| X0 = sz00 ),
inference(ennf_transformation,[],[f17]) ).
fof(f49,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| X1 = sz00
| X0 = sz00 ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0] :
( ~ aInteger0(X0)
| ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& X1 != sz00
& aInteger0(X1) ) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f51,plain,
! [X0,X1,X2] :
( sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f52,plain,
! [X0,X1,X2] :
( sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
inference(flattening,[],[f51]) ).
fof(f57,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f58,plain,
! [X0] :
( ~ aInteger0(X0)
| ! [X1] :
( ( ~ aDivisorOf0(X1,X0)
| ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& X1 != sz00
& aInteger0(X1) ) )
& ( ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1)
| aDivisorOf0(X1,X0) ) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f59,plain,
! [X0] :
( ~ aInteger0(X0)
| ! [X1] :
( ( ~ aDivisorOf0(X1,X0)
| ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& X1 != sz00
& aInteger0(X1) ) )
& ( ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1)
| aDivisorOf0(X1,X0) ) ) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0] :
( ~ aInteger0(X0)
| ! [X1] :
( ( ~ aDivisorOf0(X1,X0)
| ( ? [X3] :
( sdtasdt0(X1,X3) = X0
& aInteger0(X3) )
& X1 != sz00
& aInteger0(X1) ) )
& ( ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1)
| aDivisorOf0(X1,X0) ) ) ),
inference(rectify,[],[f59]) ).
fof(f61,plain,
! [X0] :
( ~ aInteger0(X0)
| ! [X1] :
( ( ~ aDivisorOf0(X1,X0)
| ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1))
& X1 != sz00
& aInteger0(X1) ) )
& ( ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1)
| aDivisorOf0(X1,X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f60]) ).
fof(f62,plain,
! [X0,X1,X2] :
( sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( ( ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
| aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
& ( ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| sdteqdtlpzmzozddtrp0(X0,X1,X2) ) ) ),
inference(nnf_transformation,[],[f52]) ).
fof(f63,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f65,plain,
! [X0] :
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f66,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f30]) ).
fof(f69,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sdtpldt0(X0,X1) = sdtpldt0(X1,X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f80,plain,
! [X0] :
( ~ aInteger0(X0)
| sz00 = sdtasdt0(sz00,X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f84,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| sz00 = X1
| sz00 = X0 ),
inference(cnf_transformation,[],[f49]) ).
fof(f85,plain,
! [X0,X1] :
( ~ aInteger0(X0)
| ~ aDivisorOf0(X1,X0)
| sdtasdt0(X1,sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f61]) ).
fof(f86,plain,
! [X0,X1] :
( ~ aInteger0(X0)
| ~ aDivisorOf0(X1,X0)
| aInteger0(sK0(X0,X1)) ),
inference(cnf_transformation,[],[f61]) ).
fof(f90,plain,
! [X2,X0,X1] :
( sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
| aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ),
inference(cnf_transformation,[],[f62]) ).
fof(f94,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f22]) ).
fof(f95,plain,
sz00 != xq,
inference(cnf_transformation,[],[f22]) ).
fof(f96,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f22]) ).
fof(f97,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f22]) ).
fof(f99,plain,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
inference(cnf_transformation,[],[f23]) ).
fof(f103,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f63]) ).
tcf(c_51,plain,
! [X0: $i] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f65]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f66]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( sdtpldt0(X0,X1) = sdtpldt0(X1,X0) )
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_67,plain,
! [X0: $i] :
( ( sdtasdt0(sz00,X0) = sz00 )
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] :
( ( X1 = sz00 )
| ( X0 = sz00 )
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( sdtasdt0(X0,X1) != sz00 ) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( aInteger0(sK0(X1,X0))
| ~ aInteger0(X1)
| ~ aDivisorOf0(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(X0,sK0(X1,X0)) = X1 )
| ~ aInteger0(X1)
| ~ aDivisorOf0(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i,X2: $i] :
( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ( X2 = sz00 )
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2) ),
inference(cnf_transformation,[],[f90]) ).
tcf(c_81,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f97]) ).
tcf(c_82,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f96]) ).
tcf(c_83,plain,
sz00 != xq,
inference(cnf_transformation,[],[f95]) ).
tcf(c_84,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f94]) ).
tcf(c_86,plain,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
inference(cnf_transformation,[],[f99]) ).
tcf(c_89,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtpldt0(xb,smndt0(xc)) != sdtasdt0(xq,X0) ) ),
inference(cnf_transformation,[],[f103]) ).
tcf(c_92,plain,
( ( sdtasdt0(sz00,sz00) = sz00 )
| ~ aInteger0(sz00) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_107,plain,
( ( sz00 = sz00 )
| ~ aInteger0(sz00)
| ( sdtasdt0(sz00,sz00) != sz00 ) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_517,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_519,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_524,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( aDivisorOf0(X0,X2)
| ~ aDivisorOf0(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1049,plain,
! [X0: $i,X1: $i] :
( ( sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,X1) )
| ( sdtasdt0(xq,X1) != X0 )
| ( sdtpldt0(xb,smndt0(xc)) != X0 ) ),
inference(instantiation,[status(thm)],[c_519]) ).
tcf(c_1058,plain,
! [X0: $i] :
( ( sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK0(X0,xq)) )
| ( sdtpldt0(xb,smndt0(xc)) != X0 )
| ( sdtasdt0(xq,sK0(X0,xq)) != X0 ) ),
inference(instantiation,[status(thm)],[c_1049]) ).
tcf(c_1110,plain,
( ( sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,sK0(sdtpldt0(smndt0(xc),xb),xq)) )
| ( sdtpldt0(xb,smndt0(xc)) != sdtpldt0(smndt0(xc),xb) )
| ( sdtasdt0(xq,sK0(sdtpldt0(smndt0(xc),xb),xq)) != sdtpldt0(smndt0(xc),xb) ) ),
inference(instantiation,[status(thm)],[c_1058]) ).
tcf(c_1172,plain,
( ~ aInteger0(sK0(sdtpldt0(smndt0(xc),xb),xq))
| ( sdtpldt0(xb,smndt0(xc)) != sdtasdt0(xq,sK0(sdtpldt0(smndt0(xc),xb),xq)) ) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_1195,plain,
( ( sdtpldt0(xb,smndt0(xc)) = sdtpldt0(smndt0(xc),xb) )
| ~ aInteger0(xb)
| ~ aInteger0(smndt0(xc)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_1209,plain,
! [X0: $i,X1: $i] :
( ( X0 = xq )
| ( xq != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_519]) ).
tcf(c_1210,plain,
( ( sz00 = xq )
| ( xq != sz00 )
| ( sz00 != sz00 ) ),
inference(instantiation,[status(thm)],[c_1209]) ).
tcf(c_1239,plain,
! [X0: $i] :
( ( sdtasdt0(xq,sK0(X0,xq)) = X0 )
| ~ aInteger0(X0)
| ~ aDivisorOf0(xq,X0) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_1289,plain,
xq = xq,
inference(instantiation,[status(thm)],[c_517]) ).
tcf(c_1295,plain,
( aInteger0(sK0(sdtpldt0(smndt0(xc),xb),xq))
| ~ aInteger0(sdtpldt0(smndt0(xc),xb))
| ~ aDivisorOf0(xq,sdtpldt0(smndt0(xc),xb)) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_1308,plain,
( aInteger0(smndt0(xc))
| ~ aInteger0(xc) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_1315,plain,
! [X0: $i,X1: $i,X2: $i] :
( aDivisorOf0(xq,X0)
| ~ aDivisorOf0(X2,X1)
| ( xq != X2 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_524]) ).
tcf(c_1349,plain,
! [X0: $i,X1: $i] :
( aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1)))
| ( xq = sz00 )
| ~ aInteger0(xq)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ sdteqdtlpzmzozddtrp0(X0,X1,xq) ),
inference(instantiation,[status(thm)],[c_77]) ).
tcf(c_1633,plain,
( aInteger0(sdtpldt0(smndt0(xc),xb))
| ~ aInteger0(xb)
| ~ aInteger0(smndt0(xc)) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_1807,plain,
( ( sdtpldt0(smndt0(xc),xb) = sdtpldt0(xb,smndt0(xc)) )
| ~ aInteger0(xb)
| ~ aInteger0(smndt0(xc)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_2424,plain,
! [X0: $i,X1: $i,X2: $i] :
( aDivisorOf0(xq,X0)
| ~ aDivisorOf0(xq,sdtpldt0(X1,smndt0(X2)))
| ( xq != xq )
| ( X0 != sdtpldt0(X1,smndt0(X2)) ) ),
inference(instantiation,[status(thm)],[c_1315]) ).
tcf(c_4396,plain,
( aDivisorOf0(xq,sdtpldt0(smndt0(xc),xb))
| ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
| ( xq != xq )
| ( sdtpldt0(smndt0(xc),xb) != sdtpldt0(xb,smndt0(xc)) ) ),
inference(instantiation,[status(thm)],[c_2424]) ).
tcf(c_4977,plain,
( ( sdtasdt0(xq,sK0(sdtpldt0(smndt0(xc),xb),xq)) = sdtpldt0(smndt0(xc),xb) )
| ~ aInteger0(sdtpldt0(smndt0(xc),xb))
| ~ aDivisorOf0(xq,sdtpldt0(smndt0(xc),xb)) ),
inference(instantiation,[status(thm)],[c_1239]) ).
tcf(c_7259,plain,
( aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
| ( xq = sz00 )
| ~ aInteger0(xc)
| ~ aInteger0(xq)
| ~ aInteger0(xb)
| ~ sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
inference(instantiation,[status(thm)],[c_1349]) ).
tcf(c_7260,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7259,c_4977,c_4396,c_1807,c_1633,c_1308,c_1295,c_1289,c_1210,c_1195,c_1172,c_1110,c_107,c_92,c_83,c_86,c_49,c_81,c_82,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM430+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.36 % Computer : n020.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Thu Sep 24 03:56:48 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 3.71/1.18 % SZS status Started for theBenchmark.p
% 3.71/1.18 % SZS status Theorem for theBenchmark.p
% 3.71/1.18
% 3.71/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.71/1.18
% 3.71/1.18 % ------ iProver source info
% 3.71/1.18
% 3.71/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.71/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.71/1.18 % git: non_committed_changes: false
% 3.71/1.18
% 3.71/1.18 % ------ Parsing...
% 3.71/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.71/1.18
% 3.71/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.71/1.18
% 3.71/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.71/1.18
% 3.71/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.71/1.18 % ------ Proving...
% 3.71/1.18 % ------ Problem Properties
% 3.71/1.18
% 3.71/1.18 %
% 3.71/1.18 % clauses 41
% 3.71/1.18 % conjectures 1
% 3.71/1.18 % EPR 14
% 3.71/1.18 % Horn 35
% 3.71/1.18 % unary 11
% 3.71/1.18 % binary 13
% 3.71/1.18 % lits 105
% 3.71/1.18 % lits eq 28
% 3.71/1.18 % fd_pure 0
% 3.71/1.18 % fd_pseudo 0
% 3.71/1.18 % fd_cond 6
% 3.71/1.18 % fd_pseudo_cond 0
% 3.71/1.18 % AC symbols 0
% 3.71/1.18
% 3.71/1.18 % ------ Input Options Time Limit: Unbounded
% 3.71/1.18
% 3.71/1.18
% 3.71/1.18 % ------
% 3.71/1.18 % Current options:
% 3.71/1.18 % ------
% 3.71/1.18
% 3.71/1.18
% 3.71/1.18 %
% 3.71/1.18
% 3.71/1.18 % ------ Proving...
% 3.71/1.18 %
% 3.71/1.18
% 3.71/1.18 % SZS status Theorem for theBenchmark.p
% 3.71/1.18
% 3.71/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.71/1.18
% 3.71/1.18
%------------------------------------------------------------------------------