%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM434+1 : 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 : 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:14 PM UTC 2026
% Result : Theorem 2.97s 6.74s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 82 ( 20 unt; 0 def)
% Number of atoms : 267 ( 85 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 325 ( 140 ~; 134 |; 38 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 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 : 96 ( 0 sgn 89 !; 7 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntZero) ).
fof(f4,axiom,
! [X0] :
( aInteger0(X0)
=> aInteger0(smndt0(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).
fof(f5,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
fof(f15,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulZero) ).
fof(f17,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> ( sdtasdt0(X0,X1) = sz00
=> ( X1 = sz00
| X0 = sz00 ) ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',mEquMod) ).
fof(f23,axiom,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__979) ).
fof(f24,axiom,
sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1003) ).
fof(f25,conjecture,
? [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f26,negated_conjecture,
~ ? [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb))
& 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(f31,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(ennf_transformation,[],[f6]) ).
fof(f32,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(flattening,[],[f31]) ).
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(f59,plain,
! [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f60,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(f61,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,[],[f60]) ).
fof(f62,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,[],[f61]) ).
fof(f63,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))],[f62]) ).
fof(f64,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(f65,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f67,plain,
! [X0] :
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f68,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f30]) ).
fof(f69,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f32]) ).
fof(f82,plain,
! [X0] :
( ~ aInteger0(X0)
| sz00 = sdtasdt0(sz00,X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f86,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| sz00 = X1
| sz00 = X0 ),
inference(cnf_transformation,[],[f49]) ).
fof(f87,plain,
! [X0,X1] :
( ~ aInteger0(X0)
| ~ aDivisorOf0(X1,X0)
| sdtasdt0(X1,sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f63]) ).
fof(f88,plain,
! [X0,X1] :
( ~ aInteger0(X0)
| ~ aDivisorOf0(X1,X0)
| aInteger0(sK0(X0,X1)) ),
inference(cnf_transformation,[],[f63]) ).
fof(f92,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,[],[f64]) ).
fof(f97,plain,
sz00 != xq,
inference(cnf_transformation,[],[f23]) ).
fof(f98,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f23]) ).
fof(f99,plain,
sz00 != xp,
inference(cnf_transformation,[],[f23]) ).
fof(f100,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f23]) ).
fof(f101,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f23]) ).
fof(f102,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f23]) ).
fof(f103,plain,
sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)),
inference(cnf_transformation,[],[f24]) ).
fof(f104,plain,
! [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f65]) ).
tcf(c_51,plain,
! [X0: $i] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f67]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_67,plain,
! [X0: $i] :
( ( sdtasdt0(sz00,X0) = sz00 )
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] :
( ( X1 = sz00 )
| ( X0 = sz00 )
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( sdtasdt0(X0,X1) != sz00 ) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( aInteger0(sK0(X1,X0))
| ~ aInteger0(X1)
| ~ aDivisorOf0(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(X0,sK0(X1,X0)) = X1 )
| ~ aInteger0(X1)
| ~ aDivisorOf0(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
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,[],[f92]) ).
tcf(c_81,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f102]) ).
tcf(c_82,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f101]) ).
tcf(c_83,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f100]) ).
tcf(c_84,plain,
sz00 != xp,
inference(cnf_transformation,[],[f99]) ).
tcf(c_85,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f98]) ).
tcf(c_86,plain,
sz00 != xq,
inference(cnf_transformation,[],[f97]) ).
tcf(c_87,plain,
sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)),
inference(cnf_transformation,[],[f103]) ).
tcf(c_88,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb)) ) ),
inference(cnf_transformation,[],[f104]) ).
tcf(c_91,plain,
( ( sdtasdt0(sz00,sz00) = sz00 )
| ~ aInteger0(sz00) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_106,plain,
( ( sz00 = sz00 )
| ~ aInteger0(sz00)
| ( sdtasdt0(sz00,sz00) != sz00 ) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_530,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1088,plain,
! [X0: $i] :
( ( sz00 = xp )
| ( xp != X0 )
| ( sz00 != X0 ) ),
inference(instantiation,[status(thm)],[c_530]) ).
tcf(c_1089,plain,
( ( sz00 = xp )
| ( xp != sz00 )
| ( sz00 != sz00 ) ),
inference(instantiation,[status(thm)],[c_1088]) ).
tcf(c_1090,plain,
! [X0: $i] :
( ( sz00 = xq )
| ( xq != X0 )
| ( sz00 != X0 ) ),
inference(instantiation,[status(thm)],[c_530]) ).
tcf(c_1091,plain,
( ( sz00 = xq )
| ( xq != sz00 )
| ( sz00 != sz00 ) ),
inference(instantiation,[status(thm)],[c_1090]) ).
tcf(c_1191,plain,
! [X0: $i] :
( ( xq = sz00 )
| ( X0 = sz00 )
| ~ aInteger0(xq)
| ~ aInteger0(X0)
| ( sdtasdt0(X0,xq) != sz00 ) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_1211,plain,
( aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(xa)
| ~ aInteger0(smndt0(xb)) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_1289,plain,
( ( xq = sz00 )
| ( xp = sz00 )
| ~ aInteger0(xq)
| ~ aInteger0(xp)
| ( sdtasdt0(xp,xq) != sz00 ) ),
inference(instantiation,[status(thm)],[c_1191]) ).
tcf(c_2897,plain,
( aInteger0(smndt0(xb))
| ~ aInteger0(xb) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_3496,plain,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sK0(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq))) ),
inference(resolution,[status(thm)],[c_75,c_88]) ).
tcf(c_4222,plain,
( aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(xq)
| ~ aInteger0(xp) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_6200,plain,
( ~ aInteger0(sK0(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq)))
| ~ aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))) ),
inference(global_subsumption_just,[status(thm)],[c_3496,c_82,c_81,c_1211,c_2897,c_3496]) ).
tcf(c_6201,plain,
( ~ aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sK0(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq))) ),
inference(renaming,[status(thm)],[c_6200]) ).
tcf(c_8345,plain,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))) ),
inference(resolution,[status(thm)],[c_6201,c_74]) ).
tcf(c_8346,plain,
~ aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))),
inference(global_subsumption_just,[status(thm)],[c_8345,c_82,c_81,c_1211,c_2897,c_8345]) ).
tcf(c_8369,plain,
( ( sdtasdt0(xp,xq) = sz00 )
| ~ aInteger0(xb)
| ~ aInteger0(xa)
| ~ aInteger0(sdtasdt0(xp,xq))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(resolution,[status(thm)],[c_8346,c_77]) ).
tcf(c_8370,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8369,c_4222,c_1289,c_1091,c_1089,c_106,c_91,c_87,c_84,c_86,c_49,c_81,c_82,c_83,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM434+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/5.37 % Computer : n020.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Thu Sep 24 03:58:24 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.41 Running first-order theorem proving
% 0.13/5.41 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/5.42
% 0.13/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.42
% 0.13/5.42 % Detected problem language: tptp
% 0.13/5.43 % Proving...
% 2.97/6.74 % SZS status Started for theBenchmark.p
% 2.97/6.74 % SZS status Theorem for theBenchmark.p
% 2.97/6.74
% 2.97/6.74 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.97/6.74
% 2.97/6.74 % ------ iProver source info
% 2.97/6.74
% 2.97/6.74 % git: date: 2026-07-19 20:42:38 +0200
% 2.97/6.74 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.97/6.74 % git: non_committed_changes: false
% 2.97/6.74
% 2.97/6.74 % ------ Parsing...
% 2.97/6.74 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.97/6.74
% 2.97/6.74 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.97/6.74
% 2.97/6.74 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.97/6.74
% 2.97/6.74 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.97/6.74 % ------ Proving...
% 2.97/6.74 % ------ Problem Properties
% 2.97/6.74
% 2.97/6.74 %
% 2.97/6.74 % clauses 40
% 2.97/6.74 % conjectures 1
% 2.97/6.74 % EPR 13
% 2.97/6.74 % Horn 33
% 2.97/6.74 % unary 9
% 2.97/6.74 % binary 13
% 2.97/6.74 % lits 111
% 2.97/6.74 % lits eq 29
% 2.97/6.74 % fd_pure 0
% 2.97/6.74 % fd_pseudo 0
% 2.97/6.74 % fd_cond 7
% 2.97/6.74 % fd_pseudo_cond 0
% 2.97/6.74 % AC symbols 0
% 2.97/6.74
% 2.97/6.74 % ------ Input Options Time Limit: Unbounded
% 2.97/6.74
% 2.97/6.74
% 2.97/6.74 % ------
% 2.97/6.74 % Current options:
% 2.97/6.74 % ------
% 2.97/6.74
% 2.97/6.74
% 2.97/6.74 %
% 2.97/6.74
% 2.97/6.74 % ------ Proving...
% 2.97/6.74 %
% 2.97/6.74
% 2.97/6.74 % SZS status Theorem for theBenchmark.p
% 2.97/6.74
% 2.97/6.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.97/6.74
% 2.97/6.74
%------------------------------------------------------------------------------