TSTP Solution File: NUM501+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM501+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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 : Thu Aug 31 11:30:58 EDT 2023
% Result : Theorem 9.47s 2.17s
% Output : CNFRefutation 9.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 18 unt; 0 def)
% Number of atoms : 281 ( 76 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 352 ( 141 ~; 131 |; 68 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn; 59 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(f9,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(f30,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(f32,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X0,X1) )
=> doDivides0(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivTrans) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
fof(f45,axiom,
( xk = sdtsldt0(sdtasdt0(xn,xm),xp)
& sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
& aNaturalNumber0(xk) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2306) ).
fof(f48,axiom,
( isPrime0(xr)
& ! [X0] :
( ( ( doDivides0(X0,xr)
| ? [X1] :
( sdtasdt0(X0,X1) = xr
& aNaturalNumber0(X1) ) )
& aNaturalNumber0(X0) )
=> ( xr = X0
| sz10 = X0 ) )
& sz10 != xr
& sz00 != xr
& doDivides0(xr,xk)
& ? [X0] :
( xk = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) )
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2342) ).
fof(f49,conjecture,
( doDivides0(xr,sdtasdt0(xn,xm))
| ? [X0] :
( sdtasdt0(xn,xm) = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f50,negated_conjecture,
~ ( doDivides0(xr,sdtasdt0(xn,xm))
| ? [X0] :
( sdtasdt0(xn,xm) = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) ),
inference(negated_conjecture,[],[f49]) ).
fof(f56,plain,
( isPrime0(xr)
& ! [X0] :
( ( ( doDivides0(X0,xr)
| ? [X1] :
( sdtasdt0(X0,X1) = xr
& aNaturalNumber0(X1) ) )
& aNaturalNumber0(X0) )
=> ( xr = X0
| sz10 = X0 ) )
& sz10 != xr
& sz00 != xr
& doDivides0(xr,xk)
& ? [X2] :
( xk = sdtasdt0(xr,X2)
& aNaturalNumber0(X2) )
& aNaturalNumber0(xr) ),
inference(rectify,[],[f48]) ).
fof(f59,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f60,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f59]) ).
fof(f66,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f67,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f66]) ).
fof(f103,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f104,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f103]) ).
fof(f107,plain,
! [X0,X1,X2] :
( doDivides0(X0,X2)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X0,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f108,plain,
! [X0,X1,X2] :
( doDivides0(X0,X2)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X0,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f107]) ).
fof(f128,plain,
( isPrime0(xr)
& ! [X0] :
( xr = X0
| sz10 = X0
| ( ~ doDivides0(X0,xr)
& ! [X1] :
( sdtasdt0(X0,X1) != xr
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0) )
& sz10 != xr
& sz00 != xr
& doDivides0(xr,xk)
& ? [X2] :
( xk = sdtasdt0(xr,X2)
& aNaturalNumber0(X2) )
& aNaturalNumber0(xr) ),
inference(ennf_transformation,[],[f56]) ).
fof(f129,plain,
( isPrime0(xr)
& ! [X0] :
( xr = X0
| sz10 = X0
| ( ~ doDivides0(X0,xr)
& ! [X1] :
( sdtasdt0(X0,X1) != xr
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0) )
& sz10 != xr
& sz00 != xr
& doDivides0(xr,xk)
& ? [X2] :
( xk = sdtasdt0(xr,X2)
& aNaturalNumber0(X2) )
& aNaturalNumber0(xr) ),
inference(flattening,[],[f128]) ).
fof(f130,plain,
( ~ doDivides0(xr,sdtasdt0(xn,xm))
& ! [X0] :
( sdtasdt0(xn,xm) != sdtasdt0(xr,X0)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f50]) ).
fof(f140,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f104]) ).
fof(f141,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(rectify,[],[f140]) ).
fof(f142,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X0,sK3(X0,X1)) = X1
& aNaturalNumber0(sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ( sdtasdt0(X0,sK3(X0,X1)) = X1
& aNaturalNumber0(sK3(X0,X1)) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f141,f142]) ).
fof(f170,plain,
( ? [X2] :
( xk = sdtasdt0(xr,X2)
& aNaturalNumber0(X2) )
=> ( xk = sdtasdt0(xr,sK13)
& aNaturalNumber0(sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f171,plain,
( isPrime0(xr)
& ! [X0] :
( xr = X0
| sz10 = X0
| ( ~ doDivides0(X0,xr)
& ! [X1] :
( sdtasdt0(X0,X1) != xr
| ~ aNaturalNumber0(X1) ) )
| ~ aNaturalNumber0(X0) )
& sz10 != xr
& sz00 != xr
& doDivides0(xr,xk)
& xk = sdtasdt0(xr,sK13)
& aNaturalNumber0(sK13)
& aNaturalNumber0(xr) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f129,f170]) ).
fof(f176,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f181,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f221,plain,
! [X2,X0,X1] :
( doDivides0(X0,X1)
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f225,plain,
! [X2,X0,X1] :
( doDivides0(X0,X2)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X0,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f242,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f279,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f45]) ).
fof(f280,plain,
sdtasdt0(xn,xm) = sdtasdt0(xp,xk),
inference(cnf_transformation,[],[f45]) ).
fof(f286,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f171]) ).
fof(f288,plain,
xk = sdtasdt0(xr,sK13),
inference(cnf_transformation,[],[f171]) ).
fof(f289,plain,
doDivides0(xr,xk),
inference(cnf_transformation,[],[f171]) ).
fof(f296,plain,
~ doDivides0(xr,sdtasdt0(xn,xm)),
inference(cnf_transformation,[],[f130]) ).
fof(f303,plain,
! [X2,X0] :
( doDivides0(X0,sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f221]) ).
cnf(c_53,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f176]) ).
cnf(c_58,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
inference(cnf_transformation,[],[f181]) ).
cnf(c_95,plain,
( ~ aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| doDivides0(X0,sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f303]) ).
cnf(c_101,plain,
( ~ doDivides0(X0,X1)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| doDivides0(X0,X2) ),
inference(cnf_transformation,[],[f225]) ).
cnf(c_116,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f242]) ).
cnf(c_156,plain,
sdtasdt0(xp,xk) = sdtasdt0(xn,xm),
inference(cnf_transformation,[],[f280]) ).
cnf(c_157,plain,
aNaturalNumber0(xk),
inference(cnf_transformation,[],[f279]) ).
cnf(c_167,plain,
doDivides0(xr,xk),
inference(cnf_transformation,[],[f289]) ).
cnf(c_168,plain,
sdtasdt0(xr,sK13) = xk,
inference(cnf_transformation,[],[f288]) ).
cnf(c_170,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f286]) ).
cnf(c_171,negated_conjecture,
~ doDivides0(xr,sdtasdt0(xn,xm)),
inference(cnf_transformation,[],[f296]) ).
cnf(c_243,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| doDivides0(X0,sdtasdt0(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_95,c_53,c_95]) ).
cnf(c_7623,plain,
X0 = X0,
theory(equality) ).
cnf(c_7626,plain,
( X0 != X1
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(X0) ),
theory(equality) ).
cnf(c_7632,plain,
( X0 != X1
| X2 != X3
| ~ doDivides0(X1,X3)
| doDivides0(X0,X2) ),
theory(equality) ).
cnf(c_9428,plain,
( ~ doDivides0(X0,X1)
| ~ doDivides0(xr,X0)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xr)
| doDivides0(xr,X1) ),
inference(instantiation,[status(thm)],[c_101]) ).
cnf(c_9453,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xk)
| aNaturalNumber0(sdtasdt0(xp,xk)) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_9550,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xk)
| sdtasdt0(xp,xk) = sdtasdt0(xk,xp) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_9578,plain,
xr = xr,
inference(instantiation,[status(thm)],[c_7623]) ).
cnf(c_10064,plain,
( X0 != X1
| X2 != sdtasdt0(X1,X3)
| ~ doDivides0(X1,sdtasdt0(X1,X3))
| doDivides0(X0,X2) ),
inference(instantiation,[status(thm)],[c_7632]) ).
cnf(c_10067,plain,
( X0 != xr
| X1 != xk
| ~ doDivides0(xr,xk)
| doDivides0(X0,X1) ),
inference(instantiation,[status(thm)],[c_7632]) ).
cnf(c_10069,plain,
( ~ doDivides0(sdtasdt0(xr,X0),X1)
| ~ doDivides0(xr,sdtasdt0(xr,X0))
| ~ aNaturalNumber0(sdtasdt0(xr,X0))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xr)
| doDivides0(xr,X1) ),
inference(instantiation,[status(thm)],[c_9428]) ).
cnf(c_10538,plain,
~ doDivides0(xr,sdtasdt0(xp,xk)),
inference(superposition,[status(thm)],[c_156,c_171]) ).
cnf(c_12250,plain,
( ~ aNaturalNumber0(xk)
| aNaturalNumber0(sdtasdt0(xr,sK13)) ),
inference(resolution,[status(thm)],[c_7626,c_168]) ).
cnf(c_12903,plain,
( sdtasdt0(xp,xk) != sdtasdt0(xk,xp)
| X0 != xk
| ~ doDivides0(xk,sdtasdt0(xk,xp))
| doDivides0(X0,sdtasdt0(xp,xk)) ),
inference(instantiation,[status(thm)],[c_10064]) ).
cnf(c_13452,plain,
( sdtasdt0(xr,sK13) != xk
| X0 != xr
| ~ doDivides0(xr,xk)
| doDivides0(X0,sdtasdt0(xr,sK13)) ),
inference(instantiation,[status(thm)],[c_10067]) ).
cnf(c_18210,plain,
( sdtasdt0(xp,xk) != sdtasdt0(xk,xp)
| sdtasdt0(xr,sK13) != xk
| ~ doDivides0(xk,sdtasdt0(xk,xp))
| doDivides0(sdtasdt0(xr,sK13),sdtasdt0(xp,xk)) ),
inference(instantiation,[status(thm)],[c_12903]) ).
cnf(c_21230,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xk)
| doDivides0(xk,sdtasdt0(xk,xp)) ),
inference(instantiation,[status(thm)],[c_243]) ).
cnf(c_21733,plain,
( sdtasdt0(xr,sK13) != xk
| xr != xr
| ~ doDivides0(xr,xk)
| doDivides0(xr,sdtasdt0(xr,sK13)) ),
inference(instantiation,[status(thm)],[c_13452]) ).
cnf(c_26749,plain,
( ~ doDivides0(sdtasdt0(xr,sK13),sdtasdt0(xp,xk))
| ~ doDivides0(xr,sdtasdt0(xr,sK13))
| ~ aNaturalNumber0(sdtasdt0(xp,xk))
| ~ aNaturalNumber0(sdtasdt0(xr,sK13))
| ~ aNaturalNumber0(xr)
| doDivides0(xr,sdtasdt0(xp,xk)) ),
inference(instantiation,[status(thm)],[c_10069]) ).
cnf(c_26750,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_26749,c_21733,c_21230,c_18210,c_12250,c_10538,c_9578,c_9550,c_9453,c_168,c_167,c_116,c_157,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM501+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 18:05:22 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.47/2.17 % SZS status Started for theBenchmark.p
% 9.47/2.17 % SZS status Theorem for theBenchmark.p
% 9.47/2.17
% 9.47/2.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 9.47/2.17
% 9.47/2.17 ------ iProver source info
% 9.47/2.17
% 9.47/2.17 git: date: 2023-05-31 18:12:56 +0000
% 9.47/2.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 9.47/2.17 git: non_committed_changes: false
% 9.47/2.17 git: last_make_outside_of_git: false
% 9.47/2.17
% 9.47/2.17 ------ Parsing...
% 9.47/2.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 9.47/2.17
% 9.47/2.17 ------ Preprocessing... sup_sim: 3 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
% 9.47/2.17
% 9.47/2.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.47/2.17
% 9.47/2.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.47/2.17 ------ Proving...
% 9.47/2.17 ------ Problem Properties
% 9.47/2.17
% 9.47/2.17
% 9.47/2.17 clauses 117
% 9.47/2.17 conjectures 1
% 9.47/2.17 EPR 42
% 9.47/2.17 Horn 77
% 9.47/2.17 unary 37
% 9.47/2.17 binary 14
% 9.47/2.17 lits 389
% 9.47/2.17 lits eq 119
% 9.47/2.17 fd_pure 0
% 9.47/2.17 fd_pseudo 0
% 9.47/2.17 fd_cond 24
% 9.47/2.17 fd_pseudo_cond 11
% 9.47/2.17 AC symbols 0
% 9.47/2.17
% 9.47/2.17 ------ Input Options Time Limit: Unbounded
% 9.47/2.17
% 9.47/2.17
% 9.47/2.17 ------
% 9.47/2.17 Current options:
% 9.47/2.17 ------
% 9.47/2.17
% 9.47/2.17
% 9.47/2.17
% 9.47/2.17
% 9.47/2.17 ------ Proving...
% 9.47/2.17
% 9.47/2.17
% 9.47/2.17 % SZS status Theorem for theBenchmark.p
% 9.47/2.17
% 9.47/2.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.47/2.17
% 9.47/2.18
%------------------------------------------------------------------------------