TSTP Solution File: NUM529+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM529+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:49:45 EDT 2024
% Result : Theorem 7.93s 1.65s
% Output : CNFRefutation 7.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 82 ( 35 unt; 0 def)
% Number of atoms : 315 ( 140 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 396 ( 163 ~; 195 |; 26 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(f12,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).
fof(f29,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( sdtlseqdt0(X0,X1)
& X0 != X1 )
=> iLess0(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIH_03) ).
fof(f31,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( doDivides0(X0,X1)
& sz00 != X0 )
=> ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefQuot) ).
fof(f40,axiom,
( sz00 != xp
& sz00 != xm
& sz00 != xn
& aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2987) ).
fof(f41,axiom,
! [X0,X1,X2] :
( ( sz00 != X2
& sz00 != X1
& sz00 != X0
& aNaturalNumber0(X2)
& aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( sdtasdt0(X2,sdtasdt0(X1,X1)) = sdtasdt0(X0,X0)
=> ( iLess0(X0,xn)
=> ~ isPrime0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2963) ).
fof(f43,axiom,
isPrime0(xp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3025) ).
fof(f44,axiom,
( doDivides0(xp,xn)
& doDivides0(xp,sdtasdt0(xn,xn)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3046) ).
fof(f45,axiom,
xq = sdtsldt0(xn,xp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3059) ).
fof(f46,axiom,
sdtasdt0(xm,xm) = sdtasdt0(xp,sdtasdt0(xq,xq)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3082) ).
fof(f47,axiom,
( sdtlseqdt0(xm,xn)
& xn != xm ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3124) ).
fof(f62,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f63,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f62]) ).
fof(f67,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f97,plain,
! [X0,X1] :
( iLess0(X0,X1)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f98,plain,
! [X0,X1] :
( iLess0(X0,X1)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f97]) ).
fof(f101,plain,
! [X0,X1] :
( ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f102,plain,
! [X0,X1] :
( ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f101]) ).
fof(f119,plain,
! [X0,X1,X2] :
( ~ isPrime0(X2)
| ~ iLess0(X0,xn)
| sdtasdt0(X2,sdtasdt0(X1,X1)) != sdtasdt0(X0,X0)
| sz00 = X2
| sz00 = X1
| sz00 = X0
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f120,plain,
! [X0,X1,X2] :
( ~ isPrime0(X2)
| ~ iLess0(X0,xn)
| sdtasdt0(X2,sdtasdt0(X1,X1)) != sdtasdt0(X0,X0)
| sz00 = X2
| sz00 = X1
| sz00 = X0
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f119]) ).
fof(f131,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtsldt0(X1,X0) = X2
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtsldt0(X1,X0) != X2 ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f132,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtsldt0(X1,X0) = X2
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtsldt0(X1,X0) != X2 ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f131]) ).
fof(f149,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f154,plain,
! [X0] :
( sz00 = sdtasdt0(sz00,X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f186,plain,
! [X0,X1] :
( iLess0(X0,X1)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f190,plain,
! [X2,X0,X1] :
( aNaturalNumber0(X2)
| sdtsldt0(X1,X0) != X2
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f191,plain,
! [X2,X0,X1] :
( sdtasdt0(X0,X2) = X1
| sdtsldt0(X1,X0) != X2
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f209,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f40]) ).
fof(f210,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f40]) ).
fof(f211,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f40]) ).
fof(f212,plain,
sz00 != xn,
inference(cnf_transformation,[],[f40]) ).
fof(f213,plain,
sz00 != xm,
inference(cnf_transformation,[],[f40]) ).
fof(f214,plain,
sz00 != xp,
inference(cnf_transformation,[],[f40]) ).
fof(f215,plain,
! [X2,X0,X1] :
( ~ isPrime0(X2)
| ~ iLess0(X0,xn)
| sdtasdt0(X2,sdtasdt0(X1,X1)) != sdtasdt0(X0,X0)
| sz00 = X2
| sz00 = X1
| sz00 = X0
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f217,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f43]) ).
fof(f219,plain,
doDivides0(xp,xn),
inference(cnf_transformation,[],[f44]) ).
fof(f220,plain,
xq = sdtsldt0(xn,xp),
inference(cnf_transformation,[],[f45]) ).
fof(f221,plain,
sdtasdt0(xm,xm) = sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(cnf_transformation,[],[f46]) ).
fof(f222,plain,
xn != xm,
inference(cnf_transformation,[],[f47]) ).
fof(f223,plain,
sdtlseqdt0(xm,xn),
inference(cnf_transformation,[],[f47]) ).
fof(f232,plain,
! [X0,X1] :
( sdtasdt0(X0,sdtsldt0(X1,X0)) = X1
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f191]) ).
fof(f233,plain,
! [X0,X1] :
( aNaturalNumber0(sdtsldt0(X1,X0))
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f190]) ).
cnf(c_58,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_62,plain,
( ~ aNaturalNumber0(X0)
| sdtasdt0(sz00,X0) = sz00 ),
inference(cnf_transformation,[],[f154]) ).
cnf(c_94,plain,
( ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| X0 = X1
| iLess0(X0,X1) ),
inference(cnf_transformation,[],[f186]) ).
cnf(c_99,plain,
( ~ doDivides0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X0,sdtsldt0(X1,X0)) = X1
| X0 = sz00 ),
inference(cnf_transformation,[],[f232]) ).
cnf(c_100,plain,
( ~ doDivides0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| X0 = sz00
| aNaturalNumber0(sdtsldt0(X1,X0)) ),
inference(cnf_transformation,[],[f233]) ).
cnf(c_117,plain,
sz00 != xp,
inference(cnf_transformation,[],[f214]) ).
cnf(c_118,plain,
sz00 != xm,
inference(cnf_transformation,[],[f213]) ).
cnf(c_119,plain,
sz00 != xn,
inference(cnf_transformation,[],[f212]) ).
cnf(c_120,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f211]) ).
cnf(c_121,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f210]) ).
cnf(c_122,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f209]) ).
cnf(c_123,plain,
( sdtasdt0(X0,sdtasdt0(X1,X1)) != sdtasdt0(X2,X2)
| ~ iLess0(X2,xn)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ isPrime0(X0)
| X0 = sz00
| X1 = sz00
| X2 = sz00 ),
inference(cnf_transformation,[],[f215]) ).
cnf(c_125,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f217]) ).
cnf(c_126,plain,
doDivides0(xp,xn),
inference(cnf_transformation,[],[f219]) ).
cnf(c_128,plain,
sdtsldt0(xn,xp) = xq,
inference(cnf_transformation,[],[f220]) ).
cnf(c_129,plain,
sdtasdt0(xp,sdtasdt0(xq,xq)) = sdtasdt0(xm,xm),
inference(cnf_transformation,[],[f221]) ).
cnf(c_130,plain,
sdtlseqdt0(xm,xn),
inference(cnf_transformation,[],[f223]) ).
cnf(c_131,plain,
xm != xn,
inference(cnf_transformation,[],[f222]) ).
cnf(c_1292,plain,
( sdtasdt0(X0,sdtasdt0(X1,X1)) != sdtasdt0(X2,X2)
| X2 != X3
| X4 != xn
| ~ sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| ~ isPrime0(X0)
| X0 = sz00
| X1 = sz00
| X2 = sz00
| X3 = X4 ),
inference(resolution_lifted,[status(thm)],[c_94,c_123]) ).
cnf(c_1293,plain,
( sdtasdt0(X0,sdtasdt0(X1,X1)) != sdtasdt0(X2,X2)
| ~ sdtlseqdt0(X2,xn)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ isPrime0(X0)
| ~ aNaturalNumber0(xn)
| X0 = sz00
| X1 = sz00
| X2 = sz00
| X2 = xn ),
inference(unflattening,[status(thm)],[c_1292]) ).
cnf(c_1294,plain,
( ~ isPrime0(X0)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ sdtlseqdt0(X2,xn)
| sdtasdt0(X0,sdtasdt0(X1,X1)) != sdtasdt0(X2,X2)
| X0 = sz00
| X1 = sz00
| X2 = sz00
| X2 = xn ),
inference(global_subsumption_just,[status(thm)],[c_1293,c_122,c_1293]) ).
cnf(c_1295,plain,
( sdtasdt0(X0,sdtasdt0(X1,X1)) != sdtasdt0(X2,X2)
| ~ sdtlseqdt0(X2,xn)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ isPrime0(X0)
| X0 = sz00
| X1 = sz00
| X2 = sz00
| X2 = xn ),
inference(renaming,[status(thm)],[c_1294]) ).
cnf(c_5196,plain,
( ~ doDivides0(xp,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| sz00 = xp
| aNaturalNumber0(xq) ),
inference(superposition,[status(thm)],[c_128,c_100]) ).
cnf(c_5290,plain,
sdtasdt0(sz00,xp) = sz00,
inference(superposition,[status(thm)],[c_120,c_62]) ).
cnf(c_5375,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| sdtasdt0(xp,sdtsldt0(xn,xp)) = xn
| sz00 = xp ),
inference(superposition,[status(thm)],[c_126,c_99]) ).
cnf(c_5571,plain,
( ~ aNaturalNumber0(X0)
| sdtasdt0(X0,xp) = sdtasdt0(xp,X0) ),
inference(superposition,[status(thm)],[c_120,c_58]) ).
cnf(c_5613,plain,
( sdtasdt0(X0,X0) != sdtasdt0(xm,xm)
| ~ sdtlseqdt0(X0,xn)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq)
| ~ isPrime0(xp)
| X0 = sz00
| X0 = xn
| sz00 = xp
| sz00 = xq ),
inference(superposition,[status(thm)],[c_129,c_1295]) ).
cnf(c_5754,plain,
( ~ doDivides0(xp,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| sz00 = xp
| aNaturalNumber0(xq) ),
inference(superposition,[status(thm)],[c_128,c_100]) ).
cnf(c_6054,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| sdtasdt0(xp,sdtsldt0(xn,xp)) = xn
| sz00 = xp ),
inference(superposition,[status(thm)],[c_126,c_99]) ).
cnf(c_6350,plain,
( sdtasdt0(X0,X0) != sdtasdt0(xm,xm)
| ~ sdtlseqdt0(X0,xn)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq)
| ~ isPrime0(xp)
| X0 = sz00
| X0 = xn
| sz00 = xp
| sz00 = xq ),
inference(superposition,[status(thm)],[c_129,c_1295]) ).
cnf(c_8423,plain,
aNaturalNumber0(xq),
inference(global_subsumption_just,[status(thm)],[c_5754,c_122,c_120,c_126,c_117,c_5196]) ).
cnf(c_8441,plain,
sdtasdt0(xp,xq) = sdtasdt0(xq,xp),
inference(superposition,[status(thm)],[c_8423,c_5571]) ).
cnf(c_8968,plain,
( X0 = xn
| X0 = sz00
| sdtasdt0(X0,X0) != sdtasdt0(xm,xm)
| ~ sdtlseqdt0(X0,xn)
| ~ aNaturalNumber0(X0)
| sz00 = xq ),
inference(global_subsumption_just,[status(thm)],[c_5613,c_125,c_122,c_120,c_126,c_117,c_5196,c_5613]) ).
cnf(c_8969,plain,
( sdtasdt0(X0,X0) != sdtasdt0(xm,xm)
| ~ sdtlseqdt0(X0,xn)
| ~ aNaturalNumber0(X0)
| X0 = sz00
| X0 = xn
| sz00 = xq ),
inference(renaming,[status(thm)],[c_8968]) ).
cnf(c_8982,plain,
( ~ sdtlseqdt0(xm,xn)
| ~ aNaturalNumber0(xm)
| sz00 = xm
| sz00 = xq
| xm = xn ),
inference(equality_resolution,[status(thm)],[c_8969]) ).
cnf(c_10381,plain,
sdtasdt0(xp,sdtsldt0(xn,xp)) = xn,
inference(global_subsumption_just,[status(thm)],[c_6054,c_122,c_120,c_117,c_5375]) ).
cnf(c_10383,plain,
sdtasdt0(xp,xq) = xn,
inference(light_normalisation,[status(thm)],[c_10381,c_128]) ).
cnf(c_12904,plain,
sz00 = xq,
inference(global_subsumption_just,[status(thm)],[c_6350,c_121,c_130,c_131,c_118,c_8982]) ).
cnf(c_25638,plain,
sz00 = xn,
inference(light_normalisation,[status(thm)],[c_8441,c_5290,c_10383,c_12904]) ).
cnf(c_25639,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_25638,c_119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM529+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 19:32:35 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.93/1.65 % SZS status Started for theBenchmark.p
% 7.93/1.65 % SZS status Theorem for theBenchmark.p
% 7.93/1.65
% 7.93/1.65 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.93/1.65
% 7.93/1.65 ------ iProver source info
% 7.93/1.65
% 7.93/1.65 git: date: 2024-05-02 19:28:25 +0000
% 7.93/1.65 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.93/1.65 git: non_committed_changes: false
% 7.93/1.65
% 7.93/1.65 ------ Parsing...
% 7.93/1.65 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.93/1.65
% 7.93/1.65 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 7.93/1.65
% 7.93/1.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.93/1.65
% 7.93/1.65 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.93/1.65 ------ Proving...
% 7.93/1.65 ------ Problem Properties
% 7.93/1.65
% 7.93/1.65
% 7.93/1.65 clauses 77
% 7.93/1.65 conjectures 0
% 7.93/1.65 EPR 23
% 7.93/1.65 Horn 52
% 7.93/1.65 unary 19
% 7.93/1.65 binary 7
% 7.93/1.65 lits 276
% 7.93/1.65 lits eq 82
% 7.93/1.65 fd_pure 0
% 7.93/1.65 fd_pseudo 0
% 7.93/1.65 fd_cond 16
% 7.93/1.65 fd_pseudo_cond 10
% 7.93/1.65 AC symbols 0
% 7.93/1.65
% 7.93/1.65 ------ Input Options Time Limit: Unbounded
% 7.93/1.65
% 7.93/1.65
% 7.93/1.65 ------
% 7.93/1.65 Current options:
% 7.93/1.65 ------
% 7.93/1.65
% 7.93/1.65
% 7.93/1.65
% 7.93/1.65
% 7.93/1.65 ------ Proving...
% 7.93/1.65
% 7.93/1.65
% 7.93/1.65 % SZS status Theorem for theBenchmark.p
% 7.93/1.65
% 7.93/1.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.93/1.65
% 7.93/1.66
%------------------------------------------------------------------------------