TSTP Solution File: LCL656+1.001 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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 07:46:49 EDT 2023
% Result : Theorem 0.82s 1.16s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 9 unt; 0 def)
% Number of atoms : 486 ( 0 equ)
% Maximal formula atoms : 52 ( 11 avg)
% Number of connectives : 792 ( 347 ~; 281 |; 161 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 127 ( 0 sgn; 96 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
fof(f2,conjecture,
~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| p1(X0)
| ~ r1(X1,X0) ) )
& ( p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X0] :
( ~ p101(X0)
| p2(X0)
| ~ r1(X1,X0) ) )
& ( p2(X1)
| ! [X0] :
( ~ p101(X0)
| ~ p2(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& p2(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& ~ p2(X0) )
| ~ r1(X1,X0) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| p1(X0)
| ~ r1(X1,X0) ) )
& ( p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X0] :
( ~ p101(X0)
| p2(X0)
| ~ r1(X1,X0) ) )
& ( p2(X1)
| ! [X0] :
( ~ p101(X0)
| ~ p2(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& p2(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& ~ p2(X0) )
| ~ r1(X1,X0) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
~ ~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& ~ p102(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p102(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& ~ p102(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p102(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f7,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f8,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X1] :
( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) )
| ~ sP0(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f10,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(definition_folding,[],[f8,f9]) ).
fof(f11,plain,
! [X1] :
( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) )
| ~ sP0(X1) ),
inference(nnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0] :
( ~ p100(X0)
| p101(X0)
| ( ? [X1] :
( p101(X1)
& p2(X1)
& r1(X0,X1) )
& ? [X2] :
( p101(X2)
& ~ p2(X2)
& r1(X0,X2) ) )
| ~ sP0(X0) ),
inference(rectify,[],[f11]) ).
fof(f13,plain,
! [X0] :
( ? [X1] :
( p101(X1)
& p2(X1)
& r1(X0,X1) )
=> ( p101(sK1(X0))
& p2(sK1(X0))
& r1(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X0] :
( ? [X2] :
( p101(X2)
& ~ p2(X2)
& r1(X0,X2) )
=> ( p101(sK2(X0))
& ~ p2(sK2(X0))
& r1(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ~ p100(X0)
| p101(X0)
| ( p101(sK1(X0))
& p2(sK1(X0))
& r1(X0,sK1(X0))
& p101(sK2(X0))
& ~ p2(sK2(X0))
& r1(X0,sK2(X0)) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f12,f14,f13]) ).
fof(f16,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(X0,X1) )
& ! [X6] :
( p2(X6)
| ~ r1(X0,X6) ) ),
inference(rectify,[],[f10]) ).
fof(f17,plain,
( ? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(X0,X1) )
& ! [X6] :
( p2(X6)
| ~ r1(X0,X6) ) )
=> ( p100(sK3)
& ~ p101(sK3)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(sK3,X1) )
& ! [X6] :
( p2(X6)
| ~ r1(sK3,X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( p100(sK3)
& ~ p101(sK3)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& sP0(X1) )
| ~ r1(sK3,X1) )
& ! [X6] :
( p2(X6)
| ~ r1(sK3,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f17]) ).
fof(f19,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f20,plain,
! [X0] :
( ~ p100(X0)
| p101(X0)
| r1(X0,sK2(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
! [X0] :
( ~ p100(X0)
| p101(X0)
| ~ p2(sK2(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X6] :
( p2(X6)
| ~ r1(sK3,X6) ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X1] :
( sP0(X1)
| ~ r1(sK3,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X1,X5] :
( ~ p101(X1)
| p2(X1)
| ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5)
| ~ r1(sK3,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
~ p101(sK3),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
p100(sK3),
inference(cnf_transformation,[],[f18]) ).
cnf(c_49,plain,
r1(X0,X0),
inference(cnf_transformation,[],[f19]) ).
cnf(c_54,plain,
( ~ p2(sK2(X0))
| ~ p100(X0)
| ~ sP0(X0)
| p101(X0) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_55,plain,
( ~ p100(X0)
| ~ sP0(X0)
| r1(X0,sK2(X0))
| p101(X0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_56,negated_conjecture,
p100(sK3),
inference(cnf_transformation,[],[f34]) ).
cnf(c_57,negated_conjecture,
~ p101(sK3),
inference(cnf_transformation,[],[f33]) ).
cnf(c_62,negated_conjecture,
( ~ r1(X0,X1)
| ~ r1(sK3,X0)
| ~ p101(X0)
| ~ p101(X1)
| ~ p2(X1)
| p2(X0) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_63,negated_conjecture,
( ~ r1(sK3,X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_64,negated_conjecture,
( ~ r1(sK3,X0)
| p2(X0) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_65,plain,
r1(sK3,sK3),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_67,plain,
( ~ r1(sK3,sK3)
| sP0(sK3) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_71,plain,
( ~ p100(sK3)
| ~ sP0(sK3)
| r1(sK3,sK2(sK3))
| p101(sK3) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_74,negated_conjecture,
( ~ r1(sK3,X0)
| p2(X0) ),
inference(global_subsumption_just,[status(thm)],[c_62,c_64]) ).
cnf(c_202,plain,
( ~ r1(sK3,sK2(X0))
| ~ p100(X0)
| ~ sP0(X0)
| p101(X0) ),
inference(resolution,[status(thm)],[c_54,c_74]) ).
cnf(c_203,plain,
( ~ r1(sK3,sK2(sK3))
| ~ p100(sK3)
| ~ sP0(sK3)
| p101(sK3) ),
inference(instantiation,[status(thm)],[c_202]) ).
cnf(c_204,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_203,c_71,c_67,c_65,c_57,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 20:56:36 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.82/1.16 % SZS status Started for theBenchmark.p
% 0.82/1.16 % SZS status Theorem for theBenchmark.p
% 0.82/1.16
% 0.82/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.82/1.16
% 0.82/1.16 ------ iProver source info
% 0.82/1.16
% 0.82/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.82/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.82/1.16 git: non_committed_changes: false
% 0.82/1.16 git: last_make_outside_of_git: false
% 0.82/1.16
% 0.82/1.16 ------ Parsing...
% 0.82/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.82/1.16
% 0.82/1.16 ------ Preprocessing... sf_s rm: 3 0s sf_e pe_s
% 0.82/1.16
% 0.82/1.16 % SZS status Theorem for theBenchmark.p
% 0.82/1.16
% 0.82/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.82/1.16
% 0.82/1.17
%------------------------------------------------------------------------------