%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM500+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 : n009.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:25:20 PM UTC 2026
% Result : Theorem 3.63s 1.41s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 75 ( 25 unt; 0 def)
% Number of atoms : 287 ( 106 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 351 ( 139 ~; 141 |; 59 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 61 !; 8 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(f5,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(f31,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( doDivides0(X0,X1)
& X0 != sz00 )
=> ! [X2] :
( X2 = sdtsldt0(X1,X0)
<=> ( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(f37,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( isPrime0(X0)
<=> ( ! [X1] :
( ( doDivides0(X1,X0)
& aNaturalNumber0(X1) )
=> ( X1 = X0
| X1 = sz10 ) )
& X0 != sz10
& X0 != sz00 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrime) ).
fof(f38,axiom,
! [X0] :
( ( X0 != sz10
& X0 != sz00
& aNaturalNumber0(X0) )
=> ? [X1] :
( isPrime0(X1)
& doDivides0(X1,X0)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mPrimDiv) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f41,axiom,
( doDivides0(xp,sdtasdt0(xn,xm))
& isPrime0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1860) ).
fof(f45,axiom,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2306) ).
fof(f47,axiom,
( xk != sz10
& xk != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2327) ).
fof(f48,conjecture,
? [X0] :
( isPrime0(X0)
& doDivides0(X0,xk)
& aNaturalNumber0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f49,negated_conjecture,
~ ? [X0] :
( isPrime0(X0)
& doDivides0(X0,xk)
& aNaturalNumber0(X0) ),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f54,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f55,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(flattening,[],[f54]) ).
fof(f100,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1)
| sz00 = X0
| ! [X2] :
( X2 = sdtsldt0(X1,X0)
<=> ( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f101,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1)
| sz00 = X0
| ! [X2] :
( X2 = sdtsldt0(X1,X0)
<=> ( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
inference(flattening,[],[f100]) ).
fof(f112,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( isPrime0(X0)
<=> ( ! [X1] :
( ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1)
| X1 = X0
| X1 = sz10 )
& X0 != sz10
& X0 != sz00 ) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f113,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( isPrime0(X0)
<=> ( ! [X1] :
( ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1)
| X1 = X0
| X1 = sz10 )
& X0 != sz10
& X0 != sz00 ) ) ),
inference(flattening,[],[f112]) ).
fof(f114,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| ? [X1] :
( isPrime0(X1)
& doDivides0(X1,X0)
& aNaturalNumber0(X1) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f115,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| ? [X1] :
( isPrime0(X1)
& doDivides0(X1,X0)
& aNaturalNumber0(X1) ) ),
inference(flattening,[],[f114]) ).
fof(f119,plain,
! [X0] :
( ~ isPrime0(X0)
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f128,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1)
| sz00 = X0
| ! [X2] :
( ( sdtsldt0(X1,X0) != X2
| ( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) )
& ( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| X2 = sdtsldt0(X1,X0) ) ) ),
inference(nnf_transformation,[],[f101]) ).
fof(f129,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1)
| sz00 = X0
| ! [X2] :
( ( sdtsldt0(X1,X0) != X2
| ( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) )
& ( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| X2 = sdtsldt0(X1,X0) ) ) ),
inference(flattening,[],[f128]) ).
fof(f130,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( ( ~ isPrime0(X0)
| ( ! [X1] :
( ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1)
| X1 = X0
| X1 = sz10 )
& X0 != sz10
& X0 != sz00 ) )
& ( ? [X1] :
( doDivides0(X1,X0)
& aNaturalNumber0(X1)
& X0 != X1
& sz10 != X1 )
| sz10 = X0
| sz00 = X0
| isPrime0(X0) ) ) ),
inference(nnf_transformation,[],[f113]) ).
fof(f131,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( ( ~ isPrime0(X0)
| ( ! [X1] :
( ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1)
| X1 = X0
| X1 = sz10 )
& X0 != sz10
& X0 != sz00 ) )
& ( ? [X1] :
( doDivides0(X1,X0)
& aNaturalNumber0(X1)
& X0 != X1
& sz10 != X1 )
| sz10 = X0
| sz00 = X0
| isPrime0(X0) ) ) ),
inference(flattening,[],[f130]) ).
fof(f132,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( ( ~ isPrime0(X0)
| ( ! [X2] :
( ~ doDivides0(X2,X0)
| ~ aNaturalNumber0(X2)
| X0 = X2
| sz10 = X2 )
& X0 != sz10
& X0 != sz00 ) )
& ( ? [X1] :
( doDivides0(X1,X0)
& aNaturalNumber0(X1)
& X0 != X1
& sz10 != X1 )
| sz10 = X0
| sz00 = X0
| isPrime0(X0) ) ) ),
inference(rectify,[],[f131]) ).
fof(f133,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( ( ~ isPrime0(X0)
| ( ! [X2] :
( ~ doDivides0(X2,X0)
| ~ aNaturalNumber0(X2)
| X0 = X2
| sz10 = X2 )
& X0 != sz10
& X0 != sz00 ) )
& ( ( doDivides0(sK2(X0),X0)
& aNaturalNumber0(sK2(X0))
& sK2(X0) != X0
& sz10 != sK2(X0) )
| sz10 = X0
| sz00 = X0
| isPrime0(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2(X0))],[f132]) ).
fof(f134,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| ( isPrime0(sK3(X0))
& doDivides0(sK3(X0),X0)
& aNaturalNumber0(sK3(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X1,sK3(X0))],[f115]) ).
fof(f135,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f139,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f55]) ).
fof(f186,plain,
! [X2,X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1)
| sz00 = X0
| sdtsldt0(X1,X0) != X2
| aNaturalNumber0(X2) ),
inference(cnf_transformation,[],[f129]) ).
fof(f195,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ~ isPrime0(X0)
| sz00 != X0 ),
inference(cnf_transformation,[],[f133]) ).
fof(f200,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| isPrime0(sK3(X0)) ),
inference(cnf_transformation,[],[f134]) ).
fof(f201,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| doDivides0(sK3(X0),X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f202,plain,
! [X0] :
( sz10 = X0
| sz00 = X0
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sK3(X0)) ),
inference(cnf_transformation,[],[f134]) ).
fof(f203,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f204,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f39]) ).
fof(f205,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f207,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(cnf_transformation,[],[f41]) ).
fof(f208,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f41]) ).
fof(f215,plain,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(cnf_transformation,[],[f45]) ).
fof(f218,plain,
sz10 != xk,
inference(cnf_transformation,[],[f47]) ).
fof(f219,plain,
sz00 != xk,
inference(cnf_transformation,[],[f47]) ).
fof(f220,plain,
! [X0] :
( ~ isPrime0(X0)
| ~ doDivides0(X0,xk)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f229,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1)
| sz00 = X0
| aNaturalNumber0(sdtsldt0(X1,X0)) ),
inference(equality_resolution,[],[f186]) ).
fof(f231,plain,
( ~ aNaturalNumber0(sz00)
| ~ isPrime0(sz00) ),
inference(equality_resolution,[],[f195]) ).
tcf(c_49,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f135]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] :
( aNaturalNumber0(sdtsldt0(X1,X0))
| ( X0 = sz00 )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,X1) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_110,plain,
( ~ isPrime0(sz00)
| ~ aNaturalNumber0(sz00) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_113,plain,
! [X0: $i] :
( aNaturalNumber0(sK3(X0))
| ( X0 = sz10 )
| ( X0 = sz00 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f202]) ).
tcf(c_114,plain,
! [X0: $i] :
( doDivides0(sK3(X0),X0)
| ( X0 = sz10 )
| ( X0 = sz00 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f201]) ).
tcf(c_115,plain,
! [X0: $i] :
( isPrime0(sK3(X0))
| ( X0 = sz10 )
| ( X0 = sz00 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f200]) ).
tcf(c_116,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f205]) ).
tcf(c_117,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f204]) ).
tcf(c_118,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f203]) ).
tcf(c_120,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f208]) ).
tcf(c_121,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(cnf_transformation,[],[f207]) ).
tcf(c_128,plain,
sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
inference(cnf_transformation,[],[f215]) ).
tcf(c_131,plain,
sz00 != xk,
inference(cnf_transformation,[],[f219]) ).
tcf(c_132,plain,
sz10 != xk,
inference(cnf_transformation,[],[f218]) ).
tcf(c_133,negated_conjecture,
! [X0: $i] :
( ~ isPrime0(X0)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,xk) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_179,plain,
~ isPrime0(sz00),
inference(global_subsumption_just,[status(thm)],[c_110,c_49,c_110]) ).
tcf(c_1675,plain,
sz00 != xp,
inference(resolution_lifted,[status(thm)],[c_179,c_120]) ).
tcf(c_3640,negated_conjecture,
! [X0: $i] :
( ~ isPrime0(X0)
| ~ aNaturalNumber0(X0)
| ~ doDivides0(X0,xk) ),
inference(demodulation,[status(thm)],[c_133]) ).
tcf(c_5783,plain,
( ( sz10 = xk )
| ( sz00 = xk )
| ~ aNaturalNumber0(xk)
| ~ isPrime0(sK3(xk))
| ~ aNaturalNumber0(sK3(xk)) ),
inference(superposition,[status(thm)],[c_114,c_3640]) ).
tcf(c_5784,plain,
( ~ aNaturalNumber0(xk)
| ~ isPrime0(sK3(xk))
| ~ aNaturalNumber0(sK3(xk)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5783,c_132,c_131]) ).
tcf(c_5861,plain,
( ( sz10 = xk )
| ( sz00 = xk )
| ~ aNaturalNumber0(xk)
| ~ isPrime0(sK3(xk)) ),
inference(superposition,[status(thm)],[c_113,c_5784]) ).
tcf(c_5862,plain,
( ~ aNaturalNumber0(xk)
| ~ isPrime0(sK3(xk)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5861,c_132,c_131]) ).
tcf(c_5871,plain,
( ( sz10 = xk )
| ( sz00 = xk )
| ~ aNaturalNumber0(xk) ),
inference(superposition,[status(thm)],[c_115,c_5862]) ).
tcf(c_5872,plain,
~ aNaturalNumber0(xk),
inference(forward_subsumption_resolution,[status(thm)],[c_5871,c_132,c_131]) ).
tcf(c_6784,plain,
( aNaturalNumber0(xk)
| ( sz00 = xp )
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm))
| ~ doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(superposition,[status(thm)],[c_128,c_99]) ).
tcf(c_6796,plain,
( ( sz00 = xp )
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6784,c_5872,c_118,c_121]) ).
tcf(c_7061,plain,
~ aNaturalNumber0(sdtasdt0(xn,xm)),
inference(global_subsumption_just,[status(thm)],[c_6796,c_1675,c_6796]) ).
tcf(c_7063,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(superposition,[status(thm)],[c_53,c_7061]) ).
tcf(c_7064,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7063,c_117,c_116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM500+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.11/0.59 % Computer : n009.cluster.edu
% 0.11/0.59 % Model : x86_64 x86_64
% 0.11/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.59 % Memory : 8046.5625MB
% 0.11/0.59 % OS : Linux 6.8.0-71-generic
% 0.11/0.59 % CPULimit : 300
% 0.11/0.59 % WCLimit : 300
% 0.11/0.59 % DateTime : Thu Sep 24 04:18:14 UTC 2026
% 0.11/0.59 % CPUTime :
% 0.11/0.59 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.63 Running first-order theorem proving
% 0.11/0.63 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.11/0.64
% 0.11/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.64
% 0.11/0.64 % Detected problem language: tptp
% 0.11/0.65 % Proving...
% 3.63/1.41 % SZS status Started for theBenchmark.p
% 3.63/1.41 % SZS status Theorem for theBenchmark.p
% 3.63/1.41
% 3.63/1.41 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.63/1.41
% 3.63/1.41 % ------ iProver source info
% 3.63/1.41
% 3.63/1.41 % git: date: 2026-07-19 20:42:38 +0200
% 3.63/1.41 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.63/1.41 % git: non_committed_changes: false
% 3.63/1.41
% 3.63/1.41 % ------ Parsing...
% 3.63/1.41 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.63/1.41
% 3.63/1.41 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.63/1.41
% 3.63/1.41 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.63/1.41
% 3.63/1.41 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.63/1.41 % ------ Proving...
% 3.63/1.41 % ------ Problem Properties
% 3.63/1.41
% 3.63/1.41 %
% 3.63/1.41 % clauses 78
% 3.63/1.41 % conjectures 1
% 3.63/1.41 % EPR 27
% 3.63/1.41 % Horn 53
% 3.63/1.41 % unary 19
% 3.63/1.41 % binary 7
% 3.63/1.41 % lits 275
% 3.63/1.41 % lits eq 76
% 3.63/1.41 % fd_pure 0
% 3.63/1.41 % fd_pseudo 0
% 3.63/1.41 % fd_cond 15
% 3.63/1.41 % fd_pseudo_cond 11
% 3.63/1.41 % AC symbols 0
% 3.63/1.41
% 3.63/1.41 % ------ Schedule dynamic 5 is on
% 3.63/1.41
% 3.63/1.41 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.63/1.41
% 3.63/1.41
% 3.63/1.41 % ------
% 3.63/1.41 % Current options:
% 3.63/1.41 % ------
% 3.63/1.41
% 3.63/1.41
% 3.63/1.41 %
% 3.63/1.41
% 3.63/1.41 % ------ Proving...
% 3.63/1.41 %
% 3.63/1.41
% 3.63/1.41 % SZS status Theorem for theBenchmark.p
% 3.63/1.41
% 3.63/1.41 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/1.42
% 3.63/1.42
%------------------------------------------------------------------------------