TSTP Solution File: LAT388+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LAT388+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 : n006.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 17:37:37 EDT 2022
% Result : Theorem 1.65s 0.57s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 3 unt; 0 def)
% Number of atoms : 146 ( 5 equ)
% Maximal formula atoms : 12 ( 8 avg)
% Number of connectives : 174 ( 46 ~; 33 |; 78 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 32 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f299,plain,
$false,
inference(subsumption_resolution,[],[f172,f261]) ).
fof(f261,plain,
! [X0] : ~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( ~ aElementOf0(X0,xS)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ~ aElementOf0(X0,xS)
| ( aElementOf0(sK19(X0),xT)
& ~ sdtlseqdt0(sK19(X0),X0) ) ) )
| sP3(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f89,f146]) ).
fof(f146,plain,
! [X0] :
( ? [X1] :
( aElementOf0(X1,xT)
& ~ sdtlseqdt0(X1,X0) )
=> ( aElementOf0(sK19(X0),xT)
& ~ sdtlseqdt0(sK19(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( ~ aElementOf0(X0,xS)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ~ aElementOf0(X0,xS)
| ? [X1] :
( aElementOf0(X1,xT)
& ~ sdtlseqdt0(X1,X0) ) ) )
| sP3(X0) ) ),
inference(definition_folding,[],[f53,f88]) ).
fof(f88,plain,
! [X0] :
( ? [X2] :
( aUpperBoundOfIn0(X2,xT,xS)
& aElementOf0(X2,xS)
& ~ sdtlseqdt0(X0,X2)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aElementOf0(X3,xT) ) )
| ~ sP3(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f53,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( ~ aElementOf0(X0,xS)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ~ aElementOf0(X0,xS)
| ? [X1] :
( aElementOf0(X1,xT)
& ~ sdtlseqdt0(X1,X0) ) ) )
| ? [X2] :
( aUpperBoundOfIn0(X2,xT,xS)
& aElementOf0(X2,xS)
& ~ sdtlseqdt0(X0,X2)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aElementOf0(X3,xT) ) ) ) ),
inference(flattening,[],[f52]) ).
fof(f52,plain,
! [X0] :
( ( ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ~ aElementOf0(X0,xS)
| ? [X1] :
( aElementOf0(X1,xT)
& ~ sdtlseqdt0(X1,X0) ) ) )
| ? [X2] :
( ~ sdtlseqdt0(X0,X2)
& aUpperBoundOfIn0(X2,xT,xS)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aElementOf0(X3,xT) )
& aElementOf0(X2,xS) )
| ~ aElementOf0(X0,xS) )
& ~ aSupremumOfIn0(X0,xT,xS) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
~ ? [X0] :
( ( ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
& ! [X2] :
( ( aUpperBoundOfIn0(X2,xT,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aElementOf0(X2,xS) )
=> sdtlseqdt0(X0,X2) )
& aElementOf0(X0,xS) )
| aSupremumOfIn0(X0,xT,xS) ),
inference(rectify,[],[f32]) ).
fof(f32,negated_conjecture,
~ ? [X0] :
( aSupremumOfIn0(X0,xT,xS)
| ( ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
& ! [X1] :
( ( aElementOf0(X1,xS)
& aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
=> sdtlseqdt0(X0,X1) )
& aElementOf0(X0,xS) ) ),
inference(negated_conjecture,[],[f31]) ).
fof(f31,conjecture,
? [X0] :
( aSupremumOfIn0(X0,xT,xS)
| ( ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
& ! [X1] :
( ( aElementOf0(X1,xS)
& aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
=> sdtlseqdt0(X0,X1) )
& aElementOf0(X0,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f172,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[],[f92]) ).
fof(f92,plain,
( aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aSupremumOfIn0(xp,xT,xS)
& aUpperBoundOfIn0(xp,xT,xS)
& aElementOf0(xp,szDzozmdt0(xf))
& ! [X0] :
( ~ aElementOf0(X0,xT)
| sdtlseqdt0(X0,xp) )
& ! [X1] :
( sdtlseqdt0(xp,X1)
| ( ~ aUpperBoundOfIn0(X1,xT,xS)
& ( ~ aElementOf0(X1,xS)
| ( ~ sdtlseqdt0(sK4(X1),X1)
& aElementOf0(sK4(X1),xT) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f90,f91]) ).
fof(f91,plain,
! [X1] :
( ? [X2] :
( ~ sdtlseqdt0(X2,X1)
& aElementOf0(X2,xT) )
=> ( ~ sdtlseqdt0(sK4(X1),X1)
& aElementOf0(sK4(X1),xT) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
( aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aSupremumOfIn0(xp,xT,xS)
& aUpperBoundOfIn0(xp,xT,xS)
& aElementOf0(xp,szDzozmdt0(xf))
& ! [X0] :
( ~ aElementOf0(X0,xT)
| sdtlseqdt0(X0,xp) )
& ! [X1] :
( sdtlseqdt0(xp,X1)
| ( ~ aUpperBoundOfIn0(X1,xT,xS)
& ( ~ aElementOf0(X1,xS)
| ? [X2] :
( ~ sdtlseqdt0(X2,X1)
& aElementOf0(X2,xT) ) ) ) ) ),
inference(rectify,[],[f60]) ).
fof(f60,plain,
( aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aSupremumOfIn0(xp,xT,xS)
& aUpperBoundOfIn0(xp,xT,xS)
& aElementOf0(xp,szDzozmdt0(xf))
& ! [X2] :
( ~ aElementOf0(X2,xT)
| sdtlseqdt0(X2,xp) )
& ! [X0] :
( sdtlseqdt0(xp,X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ~ aElementOf0(X0,xS)
| ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) ) ) ) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
( xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf))
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& aFixedPointOf0(xp,xf)
& aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( ( ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) )
| aUpperBoundOfIn0(X0,xT,xS) )
=> sdtlseqdt0(xp,X0) ) ),
inference(rectify,[],[f30]) ).
fof(f30,axiom,
( ! [X0] :
( ( ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) )
| aUpperBoundOfIn0(X0,xT,xS) )
=> sdtlseqdt0(xp,X0) )
& aUpperBoundOfIn0(xp,xT,xS)
& aFixedPointOf0(xp,xf)
& aElementOf0(xp,szDzozmdt0(xf))
& aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( aElementOf0(X0,xT)
=> sdtlseqdt0(X0,xp) )
& xp = sdtlpdtrp0(xf,xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT388+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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.12/0.34 % Computer : n006.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 : Tue Aug 30 01:25:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.50/0.55 % (18444)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.50/0.55 % (18436)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.65/0.56 % (18428)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.65/0.57 % (18436)First to succeed.
% 1.65/0.57 % (18444)Also succeeded, but the first one will report.
% 1.65/0.57 % (18424)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.65/0.57 % (18436)Refutation found. Thanks to Tanya!
% 1.65/0.57 % SZS status Theorem for theBenchmark
% 1.65/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.65/0.57 % (18436)------------------------------
% 1.65/0.57 % (18436)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.65/0.57 % (18436)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.65/0.57 % (18436)Termination reason: Refutation
% 1.65/0.57
% 1.65/0.57 % (18436)Memory used [KB]: 1151
% 1.65/0.57 % (18436)Time elapsed: 0.013 s
% 1.65/0.57 % (18436)Instructions burned: 6 (million)
% 1.65/0.57 % (18436)------------------------------
% 1.65/0.57 % (18436)------------------------------
% 1.65/0.57 % (18420)Success in time 0.221 s
%------------------------------------------------------------------------------