%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM425+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 : n011.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:12 PM UTC 2026
% Result : Theorem 0.87s 1.18s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 76 ( 23 unt; 2 def)
% Number of atoms : 259 ( 80 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 283 ( 118 ~; 118 |; 35 &)
% ( 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 : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 81 !; 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(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(f21,axiom,
( xq != sz00
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__704) ).
fof(f22,axiom,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__724) ).
fof(f23,conjecture,
? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f24,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f26,plain,
! [X0] :
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f27,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f28,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(flattening,[],[f27]) ).
fof(f44,plain,
! [X0] :
( ~ aInteger0(X0)
| ( sz00 = sdtasdt0(sz00,X0)
& sdtasdt0(X0,sz00) = sz00 ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f46,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| X1 = sz00
| X0 = sz00 ),
inference(ennf_transformation,[],[f17]) ).
fof(f47,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| X1 = sz00
| X0 = sz00 ),
inference(flattening,[],[f46]) ).
fof(f48,plain,
! [X0] :
( ~ aInteger0(X0)
| ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& X1 != sz00
& aInteger0(X1) ) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f49,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(f50,plain,
! [X0,X1,X2] :
( sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
inference(flattening,[],[f49]) ).
fof(f53,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f54,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,[],[f48]) ).
fof(f55,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,[],[f54]) ).
fof(f56,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,[],[f55]) ).
fof(f57,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))],[f56]) ).
fof(f58,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,[],[f50]) ).
fof(f59,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f61,plain,
! [X0] :
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(cnf_transformation,[],[f26]) ).
fof(f62,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f76,plain,
! [X0] :
( ~ aInteger0(X0)
| sz00 = sdtasdt0(sz00,X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f80,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| sz00 = X1
| sz00 = X0 ),
inference(cnf_transformation,[],[f47]) ).
fof(f81,plain,
! [X0,X1] :
( ~ aInteger0(X0)
| ~ aDivisorOf0(X1,X0)
| sdtasdt0(X1,sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f57]) ).
fof(f82,plain,
! [X0,X1] :
( ~ aInteger0(X0)
| ~ aDivisorOf0(X1,X0)
| aInteger0(sK0(X0,X1)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f86,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,[],[f58]) ).
fof(f89,plain,
sz00 != xq,
inference(cnf_transformation,[],[f21]) ).
fof(f90,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f21]) ).
fof(f91,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f21]) ).
fof(f92,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f21]) ).
fof(f93,plain,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(cnf_transformation,[],[f22]) ).
fof(f94,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f59]) ).
tcf(c_51,plain,
! [X0: $i] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_67,plain,
! [X0: $i] :
( ( sdtasdt0(sz00,X0) = sz00 )
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] :
( ( X1 = sz00 )
| ( X0 = sz00 )
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( sdtasdt0(X0,X1) != sz00 ) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( aInteger0(sK0(X1,X0))
| ~ aInteger0(X1)
| ~ aDivisorOf0(X0,X1) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(X0,sK0(X1,X0)) = X1 )
| ~ aInteger0(X1)
| ~ aDivisorOf0(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
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,[],[f86]) ).
tcf(c_79,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f92]) ).
tcf(c_80,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f91]) ).
tcf(c_81,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f90]) ).
tcf(c_82,plain,
sz00 != xq,
inference(cnf_transformation,[],[f89]) ).
tcf(c_83,plain,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(cnf_transformation,[],[f93]) ).
tcf(c_84,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0) ) ),
inference(cnf_transformation,[],[f94]) ).
tcf(c_87,plain,
( ( sdtasdt0(sz00,sz00) = sz00 )
| ~ aInteger0(sz00) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_102,plain,
( ( sz00 = sz00 )
| ~ aInteger0(sz00)
| ( sdtasdt0(sz00,sz00) != sz00 ) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_501,plain,
! [X0: $i,X1: $i,X2: $i] :
( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ( X2 = sz00 )
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ( X2 != xq )
| ( X1 != xb )
| ( X0 != xa ) ),
inference(resolution_lifted,[status(thm)],[c_77,c_83]) ).
tcf(c_502,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ( xq = sz00 )
| ~ aInteger0(xq)
| ~ aInteger0(xb)
| ~ aInteger0(xa) ),
inference(unflattening,[status(thm)],[c_501]) ).
tcf(c_503,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ( xq = sz00 ) ),
inference(global_subsumption_just,[status(thm)],[c_502,c_81,c_80,c_79,c_502]) ).
tcf(c_1093,definition,
iPr_def_10 = smndt0(xb),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1094,definition,
iPr_def_11 = sdtpldt0(xa,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1095,negated_conjecture,
! [X0: $i] :
( ~ aInteger0(X0)
| ( iPr_def_11 != sdtasdt0(xq,X0) ) ),
inference(demodulation,[status(thm)],[c_84,c_1093,c_1094]) ).
tcf(c_1098,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1538,plain,
( aInteger0(iPr_def_10)
| ~ aInteger0(xb) ),
inference(superposition,[status(thm)],[c_1093,c_51]) ).
tcf(c_1539,plain,
aInteger0(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_1538,c_80]) ).
tcf(c_1629,plain,
! [X0: $i] :
( ( sz00 = xq )
| ( xq != X0 )
| ( sz00 != X0 ) ),
inference(instantiation,[status(thm)],[c_1098]) ).
tcf(c_1630,plain,
( ( sz00 = xq )
| ( xq != sz00 )
| ( sz00 != sz00 ) ),
inference(instantiation,[status(thm)],[c_1629]) ).
tcf(c_1674,plain,
( aInteger0(iPr_def_11)
| ~ aInteger0(iPr_def_10)
| ~ aInteger0(xa) ),
inference(superposition,[status(thm)],[c_1094,c_52]) ).
tcf(c_1692,plain,
aInteger0(iPr_def_11),
inference(forward_subsumption_resolution,[status(thm)],[c_1674,c_1539,c_79]) ).
tcf(c_3788,plain,
aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
inference(global_subsumption_just,[status(thm)],[c_503,c_49,c_82,c_87,c_102,c_503,c_1630]) ).
tcf(c_3790,plain,
aDivisorOf0(xq,iPr_def_11),
inference(light_normalisation,[status(thm)],[c_3788,c_1093,c_1094]) ).
tcf(c_3791,plain,
( ( sdtasdt0(xq,sK0(iPr_def_11,xq)) = iPr_def_11 )
| ~ aInteger0(iPr_def_11) ),
inference(superposition,[status(thm)],[c_3790,c_75]) ).
tcf(c_3793,plain,
sdtasdt0(xq,sK0(iPr_def_11,xq)) = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_3791,c_1692]) ).
tcf(c_3809,plain,
~ aInteger0(sK0(iPr_def_11,xq)),
inference(superposition,[status(thm)],[c_3793,c_1095]) ).
tcf(c_3810,plain,
( ~ aInteger0(iPr_def_11)
| ~ aDivisorOf0(xq,iPr_def_11) ),
inference(superposition,[status(thm)],[c_74,c_3809]) ).
tcf(c_3811,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3810,c_1692,c_3790]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM425+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.08/0.37 % Computer : n011.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Thu Sep 24 03:54:28 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.08/0.42
% 0.08/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42
% 0.08/0.42 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 0.87/1.18 % SZS status Started for theBenchmark.p
% 0.87/1.18 % SZS status Theorem for theBenchmark.p
% 0.87/1.18
% 0.87/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.87/1.18
% 0.87/1.18 % ------ iProver source info
% 0.87/1.18
% 0.87/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 0.87/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.87/1.18 % git: non_committed_changes: false
% 0.87/1.18
% 0.87/1.18 % ------ Parsing...
% 0.87/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.87/1.18
% 0.87/1.18 % ------ 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 %
% 0.87/1.18
% 0.87/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.87/1.18
% 0.87/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.87/1.18 % ------ Proving...
% 0.87/1.18 % ------ Problem Properties
% 0.87/1.18
% 0.87/1.18 %
% 0.87/1.18 % clauses 36
% 0.87/1.18 % conjectures 1
% 0.87/1.18 % EPR 8
% 0.87/1.18 % Horn 32
% 0.87/1.18 % unary 8
% 0.87/1.18 % binary 14
% 0.87/1.18 % lits 86
% 0.87/1.18 % lits eq 27
% 0.87/1.18 % fd_pure 0
% 0.87/1.18 % fd_pseudo 0
% 0.87/1.18 % fd_cond 3
% 0.87/1.18 % fd_pseudo_cond 0
% 0.87/1.18 % AC symbols 0
% 0.87/1.18
% 0.87/1.18 % ------ Schedule dynamic 5 is on
% 0.87/1.18
% 0.87/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.87/1.18
% 0.87/1.18
% 0.87/1.18 % ------
% 0.87/1.18 % Current options:
% 0.87/1.18 % ------
% 0.87/1.18
% 0.87/1.18
% 0.87/1.18 %
% 0.87/1.18
% 0.87/1.18 % ------ Proving...
% 0.87/1.18 %
% 0.87/1.18
% 0.87/1.18 % SZS status Theorem for theBenchmark.p
% 0.87/1.18
% 0.87/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.87/1.18
%------------------------------------------------------------------------------