TSTP Solution File: LAT381+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LAT381+1 : 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_uns --cores 0 -t %d %s
% Computer : n018.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:35:38 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 58 ( 20 unt; 0 def)
% Number of atoms : 186 ( 13 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 226 ( 98 ~; 93 |; 25 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 63 ( 59 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f173,plain,
$false,
inference(subsumption_resolution,[],[f172,f87]) ).
fof(f87,plain,
xu != xv,
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
xu != xv,
inference(flattening,[],[f18]) ).
fof(f18,negated_conjecture,
xu != xv,
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
xu = xv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f172,plain,
xu = xv,
inference(subsumption_resolution,[],[f171,f159]) ).
fof(f159,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f116,f103]) ).
fof(f103,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(subsumption_resolution,[],[f102,f60]) ).
fof(f60,plain,
aSet0(xT),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
aSet0(xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__725) ).
fof(f102,plain,
( aUpperBoundOfIn0(xv,xS,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f99,f77]) ).
fof(f77,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__725_01) ).
fof(f99,plain,
( ~ aSubsetOf0(xS,xT)
| aUpperBoundOfIn0(xv,xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f61,f76]) ).
fof(f76,plain,
! [X2,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| aUpperBoundOfIn0(X2,X1,X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ! [X2] :
( ( ( aUpperBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aUpperBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) )
& ( aSupremumOfIn0(X2,X1,X0)
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ( aUpperBoundOfIn0(sK2(X0,X1,X2),X1,X0)
& ~ sdtlseqdt0(X2,sK2(X0,X1,X2)) )
| ~ aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f42,f43]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ? [X4] :
( aUpperBoundOfIn0(X4,X1,X0)
& ~ sdtlseqdt0(X2,X4) )
=> ( aUpperBoundOfIn0(sK2(X0,X1,X2),X1,X0)
& ~ sdtlseqdt0(X2,sK2(X0,X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ! [X2] :
( ( ( aUpperBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aUpperBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) )
& ( aSupremumOfIn0(X2,X1,X0)
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ? [X4] :
( aUpperBoundOfIn0(X4,X1,X0)
& ~ sdtlseqdt0(X2,X4) )
| ~ aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(X1,X0) ) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ! [X2] :
( ( ( aUpperBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aUpperBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) )
& ( aSupremumOfIn0(X2,X1,X0)
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ? [X3] :
( aUpperBoundOfIn0(X3,X1,X0)
& ~ sdtlseqdt0(X2,X3) )
| ~ aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(X1,X0) ) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ! [X2] :
( ( ( aUpperBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aUpperBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) )
& ( aSupremumOfIn0(X2,X1,X0)
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ? [X3] :
( aUpperBoundOfIn0(X3,X1,X0)
& ~ sdtlseqdt0(X2,X3) )
| ~ aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(X1,X0) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ! [X2] :
( ( aUpperBoundOfIn0(X2,X1,X0)
& ! [X3] :
( ~ aUpperBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X0) )
<=> aSupremumOfIn0(X2,X1,X0) )
| ~ aSubsetOf0(X1,X0) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( ( aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0)
& ! [X3] :
( aUpperBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X2,X3) ) )
<=> aSupremumOfIn0(X2,X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSup) ).
fof(f61,plain,
aSupremumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f16,axiom,
( aSupremumOfIn0(xu,xS,xT)
& aSupremumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__744) ).
fof(f116,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xu,X0) ),
inference(subsumption_resolution,[],[f115,f60]) ).
fof(f115,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| ~ aSet0(xT)
| sdtlseqdt0(xu,X0) ),
inference(subsumption_resolution,[],[f110,f77]) ).
fof(f110,plain,
! [X0] :
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f62,f75]) ).
fof(f75,plain,
! [X2,X3,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| ~ aUpperBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X2,X3)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f62,plain,
aSupremumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f171,plain,
( ~ sdtlseqdt0(xu,xv)
| xu = xv ),
inference(subsumption_resolution,[],[f170,f121]) ).
fof(f121,plain,
aElement0(xv),
inference(subsumption_resolution,[],[f117,f60]) ).
fof(f117,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(resolution,[],[f107,f86]) ).
fof(f86,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| ~ aSet0(X0)
| aElement0(X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(f107,plain,
aElementOf0(xv,xT),
inference(subsumption_resolution,[],[f106,f60]) ).
fof(f106,plain,
( aElementOf0(xv,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f100,f77]) ).
fof(f100,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f61,f74]) ).
fof(f74,plain,
! [X2,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSet0(X0)
| aElementOf0(X2,X0)
| ~ aSubsetOf0(X1,X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f170,plain,
( ~ aElement0(xv)
| xu = xv
| ~ sdtlseqdt0(xu,xv) ),
inference(subsumption_resolution,[],[f169,f127]) ).
fof(f127,plain,
aElement0(xu),
inference(subsumption_resolution,[],[f123,f60]) ).
fof(f123,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(resolution,[],[f112,f86]) ).
fof(f112,plain,
aElementOf0(xu,xT),
inference(subsumption_resolution,[],[f111,f60]) ).
fof(f111,plain,
( aElementOf0(xu,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f109,f77]) ).
fof(f109,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| aElementOf0(xu,xT) ),
inference(resolution,[],[f62,f74]) ).
fof(f169,plain,
( ~ aElement0(xu)
| ~ aElement0(xv)
| xu = xv
| ~ sdtlseqdt0(xu,xv) ),
inference(resolution,[],[f152,f88]) ).
fof(f88,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1,X0] :
( ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).
fof(f152,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f105,f114]) ).
fof(f114,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(subsumption_resolution,[],[f113,f60]) ).
fof(f113,plain,
( ~ aSet0(xT)
| aUpperBoundOfIn0(xu,xS,xT) ),
inference(subsumption_resolution,[],[f108,f77]) ).
fof(f108,plain,
( aUpperBoundOfIn0(xu,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f62,f76]) ).
fof(f105,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xv,X0) ),
inference(subsumption_resolution,[],[f104,f60]) ).
fof(f104,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xv,X0)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f101,f77]) ).
fof(f101,plain,
! [X0] :
( sdtlseqdt0(xv,X0)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(resolution,[],[f61,f75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LAT381+1 : 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_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n018.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 : Tue Aug 30 01:29:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (10587)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.51 % (10586)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (10593)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.52 % (10594)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (10585)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52 % (10595)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.52 % (10584)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52 % (10600)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52 % (10605)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.52 % (10584)First to succeed.
% 0.20/0.52 % (10587)Also succeeded, but the first one will report.
% 0.20/0.52 % (10584)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (10584)------------------------------
% 0.20/0.52 % (10584)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (10584)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (10584)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (10584)Memory used [KB]: 6012
% 0.20/0.52 % (10584)Time elapsed: 0.112 s
% 0.20/0.52 % (10584)Instructions burned: 5 (million)
% 0.20/0.52 % (10584)------------------------------
% 0.20/0.52 % (10584)------------------------------
% 0.20/0.52 % (10579)Success in time 0.168 s
%------------------------------------------------------------------------------