TSTP Solution File: RNG114+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG114+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 : Mon Jun 24 14:04:26 EDT 2024
% Result : Theorem 10.35s 2.21s
% Output : CNFRefutation 10.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 265 ( 78 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 316 ( 94 ~; 76 |; 125 &)
% ( 9 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-2 aty)
% Number of variables : 122 ( 0 sgn 70 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( aElementOf0(X0,xI)
<=> ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) )
& ! [X0] :
( aElementOf0(X0,slsdtgt0(xb))
<=> ? [X1] :
( sdtasdt0(xb,X1) = X0
& aElement0(X1) ) )
& ! [X0] :
( aElementOf0(X0,slsdtgt0(xa))
<=> ? [X1] :
( sdtasdt0(xa,X1) = X0
& aElement0(X1) ) )
& aIdeal0(xI)
& ! [X0] :
( aElementOf0(X0,xI)
=> ( ! [X1] :
( aElement0(X1)
=> aElementOf0(sdtasdt0(X1,X0),xI) )
& ! [X1] :
( aElementOf0(X1,xI)
=> aElementOf0(sdtpldt0(X0,X1),xI) ) ) )
& aSet0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(f45,axiom,
( ! [X0] :
( ( sz00 != X0
& ( aElementOf0(X0,xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
& sz00 != xu
& aElementOf0(xu,xI)
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xu
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(f47,conjecture,
? [X0,X1] :
( xu = sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
& aElement0(X1)
& aElement0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f48,negated_conjecture,
~ ? [X0,X1] :
( xu = sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
& aElement0(X1)
& aElement0(X0) ),
inference(negated_conjecture,[],[f47]) ).
fof(f57,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( aElementOf0(X0,xI)
<=> ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) )
& ! [X3] :
( aElementOf0(X3,slsdtgt0(xb))
<=> ? [X4] :
( sdtasdt0(xb,X4) = X3
& aElement0(X4) ) )
& ! [X5] :
( aElementOf0(X5,slsdtgt0(xa))
<=> ? [X6] :
( sdtasdt0(xa,X6) = X5
& aElement0(X6) ) )
& aIdeal0(xI)
& ! [X7] :
( aElementOf0(X7,xI)
=> ( ! [X8] :
( aElement0(X8)
=> aElementOf0(sdtasdt0(X8,X7),xI) )
& ! [X9] :
( aElementOf0(X9,xI)
=> aElementOf0(sdtpldt0(X7,X9),xI) ) ) )
& aSet0(xI) ),
inference(rectify,[],[f42]) ).
fof(f60,plain,
( ! [X0] :
( ( sz00 != X0
& ( aElementOf0(X0,xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
& sz00 != xu
& aElementOf0(xu,xI)
& ? [X3,X4] :
( xu = sdtpldt0(X3,X4)
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) ),
inference(rectify,[],[f45]) ).
fof(f114,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( aElementOf0(X0,xI)
<=> ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) )
& ! [X3] :
( aElementOf0(X3,slsdtgt0(xb))
<=> ? [X4] :
( sdtasdt0(xb,X4) = X3
& aElement0(X4) ) )
& ! [X5] :
( aElementOf0(X5,slsdtgt0(xa))
<=> ? [X6] :
( sdtasdt0(xa,X6) = X5
& aElement0(X6) ) )
& aIdeal0(xI)
& ! [X7] :
( ( ! [X8] :
( aElementOf0(sdtasdt0(X8,X7),xI)
| ~ aElement0(X8) )
& ! [X9] :
( aElementOf0(sdtpldt0(X7,X9),xI)
| ~ aElementOf0(X9,xI) ) )
| ~ aElementOf0(X7,xI) )
& aSet0(xI) ),
inference(ennf_transformation,[],[f57]) ).
fof(f115,plain,
( ! [X0] :
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| sz00 = X0
| ( ~ aElementOf0(X0,xI)
& ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) ) )
& sz00 != xu
& aElementOf0(xu,xI)
& ? [X3,X4] :
( xu = sdtpldt0(X3,X4)
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f116,plain,
( ! [X0] :
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| sz00 = X0
| ( ~ aElementOf0(X0,xI)
& ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) ) )
& sz00 != xu
& aElementOf0(xu,xI)
& ? [X3,X4] :
( xu = sdtpldt0(X3,X4)
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) ) ),
inference(flattening,[],[f115]) ).
fof(f118,plain,
! [X0,X1] :
( xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f184,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( ( aElementOf0(X0,xI)
| ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) )
& ( ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) )
| ~ aElementOf0(X0,xI) ) )
& ! [X3] :
( ( aElementOf0(X3,slsdtgt0(xb))
| ! [X4] :
( sdtasdt0(xb,X4) != X3
| ~ aElement0(X4) ) )
& ( ? [X4] :
( sdtasdt0(xb,X4) = X3
& aElement0(X4) )
| ~ aElementOf0(X3,slsdtgt0(xb)) ) )
& ! [X5] :
( ( aElementOf0(X5,slsdtgt0(xa))
| ! [X6] :
( sdtasdt0(xa,X6) != X5
| ~ aElement0(X6) ) )
& ( ? [X6] :
( sdtasdt0(xa,X6) = X5
& aElement0(X6) )
| ~ aElementOf0(X5,slsdtgt0(xa)) ) )
& aIdeal0(xI)
& ! [X7] :
( ( ! [X8] :
( aElementOf0(sdtasdt0(X8,X7),xI)
| ~ aElement0(X8) )
& ! [X9] :
( aElementOf0(sdtpldt0(X7,X9),xI)
| ~ aElementOf0(X9,xI) ) )
| ~ aElementOf0(X7,xI) )
& aSet0(xI) ),
inference(nnf_transformation,[],[f114]) ).
fof(f185,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( ( aElementOf0(X0,xI)
| ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) )
& ( ? [X3,X4] :
( sdtpldt0(X3,X4) = X0
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) )
| ~ aElementOf0(X0,xI) ) )
& ! [X5] :
( ( aElementOf0(X5,slsdtgt0(xb))
| ! [X6] :
( sdtasdt0(xb,X6) != X5
| ~ aElement0(X6) ) )
& ( ? [X7] :
( sdtasdt0(xb,X7) = X5
& aElement0(X7) )
| ~ aElementOf0(X5,slsdtgt0(xb)) ) )
& ! [X8] :
( ( aElementOf0(X8,slsdtgt0(xa))
| ! [X9] :
( sdtasdt0(xa,X9) != X8
| ~ aElement0(X9) ) )
& ( ? [X10] :
( sdtasdt0(xa,X10) = X8
& aElement0(X10) )
| ~ aElementOf0(X8,slsdtgt0(xa)) ) )
& aIdeal0(xI)
& ! [X11] :
( ( ! [X12] :
( aElementOf0(sdtasdt0(X12,X11),xI)
| ~ aElement0(X12) )
& ! [X13] :
( aElementOf0(sdtpldt0(X11,X13),xI)
| ~ aElementOf0(X13,xI) ) )
| ~ aElementOf0(X11,xI) )
& aSet0(xI) ),
inference(rectify,[],[f184]) ).
fof(f186,plain,
! [X0] :
( ? [X3,X4] :
( sdtpldt0(X3,X4) = X0
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) )
=> ( sdtpldt0(sK28(X0),sK29(X0)) = X0
& aElementOf0(sK29(X0),slsdtgt0(xb))
& aElementOf0(sK28(X0),slsdtgt0(xa)) ) ),
introduced(choice_axiom,[]) ).
fof(f187,plain,
! [X5] :
( ? [X7] :
( sdtasdt0(xb,X7) = X5
& aElement0(X7) )
=> ( sdtasdt0(xb,sK30(X5)) = X5
& aElement0(sK30(X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f188,plain,
! [X8] :
( ? [X10] :
( sdtasdt0(xa,X10) = X8
& aElement0(X10) )
=> ( sdtasdt0(xa,sK31(X8)) = X8
& aElement0(sK31(X8)) ) ),
introduced(choice_axiom,[]) ).
fof(f189,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( ( aElementOf0(X0,xI)
| ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) )
& ( ( sdtpldt0(sK28(X0),sK29(X0)) = X0
& aElementOf0(sK29(X0),slsdtgt0(xb))
& aElementOf0(sK28(X0),slsdtgt0(xa)) )
| ~ aElementOf0(X0,xI) ) )
& ! [X5] :
( ( aElementOf0(X5,slsdtgt0(xb))
| ! [X6] :
( sdtasdt0(xb,X6) != X5
| ~ aElement0(X6) ) )
& ( ( sdtasdt0(xb,sK30(X5)) = X5
& aElement0(sK30(X5)) )
| ~ aElementOf0(X5,slsdtgt0(xb)) ) )
& ! [X8] :
( ( aElementOf0(X8,slsdtgt0(xa))
| ! [X9] :
( sdtasdt0(xa,X9) != X8
| ~ aElement0(X9) ) )
& ( ( sdtasdt0(xa,sK31(X8)) = X8
& aElement0(sK31(X8)) )
| ~ aElementOf0(X8,slsdtgt0(xa)) ) )
& aIdeal0(xI)
& ! [X11] :
( ( ! [X12] :
( aElementOf0(sdtasdt0(X12,X11),xI)
| ~ aElement0(X12) )
& ! [X13] :
( aElementOf0(sdtpldt0(X11,X13),xI)
| ~ aElementOf0(X13,xI) ) )
| ~ aElementOf0(X11,xI) )
& aSet0(xI) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28,sK29,sK30,sK31])],[f185,f188,f187,f186]) ).
fof(f202,plain,
( ? [X3,X4] :
( xu = sdtpldt0(X3,X4)
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) )
=> ( xu = sdtpldt0(sK41,sK42)
& aElementOf0(sK42,slsdtgt0(xb))
& aElementOf0(sK41,slsdtgt0(xa)) ) ),
introduced(choice_axiom,[]) ).
fof(f203,plain,
( ! [X0] :
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| sz00 = X0
| ( ~ aElementOf0(X0,xI)
& ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) ) )
& sz00 != xu
& aElementOf0(xu,xI)
& xu = sdtpldt0(sK41,sK42)
& aElementOf0(sK42,slsdtgt0(xb))
& aElementOf0(sK41,slsdtgt0(xa)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK41,sK42])],[f116,f202]) ).
fof(f324,plain,
! [X8] :
( aElement0(sK31(X8))
| ~ aElementOf0(X8,slsdtgt0(xa)) ),
inference(cnf_transformation,[],[f189]) ).
fof(f325,plain,
! [X8] :
( sdtasdt0(xa,sK31(X8)) = X8
| ~ aElementOf0(X8,slsdtgt0(xa)) ),
inference(cnf_transformation,[],[f189]) ).
fof(f327,plain,
! [X5] :
( aElement0(sK30(X5))
| ~ aElementOf0(X5,slsdtgt0(xb)) ),
inference(cnf_transformation,[],[f189]) ).
fof(f328,plain,
! [X5] :
( sdtasdt0(xb,sK30(X5)) = X5
| ~ aElementOf0(X5,slsdtgt0(xb)) ),
inference(cnf_transformation,[],[f189]) ).
fof(f358,plain,
aElementOf0(sK41,slsdtgt0(xa)),
inference(cnf_transformation,[],[f203]) ).
fof(f359,plain,
aElementOf0(sK42,slsdtgt0(xb)),
inference(cnf_transformation,[],[f203]) ).
fof(f360,plain,
xu = sdtpldt0(sK41,sK42),
inference(cnf_transformation,[],[f203]) ).
fof(f371,plain,
! [X0,X1] :
( xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f118]) ).
cnf(c_169,plain,
( ~ aElementOf0(X0,slsdtgt0(xb))
| sdtasdt0(xb,sK30(X0)) = X0 ),
inference(cnf_transformation,[],[f328]) ).
cnf(c_170,plain,
( ~ aElementOf0(X0,slsdtgt0(xb))
| aElement0(sK30(X0)) ),
inference(cnf_transformation,[],[f327]) ).
cnf(c_172,plain,
( ~ aElementOf0(X0,slsdtgt0(xa))
| sdtasdt0(xa,sK31(X0)) = X0 ),
inference(cnf_transformation,[],[f325]) ).
cnf(c_173,plain,
( ~ aElementOf0(X0,slsdtgt0(xa))
| aElement0(sK31(X0)) ),
inference(cnf_transformation,[],[f324]) ).
cnf(c_205,plain,
sdtpldt0(sK41,sK42) = xu,
inference(cnf_transformation,[],[f360]) ).
cnf(c_206,plain,
aElementOf0(sK42,slsdtgt0(xb)),
inference(cnf_transformation,[],[f359]) ).
cnf(c_207,plain,
aElementOf0(sK41,slsdtgt0(xa)),
inference(cnf_transformation,[],[f358]) ).
cnf(c_214,negated_conjecture,
( sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) != xu
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f371]) ).
cnf(c_7925,negated_conjecture,
( sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) != xu
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(demodulation,[status(thm)],[c_214]) ).
cnf(c_10085,plain,
aElement0(sK30(sK42)),
inference(superposition,[status(thm)],[c_206,c_170]) ).
cnf(c_10093,plain,
aElement0(sK31(sK41)),
inference(superposition,[status(thm)],[c_207,c_173]) ).
cnf(c_11629,plain,
sdtasdt0(xb,sK30(sK42)) = sK42,
inference(superposition,[status(thm)],[c_206,c_169]) ).
cnf(c_11656,plain,
sdtasdt0(xa,sK31(sK41)) = sK41,
inference(superposition,[status(thm)],[c_207,c_172]) ).
cnf(c_29510,plain,
( sdtpldt0(sdtasdt0(xa,X0),sK42) != xu
| ~ aElement0(sK30(sK42))
| ~ aElement0(X0) ),
inference(superposition,[status(thm)],[c_11629,c_7925]) ).
cnf(c_29522,plain,
( sdtpldt0(sdtasdt0(xa,X0),sK42) != xu
| ~ aElement0(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_29510,c_10085]) ).
cnf(c_29956,plain,
( sdtpldt0(sK41,sK42) != xu
| ~ aElement0(sK31(sK41)) ),
inference(superposition,[status(thm)],[c_11656,c_29522]) ).
cnf(c_29967,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_29956,c_10093,c_205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG114+4 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 14:13:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 10.35/2.21 % SZS status Started for theBenchmark.p
% 10.35/2.21 % SZS status Theorem for theBenchmark.p
% 10.35/2.21
% 10.35/2.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.35/2.21
% 10.35/2.21 ------ iProver source info
% 10.35/2.21
% 10.35/2.21 git: date: 2024-06-12 09:56:46 +0000
% 10.35/2.21 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 10.35/2.21 git: non_committed_changes: false
% 10.35/2.21
% 10.35/2.21 ------ Parsing...
% 10.35/2.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.35/2.21
% 10.35/2.21 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 10.35/2.21
% 10.35/2.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.35/2.21
% 10.35/2.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.35/2.21 ------ Proving...
% 10.35/2.21 ------ Problem Properties
% 10.35/2.21
% 10.35/2.21
% 10.35/2.21 clauses 158
% 10.35/2.21 conjectures 1
% 10.35/2.21 EPR 42
% 10.35/2.21 Horn 131
% 10.35/2.21 unary 40
% 10.35/2.21 binary 36
% 10.35/2.21 lits 449
% 10.35/2.21 lits eq 70
% 10.35/2.21 fd_pure 0
% 10.35/2.21 fd_pseudo 0
% 10.35/2.21 fd_cond 5
% 10.35/2.21 fd_pseudo_cond 11
% 10.35/2.21 AC symbols 0
% 10.35/2.21
% 10.35/2.21 ------ Schedule dynamic 5 is on
% 10.35/2.21
% 10.35/2.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.35/2.21
% 10.35/2.21
% 10.35/2.21 ------
% 10.35/2.21 Current options:
% 10.35/2.21 ------
% 10.35/2.21
% 10.35/2.21
% 10.35/2.21
% 10.35/2.21
% 10.35/2.21 ------ Proving...
% 10.35/2.21
% 10.35/2.21
% 10.35/2.21 % SZS status Theorem for theBenchmark.p
% 10.35/2.21
% 10.35/2.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.35/2.21
% 10.35/2.22
%------------------------------------------------------------------------------