%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM432+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 : n017.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 0.81s 1.21s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 75 ( 25 unt; 0 def)
% Number of atoms : 252 ( 75 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 300 ( 123 ~; 128 |; 37 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 83 !; 5 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntZero) ).
fof(f5,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
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(f24,axiom,
( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__876) ).
fof(f25,axiom,
( sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc))
& aInteger0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__899) ).
fof(f26,axiom,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__924) ).
fof(f27,conjecture,
sdteqdtlpzmzozddtrp0(xa,xc,xq),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f30,plain,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(flattening,[],[f28]) ).
fof(f32,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f33,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(ennf_transformation,[],[f6]) ).
fof(f35,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(flattening,[],[f34]) ).
fof(f49,plain,
! [X0] :
( ~ aInteger0(X0)
| ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f51,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| X1 = sz00
| X0 = sz00 ),
inference(ennf_transformation,[],[f17]) ).
fof(f52,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| X1 = sz00
| X0 = sz00 ),
inference(flattening,[],[f51]) ).
fof(f53,plain,
! [X0] :
( ~ aInteger0(X0)
| ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& X1 != sz00
& aInteger0(X1) ) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f54,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(f55,plain,
! [X0,X1,X2] :
( sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
inference(flattening,[],[f54]) ).
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,[],[f53]) ).
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,[],[f55]) ).
fof(f65,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f68,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f33]) ).
fof(f69,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f35]) ).
fof(f82,plain,
! [X0] :
( ~ aInteger0(X0)
| sz00 = sdtasdt0(sz00,X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f86,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| sz00 = X1
| sz00 = X0 ),
inference(cnf_transformation,[],[f52]) ).
fof(f91,plain,
! [X2,X0,X1] :
( ~ aInteger0(X0)
| sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2)
| sz00 = X1
| ~ aInteger0(X1)
| aDivisorOf0(X1,X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f93,plain,
! [X2,X0,X1] :
( sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| sdteqdtlpzmzozddtrp0(X0,X1,X2) ),
inference(cnf_transformation,[],[f64]) ).
fof(f96,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f22]) ).
fof(f97,plain,
sz00 != xq,
inference(cnf_transformation,[],[f22]) ).
fof(f98,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f22]) ).
fof(f100,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f22]) ).
fof(f104,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f24]) ).
fof(f106,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f107,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(cnf_transformation,[],[f26]) ).
fof(f108,plain,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(cnf_transformation,[],[f30]) ).
fof(f109,plain,
! [X2,X1] :
( ~ aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| sz00 = X1
| ~ aInteger0(X1)
| aDivisorOf0(X1,sdtasdt0(X1,X2)) ),
inference(equality_resolution,[],[f91]) ).
tcf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f65]) ).
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_71,plain,
! [X0: $i,X1: $i] :
( aDivisorOf0(X0,sdtasdt0(X0,X1))
| ( X0 = sz00 )
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ aInteger0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i] :
( sdteqdtlpzmzozddtrp0(X1,X2,X0)
| ( X0 = sz00 )
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ aDivisorOf0(X0,sdtpldt0(X1,smndt0(X2))) ),
inference(cnf_transformation,[],[f93]) ).
tcf(c_80,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f100]) ).
tcf(c_82,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f98]) ).
tcf(c_83,plain,
sz00 != xq,
inference(cnf_transformation,[],[f97]) ).
tcf(c_84,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f96]) ).
tcf(c_87,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f104]) ).
tcf(c_89,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f106]) ).
tcf(c_91,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(cnf_transformation,[],[f107]) ).
tcf(c_92,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(cnf_transformation,[],[f108]) ).
tcf(c_95,plain,
( ( sdtasdt0(sz00,sz00) = sz00 )
| ~ aInteger0(sz00) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_109,plain,
( ( sz00 = sz00 )
| ~ aInteger0(sz00)
| ( sdtasdt0(sz00,sz00) != sz00 ) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i] :
( aDivisorOf0(X0,sdtasdt0(X0,X1))
| ( X0 = sz00 )
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(global_subsumption_just,[status(thm)],[c_71,c_53,c_71]) ).
tcf(c_708,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1350,plain,
! [X0: $i] :
( ( sz00 = xq )
| ( xq != X0 )
| ( sz00 != X0 ) ),
inference(instantiation,[status(thm)],[c_708]) ).
tcf(c_1351,plain,
( ( sz00 = xq )
| ( xq != sz00 )
| ( sz00 != sz00 ) ),
inference(instantiation,[status(thm)],[c_1350]) ).
tcf(c_1355,plain,
! [X0: $i,X1: $i] :
( sdteqdtlpzmzozddtrp0(X0,X1,xq)
| ( xq = sz00 )
| ~ aInteger0(xq)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1))) ),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_1531,plain,
( aInteger0(sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(xq)
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(superposition,[status(thm)],[c_91,c_53]) ).
tcf(c_1532,plain,
( aInteger0(sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1531,c_82]) ).
tcf(c_1923,plain,
( sdteqdtlpzmzozddtrp0(xa,xc,xq)
| ( xq = sz00 )
| ~ aInteger0(xc)
| ~ aInteger0(xq)
| ~ aInteger0(xa)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))) ),
inference(instantiation,[status(thm)],[c_1355]) ).
tcf(c_1963,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ( sz00 = xq )
| ~ aInteger0(xq)
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(superposition,[status(thm)],[c_91,c_115]) ).
tcf(c_2056,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1963,c_83,c_82]) ).
tcf(c_5215,plain,
~ aInteger0(sdtpldt0(xn,xm)),
inference(global_subsumption_just,[status(thm)],[c_1532,c_84,c_82,c_80,c_49,c_92,c_83,c_95,c_109,c_1351,c_1923,c_2056]) ).
tcf(c_5217,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xn) ),
inference(superposition,[status(thm)],[c_52,c_5215]) ).
tcf(c_5218,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5217,c_89,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM432+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.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 03:52:01 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 0.81/1.21 % SZS status Started for theBenchmark.p
% 0.81/1.21 % SZS status Theorem for theBenchmark.p
% 0.81/1.21
% 0.81/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.81/1.21
% 0.81/1.21 % ------ iProver source info
% 0.81/1.21
% 0.81/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 0.81/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.81/1.21 % git: non_committed_changes: false
% 0.81/1.21
% 0.81/1.21 % ------ Parsing...
% 0.81/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.81/1.21
% 0.81/1.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.81/1.21
% 0.81/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.81/1.21
% 0.81/1.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.81/1.21 % ------ Proving...
% 0.81/1.21 % ------ Problem Properties
% 0.81/1.21
% 0.81/1.21 %
% 0.81/1.21 % clauses 44
% 0.81/1.21 % conjectures 1
% 0.81/1.21 % EPR 16
% 0.81/1.21 % Horn 38
% 0.81/1.21 % unary 15
% 0.81/1.21 % binary 12
% 0.81/1.21 % lits 107
% 0.81/1.21 % lits eq 29
% 0.81/1.22 % fd_pure 0
% 0.81/1.22 % fd_pseudo 0
% 0.81/1.22 % fd_cond 6
% 0.81/1.22 % fd_pseudo_cond 0
% 0.81/1.22 % AC symbols 0
% 0.81/1.22
% 0.81/1.22 % ------ Schedule dynamic 5 is on
% 0.81/1.22
% 0.81/1.22 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.81/1.22
% 0.81/1.22
% 0.81/1.22 % ------
% 0.81/1.22 % Current options:
% 0.81/1.22 % ------
% 0.81/1.22
% 0.81/1.22
% 0.81/1.22 %
% 0.81/1.22
% 0.81/1.22 % ------ Proving...
% 0.81/1.22 %
% 0.81/1.22
% 0.81/1.22 % SZS status Theorem for theBenchmark.p
% 0.81/1.22
% 0.81/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.81/1.22
% 0.81/1.22
%------------------------------------------------------------------------------