TSTP Solution File: COM018+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n026.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 31 15:53:47 EDT 2022
% Result : Theorem 1.56s 0.60s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 45 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 389 ( 26 equ)
% Maximal formula atoms : 30 ( 9 avg)
% Number of connectives : 461 ( 114 ~; 140 |; 193 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 116 ( 71 !; 45 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ35_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_21,type,
sQ36_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_22,type,
sQ37_eqProxy: ( $real * $real ) > $o ).
fof(f601,plain,
$false,
inference(subsumption_resolution,[],[f591,f343]) ).
fof(f343,plain,
aElement0(xw),
inference(literal_reordering,[],[f224]) ).
fof(f224,plain,
aElement0(xw),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
( sdtmndtasgtdt0(xu,xR,xw)
& sdtmndtasgtdt0(xv,xR,xw)
& ( xu = xw
| ( ( ( sdtmndtplgtdt0(sK26,xR,xw)
& aReductOfIn0(sK26,xu,xR)
& aElement0(sK26) )
| aReductOfIn0(xw,xu,xR) )
& sdtmndtplgtdt0(xu,xR,xw) ) )
& aElement0(xw)
& ( ( sdtmndtplgtdt0(xv,xR,xw)
& ( aReductOfIn0(xw,xv,xR)
| ( aElement0(sK27)
& aReductOfIn0(sK27,xv,xR)
& sdtmndtplgtdt0(sK27,xR,xw) ) ) )
| xv = xw ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26,sK27])],[f39,f116,f115]) ).
fof(f115,plain,
( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xw)
& aReductOfIn0(X0,xu,xR)
& aElement0(X0) )
=> ( sdtmndtplgtdt0(sK26,xR,xw)
& aReductOfIn0(sK26,xu,xR)
& aElement0(sK26) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xv,xR)
& sdtmndtplgtdt0(X1,xR,xw) )
=> ( aElement0(sK27)
& aReductOfIn0(sK27,xv,xR)
& sdtmndtplgtdt0(sK27,xR,xw) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
( sdtmndtasgtdt0(xu,xR,xw)
& sdtmndtasgtdt0(xv,xR,xw)
& ( xu = xw
| ( ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xw)
& aReductOfIn0(X0,xu,xR)
& aElement0(X0) )
| aReductOfIn0(xw,xu,xR) )
& sdtmndtplgtdt0(xu,xR,xw) ) )
& aElement0(xw)
& ( ( sdtmndtplgtdt0(xv,xR,xw)
& ( aReductOfIn0(xw,xv,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xv,xR)
& sdtmndtplgtdt0(X1,xR,xw) ) ) )
| xv = xw ) ),
inference(rectify,[],[f22]) ).
fof(f22,axiom,
( sdtmndtasgtdt0(xu,xR,xw)
& ( xu = xw
| ( ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xw)
& aReductOfIn0(X0,xu,xR)
& aElement0(X0) )
| aReductOfIn0(xw,xu,xR) )
& sdtmndtplgtdt0(xu,xR,xw) ) )
& aElement0(xw)
& ( xv = xw
| ( ( ? [X0] :
( aReductOfIn0(X0,xv,xR)
& aElement0(X0)
& sdtmndtplgtdt0(X0,xR,xw) )
| aReductOfIn0(xw,xv,xR) )
& sdtmndtplgtdt0(xv,xR,xw) ) )
& sdtmndtasgtdt0(xv,xR,xw) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__799) ).
fof(f591,plain,
~ aElement0(xw),
inference(resolution,[],[f553,f324]) ).
fof(f324,plain,
! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
inference(literal_reordering,[],[f156]) ).
fof(f156,plain,
! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
! [X0] :
( ( ( ~ sdtmndtasgtdt0(xw,xR,X0)
& xw != X0
& ~ aReductOfIn0(X0,xw,xR)
& ! [X1] :
( ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,xR,X0)
| ~ aReductOfIn0(X1,xw,xR) )
& ~ sdtmndtplgtdt0(xw,xR,X0) )
| aReductOfIn0(sK11(X0),X0,xR)
| ~ aElement0(X0) )
& ~ aNormalFormOfIn0(X0,xw,xR) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f85,f86]) ).
fof(f86,plain,
! [X0] :
( ? [X2] : aReductOfIn0(X2,X0,xR)
=> aReductOfIn0(sK11(X0),X0,xR) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
! [X0] :
( ( ( ~ sdtmndtasgtdt0(xw,xR,X0)
& xw != X0
& ~ aReductOfIn0(X0,xw,xR)
& ! [X1] :
( ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,xR,X0)
| ~ aReductOfIn0(X1,xw,xR) )
& ~ sdtmndtplgtdt0(xw,xR,X0) )
| ? [X2] : aReductOfIn0(X2,X0,xR)
| ~ aElement0(X0) )
& ~ aNormalFormOfIn0(X0,xw,xR) ),
inference(rectify,[],[f56]) ).
fof(f56,plain,
! [X0] :
( ( ( ~ sdtmndtasgtdt0(xw,xR,X0)
& xw != X0
& ~ aReductOfIn0(X0,xw,xR)
& ! [X2] :
( ~ aElement0(X2)
| ~ sdtmndtplgtdt0(X2,xR,X0)
| ~ aReductOfIn0(X2,xw,xR) )
& ~ sdtmndtplgtdt0(xw,xR,X0) )
| ? [X1] : aReductOfIn0(X1,X0,xR)
| ~ aElement0(X0) )
& ~ aNormalFormOfIn0(X0,xw,xR) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
~ ? [X0] :
( ( ~ ? [X1] : aReductOfIn0(X1,X0,xR)
& ( aReductOfIn0(X0,xw,xR)
| sdtmndtasgtdt0(xw,xR,X0)
| sdtmndtplgtdt0(xw,xR,X0)
| ? [X2] :
( aReductOfIn0(X2,xw,xR)
& sdtmndtplgtdt0(X2,xR,X0)
& aElement0(X2) )
| xw = X0 )
& aElement0(X0) )
| aNormalFormOfIn0(X0,xw,xR) ),
inference(rectify,[],[f24]) ).
fof(f24,negated_conjecture,
~ ? [X0] :
( aNormalFormOfIn0(X0,xw,xR)
| ( ~ ? [X1] : aReductOfIn0(X1,X0,xR)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,X0)
& aElement0(X1)
& aReductOfIn0(X1,xw,xR) )
| aReductOfIn0(X0,xw,xR)
| sdtmndtasgtdt0(xw,xR,X0)
| xw = X0
| sdtmndtplgtdt0(xw,xR,X0) )
& aElement0(X0) ) ),
inference(negated_conjecture,[],[f23]) ).
fof(f23,conjecture,
? [X0] :
( aNormalFormOfIn0(X0,xw,xR)
| ( ~ ? [X1] : aReductOfIn0(X1,X0,xR)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,X0)
& aElement0(X1)
& aReductOfIn0(X1,xw,xR) )
| aReductOfIn0(X0,xw,xR)
| sdtmndtasgtdt0(xw,xR,X0)
| xw = X0
| sdtmndtplgtdt0(xw,xR,X0) )
& aElement0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f553,plain,
! [X0] :
( aNormalFormOfIn0(sK28(xR,X0),X0,xR)
| ~ aElement0(X0) ),
inference(subsumption_resolution,[],[f552,f365]) ).
fof(f365,plain,
isTerminating0(xR),
inference(literal_reordering,[],[f188]) ).
fof(f188,plain,
isTerminating0(xR),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
( ! [X0,X1,X2] :
( ( ( sK19(X0,X2) = X2
| ( sdtmndtplgtdt0(X2,xR,sK19(X0,X2))
& ( ( sdtmndtplgtdt0(sK20(X0,X2),xR,sK19(X0,X2))
& aElement0(sK20(X0,X2))
& aReductOfIn0(sK20(X0,X2),X2,xR) )
| aReductOfIn0(sK19(X0,X2),X2,xR) ) ) )
& sP2(sK19(X0,X2),X0)
& aElement0(sK19(X0,X2))
& sdtmndtasgtdt0(X0,xR,sK19(X0,X2))
& sdtmndtasgtdt0(X2,xR,sK19(X0,X2)) )
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aReductOfIn0(X2,X1,xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(X0,X1,xR) )
& isTerminating0(xR)
& ! [X5,X6] :
( ~ aElement0(X5)
| ~ aElement0(X6)
| iLess0(X5,X6)
| ( ~ sdtmndtplgtdt0(X6,xR,X5)
& ~ aReductOfIn0(X5,X6,xR)
& ! [X7] :
( ~ aElement0(X7)
| ~ sdtmndtplgtdt0(X7,xR,X5)
| ~ aReductOfIn0(X7,X6,xR) ) ) )
& isLocallyConfluent0(xR) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20])],[f103,f105,f104]) ).
fof(f104,plain,
! [X0,X2] :
( ? [X3] :
( ( X2 = X3
| ( sdtmndtplgtdt0(X2,xR,X3)
& ( ? [X4] :
( sdtmndtplgtdt0(X4,xR,X3)
& aElement0(X4)
& aReductOfIn0(X4,X2,xR) )
| aReductOfIn0(X3,X2,xR) ) ) )
& sP2(X3,X0)
& aElement0(X3)
& sdtmndtasgtdt0(X0,xR,X3)
& sdtmndtasgtdt0(X2,xR,X3) )
=> ( ( sK19(X0,X2) = X2
| ( sdtmndtplgtdt0(X2,xR,sK19(X0,X2))
& ( ? [X4] :
( sdtmndtplgtdt0(X4,xR,sK19(X0,X2))
& aElement0(X4)
& aReductOfIn0(X4,X2,xR) )
| aReductOfIn0(sK19(X0,X2),X2,xR) ) ) )
& sP2(sK19(X0,X2),X0)
& aElement0(sK19(X0,X2))
& sdtmndtasgtdt0(X0,xR,sK19(X0,X2))
& sdtmndtasgtdt0(X2,xR,sK19(X0,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
! [X0,X2] :
( ? [X4] :
( sdtmndtplgtdt0(X4,xR,sK19(X0,X2))
& aElement0(X4)
& aReductOfIn0(X4,X2,xR) )
=> ( sdtmndtplgtdt0(sK20(X0,X2),xR,sK19(X0,X2))
& aElement0(sK20(X0,X2))
& aReductOfIn0(sK20(X0,X2),X2,xR) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
( ! [X0,X1,X2] :
( ? [X3] :
( ( X2 = X3
| ( sdtmndtplgtdt0(X2,xR,X3)
& ( ? [X4] :
( sdtmndtplgtdt0(X4,xR,X3)
& aElement0(X4)
& aReductOfIn0(X4,X2,xR) )
| aReductOfIn0(X3,X2,xR) ) ) )
& sP2(X3,X0)
& aElement0(X3)
& sdtmndtasgtdt0(X0,xR,X3)
& sdtmndtasgtdt0(X2,xR,X3) )
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aReductOfIn0(X2,X1,xR)
| ~ aElement0(X0)
| ~ aReductOfIn0(X0,X1,xR) )
& isTerminating0(xR)
& ! [X5,X6] :
( ~ aElement0(X5)
| ~ aElement0(X6)
| iLess0(X5,X6)
| ( ~ sdtmndtplgtdt0(X6,xR,X5)
& ~ aReductOfIn0(X5,X6,xR)
& ! [X7] :
( ~ aElement0(X7)
| ~ sdtmndtplgtdt0(X7,xR,X5)
| ~ aReductOfIn0(X7,X6,xR) ) ) )
& isLocallyConfluent0(xR) ),
inference(rectify,[],[f69]) ).
fof(f69,plain,
( ! [X3,X5,X4] :
( ? [X6] :
( ( X4 = X6
| ( sdtmndtplgtdt0(X4,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aElement0(X7)
& aReductOfIn0(X7,X4,xR) )
| aReductOfIn0(X6,X4,xR) ) ) )
& sP2(X6,X3)
& aElement0(X6)
& sdtmndtasgtdt0(X3,xR,X6)
& sdtmndtasgtdt0(X4,xR,X6) )
| ~ aElement0(X5)
| ~ aElement0(X4)
| ~ aReductOfIn0(X4,X5,xR)
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,X5,xR) )
& isTerminating0(xR)
& ! [X0,X1] :
( ~ aElement0(X0)
| ~ aElement0(X1)
| iLess0(X0,X1)
| ( ~ sdtmndtplgtdt0(X1,xR,X0)
& ~ aReductOfIn0(X0,X1,xR)
& ! [X2] :
( ~ aElement0(X2)
| ~ sdtmndtplgtdt0(X2,xR,X0)
| ~ aReductOfIn0(X2,X1,xR) ) ) )
& isLocallyConfluent0(xR) ),
inference(definition_folding,[],[f49,f68]) ).
fof(f68,plain,
! [X6,X3] :
( ( sdtmndtplgtdt0(X3,xR,X6)
& ( aReductOfIn0(X6,X3,xR)
| ? [X8] :
( aReductOfIn0(X8,X3,xR)
& sdtmndtplgtdt0(X8,xR,X6)
& aElement0(X8) ) ) )
| X3 = X6
| ~ sP2(X6,X3) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f49,plain,
( ! [X3,X5,X4] :
( ? [X6] :
( ( X4 = X6
| ( sdtmndtplgtdt0(X4,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aElement0(X7)
& aReductOfIn0(X7,X4,xR) )
| aReductOfIn0(X6,X4,xR) ) ) )
& ( ( sdtmndtplgtdt0(X3,xR,X6)
& ( aReductOfIn0(X6,X3,xR)
| ? [X8] :
( aReductOfIn0(X8,X3,xR)
& sdtmndtplgtdt0(X8,xR,X6)
& aElement0(X8) ) ) )
| X3 = X6 )
& aElement0(X6)
& sdtmndtasgtdt0(X3,xR,X6)
& sdtmndtasgtdt0(X4,xR,X6) )
| ~ aElement0(X5)
| ~ aElement0(X4)
| ~ aReductOfIn0(X4,X5,xR)
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,X5,xR) )
& isTerminating0(xR)
& ! [X0,X1] :
( ~ aElement0(X0)
| ~ aElement0(X1)
| iLess0(X0,X1)
| ( ~ sdtmndtplgtdt0(X1,xR,X0)
& ~ aReductOfIn0(X0,X1,xR)
& ! [X2] :
( ~ aElement0(X2)
| ~ sdtmndtplgtdt0(X2,xR,X0)
| ~ aReductOfIn0(X2,X1,xR) ) ) )
& isLocallyConfluent0(xR) ),
inference(flattening,[],[f48]) ).
fof(f48,plain,
( isTerminating0(xR)
& isLocallyConfluent0(xR)
& ! [X0,X1] :
( iLess0(X0,X1)
| ( ~ sdtmndtplgtdt0(X1,xR,X0)
& ~ aReductOfIn0(X0,X1,xR)
& ! [X2] :
( ~ aElement0(X2)
| ~ sdtmndtplgtdt0(X2,xR,X0)
| ~ aReductOfIn0(X2,X1,xR) ) )
| ~ aElement0(X0)
| ~ aElement0(X1) )
& ! [X3,X4,X5] :
( ? [X6] :
( ( X4 = X6
| ( sdtmndtplgtdt0(X4,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aElement0(X7)
& aReductOfIn0(X7,X4,xR) )
| aReductOfIn0(X6,X4,xR) ) ) )
& ( ( sdtmndtplgtdt0(X3,xR,X6)
& ( aReductOfIn0(X6,X3,xR)
| ? [X8] :
( aReductOfIn0(X8,X3,xR)
& sdtmndtplgtdt0(X8,xR,X6)
& aElement0(X8) ) ) )
| X3 = X6 )
& aElement0(X6)
& sdtmndtasgtdt0(X3,xR,X6)
& sdtmndtasgtdt0(X4,xR,X6) )
| ~ aReductOfIn0(X4,X5,xR)
| ~ aElement0(X5)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aReductOfIn0(X3,X5,xR) ) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,plain,
( isTerminating0(xR)
& isLocallyConfluent0(xR)
& ! [X0,X1] :
( ( aElement0(X0)
& aElement0(X1) )
=> ( ( sdtmndtplgtdt0(X1,xR,X0)
| aReductOfIn0(X0,X1,xR)
| ? [X2] :
( aReductOfIn0(X2,X1,xR)
& sdtmndtplgtdt0(X2,xR,X0)
& aElement0(X2) ) )
=> iLess0(X0,X1) ) )
& ! [X3,X4,X5] :
( ( aReductOfIn0(X4,X5,xR)
& aElement0(X5)
& aElement0(X4)
& aElement0(X3)
& aReductOfIn0(X3,X5,xR) )
=> ? [X6] :
( ( X4 = X6
| ( sdtmndtplgtdt0(X4,xR,X6)
& ( ? [X7] :
( sdtmndtplgtdt0(X7,xR,X6)
& aElement0(X7)
& aReductOfIn0(X7,X4,xR) )
| aReductOfIn0(X6,X4,xR) ) ) )
& ( ( sdtmndtplgtdt0(X3,xR,X6)
& ( aReductOfIn0(X6,X3,xR)
| ? [X8] :
( aReductOfIn0(X8,X3,xR)
& sdtmndtplgtdt0(X8,xR,X6)
& aElement0(X8) ) ) )
| X3 = X6 )
& aElement0(X6)
& sdtmndtasgtdt0(X3,xR,X6)
& sdtmndtasgtdt0(X4,xR,X6) ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
( isTerminating0(xR)
& ! [X1,X0] :
( ( aElement0(X0)
& aElement0(X1) )
=> ( ( aReductOfIn0(X1,X0,xR)
| sdtmndtplgtdt0(X0,xR,X1)
| ? [X2] :
( sdtmndtplgtdt0(X2,xR,X1)
& aElement0(X2)
& aReductOfIn0(X2,X0,xR) ) )
=> iLess0(X1,X0) ) )
& isLocallyConfluent0(xR)
& ! [X2,X1,X0] :
( ( aElement0(X1)
& aReductOfIn0(X1,X0,xR)
& aReductOfIn0(X2,X0,xR)
& aElement0(X2)
& aElement0(X0) )
=> ? [X3] :
( ( X1 = X3
| ( ( ? [X4] :
( aReductOfIn0(X4,X1,xR)
& sdtmndtplgtdt0(X4,xR,X3)
& aElement0(X4) )
| aReductOfIn0(X3,X1,xR) )
& sdtmndtplgtdt0(X1,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3)
& aElement0(X3)
& sdtmndtasgtdt0(X1,xR,X3)
& ( ( ( aReductOfIn0(X3,X2,xR)
| ? [X4] :
( sdtmndtplgtdt0(X4,xR,X3)
& aElement0(X4)
& aReductOfIn0(X4,X2,xR) ) )
& sdtmndtplgtdt0(X2,xR,X3) )
| X2 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656_01) ).
fof(f552,plain,
! [X0] :
( aNormalFormOfIn0(sK28(xR,X0),X0,xR)
| ~ aElement0(X0)
| ~ isTerminating0(xR) ),
inference(resolution,[],[f292,f325]) ).
fof(f325,plain,
aRewritingSystem0(xR),
inference(literal_reordering,[],[f239]) ).
fof(f239,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656) ).
fof(f292,plain,
! [X0,X1] :
( ~ aRewritingSystem0(X0)
| aNormalFormOfIn0(sK28(X0,X1),X1,X0)
| ~ aElement0(X1)
| ~ isTerminating0(X0) ),
inference(literal_reordering,[],[f231]) ).
fof(f231,plain,
! [X0,X1] :
( ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0)
| aNormalFormOfIn0(sK28(X0,X1),X1,X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ~ isTerminating0(X0)
| ! [X1] :
( ~ aElement0(X1)
| aNormalFormOfIn0(sK28(X0,X1),X1,X0) )
| ~ aRewritingSystem0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28])],[f55,f118]) ).
fof(f118,plain,
! [X0,X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
=> aNormalFormOfIn0(sK28(X0,X1),X1,X0) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
! [X0] :
( ~ isTerminating0(X0)
| ! [X1] :
( ~ aElement0(X1)
| ? [X2] : aNormalFormOfIn0(X2,X1,X0) )
| ~ aRewritingSystem0(X0) ),
inference(flattening,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ! [X1] :
( ~ aElement0(X1)
| ? [X2] : aNormalFormOfIn0(X2,X1,X0) )
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0] :
( ( isTerminating0(X0)
& aRewritingSystem0(X0) )
=> ! [X1] :
( aElement0(X1)
=> ? [X2] : aNormalFormOfIn0(X2,X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTermNF) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 29 17:20:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.53 % (10315)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (10331)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.56 % (10323)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.56 % (10317)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.56 % (10317)Instruction limit reached!
% 0.20/0.56 % (10317)------------------------------
% 0.20/0.56 % (10317)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (10317)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (10317)Termination reason: Unknown
% 0.20/0.56 % (10317)Termination phase: Preprocessing 2
% 0.20/0.56
% 0.20/0.56 % (10317)Memory used [KB]: 895
% 0.20/0.56 % (10317)Time elapsed: 0.004 s
% 0.20/0.56 % (10317)Instructions burned: 2 (million)
% 0.20/0.56 % (10317)------------------------------
% 0.20/0.56 % (10317)------------------------------
% 0.20/0.57 % (10333)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.57 % (10325)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.57 TRYING [1]
% 0.20/0.58 % (10316)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.58 TRYING [2]
% 0.20/0.58 TRYING [3]
% 0.20/0.59 % (10323)First to succeed.
% 1.56/0.59 % (10311)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.56/0.59 % (10326)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.56/0.59 % (10328)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.56/0.60 % (10327)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.56/0.60 % (10323)Refutation found. Thanks to Tanya!
% 1.56/0.60 % SZS status Theorem for theBenchmark
% 1.56/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.56/0.60 % (10323)------------------------------
% 1.56/0.60 % (10323)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.56/0.60 % (10323)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.56/0.60 % (10323)Termination reason: Refutation
% 1.56/0.60
% 1.56/0.60 % (10323)Memory used [KB]: 6140
% 1.56/0.60 % (10323)Time elapsed: 0.019 s
% 1.56/0.60 % (10323)Instructions burned: 16 (million)
% 1.56/0.60 % (10323)------------------------------
% 1.56/0.60 % (10323)------------------------------
% 1.56/0.60 % (10308)Success in time 0.234 s
%------------------------------------------------------------------------------