TSTP Solution File: COM018+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : COM018+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 : Wed Aug 30 18:42:06 EDT 2023
% Result : Theorem 0.86s 1.07s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 39 ( 10 unt; 0 def)
% Number of atoms : 357 ( 27 equ)
% Maximal formula atoms : 30 ( 9 avg)
% Number of connectives : 416 ( 98 ~; 128 |; 176 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 106 ( 2 sgn; 58 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0] :
( ( isTerminating0(X0)
& aRewritingSystem0(X0) )
=> ! [X1] :
( aElement0(X1)
=> ? [X2] : aNormalFormOfIn0(X2,X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermNF) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(f16,axiom,
( isTerminating0(xR)
& ! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtmndtplgtdt0(X0,xR,X1)
| ? [X2] :
( sdtmndtplgtdt0(X2,xR,X1)
& aReductOfIn0(X2,X0,xR)
& aElement0(X2) )
| aReductOfIn0(X1,X0,xR) )
=> iLess0(X1,X0) ) )
& isLocallyConfluent0(xR)
& ! [X0,X1,X2] :
( ( aReductOfIn0(X2,X0,xR)
& aReductOfIn0(X1,X0,xR)
& aElement0(X2)
& aElement0(X1)
& aElement0(X0) )
=> ? [X3] :
( sdtmndtasgtdt0(X2,xR,X3)
& ( ( sdtmndtplgtdt0(X2,xR,X3)
& ( ? [X4] :
( sdtmndtplgtdt0(X4,xR,X3)
& aReductOfIn0(X4,X2,xR)
& aElement0(X4) )
| aReductOfIn0(X3,X2,xR) ) )
| X2 = X3 )
& sdtmndtasgtdt0(X1,xR,X3)
& ( ( sdtmndtplgtdt0(X1,xR,X3)
& ( ? [X4] :
( sdtmndtplgtdt0(X4,xR,X3)
& aReductOfIn0(X4,X1,xR)
& aElement0(X4) )
| aReductOfIn0(X3,X1,xR) ) )
| X1 = X3 )
& aElement0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).
fof(f22,axiom,
( sdtmndtasgtdt0(xv,xR,xw)
& ( ( sdtmndtplgtdt0(xv,xR,xw)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xw)
& aReductOfIn0(X0,xv,xR)
& aElement0(X0) )
| aReductOfIn0(xw,xv,xR) ) )
| xv = xw )
& sdtmndtasgtdt0(xu,xR,xw)
& ( ( sdtmndtplgtdt0(xu,xR,xw)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xw)
& aReductOfIn0(X0,xu,xR)
& aElement0(X0) )
| aReductOfIn0(xw,xu,xR) ) )
| xu = xw )
& aElement0(xw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__799) ).
fof(f23,conjecture,
? [X0] :
( aNormalFormOfIn0(X0,xw,xR)
| ( ~ ? [X1] : aReductOfIn0(X1,X0,xR)
& ( sdtmndtasgtdt0(xw,xR,X0)
| sdtmndtplgtdt0(xw,xR,X0)
| ? [X1] :
( sdtmndtplgtdt0(X1,xR,X0)
& aReductOfIn0(X1,xw,xR)
& aElement0(X1) )
| aReductOfIn0(X0,xw,xR)
| xw = X0 )
& aElement0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f24,negated_conjecture,
~ ? [X0] :
( aNormalFormOfIn0(X0,xw,xR)
| ( ~ ? [X1] : aReductOfIn0(X1,X0,xR)
& ( sdtmndtasgtdt0(xw,xR,X0)
| sdtmndtplgtdt0(xw,xR,X0)
| ? [X1] :
( sdtmndtplgtdt0(X1,xR,X0)
& aReductOfIn0(X1,xw,xR)
& aElement0(X1) )
| aReductOfIn0(X0,xw,xR)
| xw = X0 )
& aElement0(X0) ) ),
inference(negated_conjecture,[],[f23]) ).
fof(f29,plain,
( isTerminating0(xR)
& ! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtmndtplgtdt0(X0,xR,X1)
| ? [X2] :
( sdtmndtplgtdt0(X2,xR,X1)
& aReductOfIn0(X2,X0,xR)
& aElement0(X2) )
| aReductOfIn0(X1,X0,xR) )
=> iLess0(X1,X0) ) )
& isLocallyConfluent0(xR)
& ! [X3,X4,X5] :
( ( aReductOfIn0(X5,X3,xR)
& aReductOfIn0(X4,X3,xR)
& aElement0(X5)
& aElement0(X4)
& aElement0(X3) )
=> ? [X6] :
( sdtmndtasgtdt0(X5,xR,X6)
& ( ( sdtmndtplgtdt0(X5,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aReductOfIn0(X7,X5,xR)
& aElement0(X7) )
| aReductOfIn0(X6,X5,xR) ) )
| X5 = X6 )
& sdtmndtasgtdt0(X4,xR,X6)
& ( ( sdtmndtplgtdt0(X4,xR,X6)
& ( ? [X8] :
( sdtmndtplgtdt0(X8,xR,X6)
& aReductOfIn0(X8,X4,xR)
& aElement0(X8) )
| aReductOfIn0(X6,X4,xR) ) )
| X4 = X6 )
& aElement0(X6) ) ) ),
inference(rectify,[],[f16]) ).
fof(f32,plain,
( sdtmndtasgtdt0(xv,xR,xw)
& ( ( sdtmndtplgtdt0(xv,xR,xw)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xw)
& aReductOfIn0(X0,xv,xR)
& aElement0(X0) )
| aReductOfIn0(xw,xv,xR) ) )
| xv = xw )
& sdtmndtasgtdt0(xu,xR,xw)
& ( ( sdtmndtplgtdt0(xu,xR,xw)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xw)
& aReductOfIn0(X1,xu,xR)
& aElement0(X1) )
| aReductOfIn0(xw,xu,xR) ) )
| xu = xw )
& aElement0(xw) ),
inference(rectify,[],[f22]) ).
fof(f33,plain,
~ ? [X0] :
( aNormalFormOfIn0(X0,xw,xR)
| ( ~ ? [X1] : aReductOfIn0(X1,X0,xR)
& ( sdtmndtasgtdt0(xw,xR,X0)
| sdtmndtplgtdt0(xw,xR,X0)
| ? [X2] :
( sdtmndtplgtdt0(X2,xR,X0)
& aReductOfIn0(X2,xw,xR)
& aElement0(X2) )
| aReductOfIn0(X0,xw,xR)
| xw = X0 )
& aElement0(X0) ) ),
inference(rectify,[],[f24]) ).
fof(f52,plain,
! [X0] :
( ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
| ~ aElement0(X1) )
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
| ~ aElement0(X1) )
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
( isTerminating0(xR)
& ! [X0,X1] :
( iLess0(X1,X0)
| ( ~ sdtmndtplgtdt0(X0,xR,X1)
& ! [X2] :
( ~ sdtmndtplgtdt0(X2,xR,X1)
| ~ aReductOfIn0(X2,X0,xR)
| ~ aElement0(X2) )
& ~ aReductOfIn0(X1,X0,xR) )
| ~ aElement0(X1)
| ~ aElement0(X0) )
& isLocallyConfluent0(xR)
& ! [X3,X4,X5] :
( ? [X6] :
( sdtmndtasgtdt0(X5,xR,X6)
& ( ( sdtmndtplgtdt0(X5,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aReductOfIn0(X7,X5,xR)
& aElement0(X7) )
| aReductOfIn0(X6,X5,xR) ) )
| X5 = X6 )
& sdtmndtasgtdt0(X4,xR,X6)
& ( ( sdtmndtplgtdt0(X4,xR,X6)
& ( ? [X8] :
( sdtmndtplgtdt0(X8,xR,X6)
& aReductOfIn0(X8,X4,xR)
& aElement0(X8) )
| aReductOfIn0(X6,X4,xR) ) )
| X4 = X6 )
& aElement0(X6) )
| ~ aReductOfIn0(X5,X3,xR)
| ~ aReductOfIn0(X4,X3,xR)
| ~ aElement0(X5)
| ~ aElement0(X4)
| ~ aElement0(X3) ) ),
inference(ennf_transformation,[],[f29]) ).
fof(f55,plain,
( isTerminating0(xR)
& ! [X0,X1] :
( iLess0(X1,X0)
| ( ~ sdtmndtplgtdt0(X0,xR,X1)
& ! [X2] :
( ~ sdtmndtplgtdt0(X2,xR,X1)
| ~ aReductOfIn0(X2,X0,xR)
| ~ aElement0(X2) )
& ~ aReductOfIn0(X1,X0,xR) )
| ~ aElement0(X1)
| ~ aElement0(X0) )
& isLocallyConfluent0(xR)
& ! [X3,X4,X5] :
( ? [X6] :
( sdtmndtasgtdt0(X5,xR,X6)
& ( ( sdtmndtplgtdt0(X5,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aReductOfIn0(X7,X5,xR)
& aElement0(X7) )
| aReductOfIn0(X6,X5,xR) ) )
| X5 = X6 )
& sdtmndtasgtdt0(X4,xR,X6)
& ( ( sdtmndtplgtdt0(X4,xR,X6)
& ( ? [X8] :
( sdtmndtplgtdt0(X8,xR,X6)
& aReductOfIn0(X8,X4,xR)
& aElement0(X8) )
| aReductOfIn0(X6,X4,xR) ) )
| X4 = X6 )
& aElement0(X6) )
| ~ aReductOfIn0(X5,X3,xR)
| ~ aReductOfIn0(X4,X3,xR)
| ~ aElement0(X5)
| ~ aElement0(X4)
| ~ aElement0(X3) ) ),
inference(flattening,[],[f54]) ).
fof(f58,plain,
! [X0] :
( ~ aNormalFormOfIn0(X0,xw,xR)
& ( ? [X1] : aReductOfIn0(X1,X0,xR)
| ( ~ sdtmndtasgtdt0(xw,xR,X0)
& ~ sdtmndtplgtdt0(xw,xR,X0)
& ! [X2] :
( ~ sdtmndtplgtdt0(X2,xR,X0)
| ~ aReductOfIn0(X2,xw,xR)
| ~ aElement0(X2) )
& ~ aReductOfIn0(X0,xw,xR)
& xw != X0 )
| ~ aElement0(X0) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f65,plain,
! [X6,X4] :
( ( sdtmndtplgtdt0(X4,xR,X6)
& ( ? [X8] :
( sdtmndtplgtdt0(X8,xR,X6)
& aReductOfIn0(X8,X4,xR)
& aElement0(X8) )
| aReductOfIn0(X6,X4,xR) ) )
| X4 = X6
| ~ sP4(X6,X4) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f66,plain,
( isTerminating0(xR)
& ! [X0,X1] :
( iLess0(X1,X0)
| ( ~ sdtmndtplgtdt0(X0,xR,X1)
& ! [X2] :
( ~ sdtmndtplgtdt0(X2,xR,X1)
| ~ aReductOfIn0(X2,X0,xR)
| ~ aElement0(X2) )
& ~ aReductOfIn0(X1,X0,xR) )
| ~ aElement0(X1)
| ~ aElement0(X0) )
& isLocallyConfluent0(xR)
& ! [X3,X4,X5] :
( ? [X6] :
( sdtmndtasgtdt0(X5,xR,X6)
& ( ( sdtmndtplgtdt0(X5,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aReductOfIn0(X7,X5,xR)
& aElement0(X7) )
| aReductOfIn0(X6,X5,xR) ) )
| X5 = X6 )
& sdtmndtasgtdt0(X4,xR,X6)
& sP4(X6,X4)
& aElement0(X6) )
| ~ aReductOfIn0(X5,X3,xR)
| ~ aReductOfIn0(X4,X3,xR)
| ~ aElement0(X5)
| ~ aElement0(X4)
| ~ aElement0(X3) ) ),
inference(definition_folding,[],[f55,f65]) ).
fof(f99,plain,
! [X0,X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
=> aNormalFormOfIn0(sK20(X0,X1),X1,X0) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( aNormalFormOfIn0(sK20(X0,X1),X1,X0)
| ~ aElement0(X1) )
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20])],[f53,f99]) ).
fof(f105,plain,
! [X4,X5] :
( ? [X6] :
( sdtmndtasgtdt0(X5,xR,X6)
& ( ( sdtmndtplgtdt0(X5,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aReductOfIn0(X7,X5,xR)
& aElement0(X7) )
| aReductOfIn0(X6,X5,xR) ) )
| X5 = X6 )
& sdtmndtasgtdt0(X4,xR,X6)
& sP4(X6,X4)
& aElement0(X6) )
=> ( sdtmndtasgtdt0(X5,xR,sK22(X4,X5))
& ( ( sdtmndtplgtdt0(X5,xR,sK22(X4,X5))
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,sK22(X4,X5))
& aReductOfIn0(X7,X5,xR)
& aElement0(X7) )
| aReductOfIn0(sK22(X4,X5),X5,xR) ) )
| sK22(X4,X5) = X5 )
& sdtmndtasgtdt0(X4,xR,sK22(X4,X5))
& sP4(sK22(X4,X5),X4)
& aElement0(sK22(X4,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
! [X4,X5] :
( ? [X7] :
( sdtmndtplgtdt0(X7,xR,sK22(X4,X5))
& aReductOfIn0(X7,X5,xR)
& aElement0(X7) )
=> ( sdtmndtplgtdt0(sK23(X4,X5),xR,sK22(X4,X5))
& aReductOfIn0(sK23(X4,X5),X5,xR)
& aElement0(sK23(X4,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
( isTerminating0(xR)
& ! [X0,X1] :
( iLess0(X1,X0)
| ( ~ sdtmndtplgtdt0(X0,xR,X1)
& ! [X2] :
( ~ sdtmndtplgtdt0(X2,xR,X1)
| ~ aReductOfIn0(X2,X0,xR)
| ~ aElement0(X2) )
& ~ aReductOfIn0(X1,X0,xR) )
| ~ aElement0(X1)
| ~ aElement0(X0) )
& isLocallyConfluent0(xR)
& ! [X3,X4,X5] :
( ( sdtmndtasgtdt0(X5,xR,sK22(X4,X5))
& ( ( sdtmndtplgtdt0(X5,xR,sK22(X4,X5))
& ( ( sdtmndtplgtdt0(sK23(X4,X5),xR,sK22(X4,X5))
& aReductOfIn0(sK23(X4,X5),X5,xR)
& aElement0(sK23(X4,X5)) )
| aReductOfIn0(sK22(X4,X5),X5,xR) ) )
| sK22(X4,X5) = X5 )
& sdtmndtasgtdt0(X4,xR,sK22(X4,X5))
& sP4(sK22(X4,X5),X4)
& aElement0(sK22(X4,X5)) )
| ~ aReductOfIn0(X5,X3,xR)
| ~ aReductOfIn0(X4,X3,xR)
| ~ aElement0(X5)
| ~ aElement0(X4)
| ~ aElement0(X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23])],[f66,f106,f105]) ).
fof(f126,plain,
( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xw)
& aReductOfIn0(X0,xv,xR)
& aElement0(X0) )
=> ( sdtmndtplgtdt0(sK31,xR,xw)
& aReductOfIn0(sK31,xv,xR)
& aElement0(sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xw)
& aReductOfIn0(X1,xu,xR)
& aElement0(X1) )
=> ( sdtmndtplgtdt0(sK32,xR,xw)
& aReductOfIn0(sK32,xu,xR)
& aElement0(sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( sdtmndtasgtdt0(xv,xR,xw)
& ( ( sdtmndtplgtdt0(xv,xR,xw)
& ( ( sdtmndtplgtdt0(sK31,xR,xw)
& aReductOfIn0(sK31,xv,xR)
& aElement0(sK31) )
| aReductOfIn0(xw,xv,xR) ) )
| xv = xw )
& sdtmndtasgtdt0(xu,xR,xw)
& ( ( sdtmndtplgtdt0(xu,xR,xw)
& ( ( sdtmndtplgtdt0(sK32,xR,xw)
& aReductOfIn0(sK32,xu,xR)
& aElement0(sK32) )
| aReductOfIn0(xw,xu,xR) ) )
| xu = xw )
& aElement0(xw) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32])],[f32,f127,f126]) ).
fof(f129,plain,
! [X0] :
( ? [X1] : aReductOfIn0(X1,X0,xR)
=> aReductOfIn0(sK33(X0),X0,xR) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
! [X0] :
( ~ aNormalFormOfIn0(X0,xw,xR)
& ( aReductOfIn0(sK33(X0),X0,xR)
| ( ~ sdtmndtasgtdt0(xw,xR,X0)
& ~ sdtmndtplgtdt0(xw,xR,X0)
& ! [X2] :
( ~ sdtmndtplgtdt0(X2,xR,X0)
| ~ aReductOfIn0(X2,xw,xR)
| ~ aElement0(X2) )
& ~ aReductOfIn0(X0,xw,xR)
& xw != X0 )
| ~ aElement0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK33])],[f58,f129]) ).
fof(f175,plain,
! [X0,X1] :
( aNormalFormOfIn0(sK20(X0,X1),X1,X0)
| ~ aElement0(X1)
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f176,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f193,plain,
isTerminating0(xR),
inference(cnf_transformation,[],[f107]) ).
fof(f241,plain,
aElement0(xw),
inference(cnf_transformation,[],[f128]) ).
fof(f257,plain,
! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
inference(cnf_transformation,[],[f130]) ).
cnf(c_93,plain,
( ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(sK20(X1,X0),X0,X1) ),
inference(cnf_transformation,[],[f175]) ).
cnf(c_94,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f176]) ).
cnf(c_99,plain,
isTerminating0(xR),
inference(cnf_transformation,[],[f193]) ).
cnf(c_169,plain,
aElement0(xw),
inference(cnf_transformation,[],[f241]) ).
cnf(c_170,negated_conjecture,
~ aNormalFormOfIn0(X0,xw,xR),
inference(cnf_transformation,[],[f257]) ).
cnf(c_2295,plain,
( sK20(X0,X1) != X2
| X0 != xR
| X1 != xw
| ~ aElement0(X1)
| ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0) ),
inference(resolution_lifted,[status(thm)],[c_93,c_170]) ).
cnf(c_2296,plain,
( ~ aElement0(xw)
| ~ aRewritingSystem0(xR)
| ~ isTerminating0(xR) ),
inference(unflattening,[status(thm)],[c_2295]) ).
cnf(c_2297,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2296,c_94,c_99,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : COM018+4 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Aug 29 13:00:16 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.86/1.07 % SZS status Started for theBenchmark.p
% 0.86/1.07 % SZS status Theorem for theBenchmark.p
% 0.86/1.07
% 0.86/1.07 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.86/1.07
% 0.86/1.07 ------ iProver source info
% 0.86/1.07
% 0.86/1.07 git: date: 2023-05-31 18:12:56 +0000
% 0.86/1.07 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.86/1.07 git: non_committed_changes: false
% 0.86/1.07 git: last_make_outside_of_git: false
% 0.86/1.07
% 0.86/1.07 ------ Parsing...
% 0.86/1.07 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.86/1.07
% 0.86/1.07 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s
% 0.86/1.07
% 0.86/1.07 % SZS status Theorem for theBenchmark.p
% 0.86/1.07
% 0.86/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.86/1.07
% 0.86/1.07
%------------------------------------------------------------------------------