TSTP Solution File: LAT381+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LAT381+3 : 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 : n004.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:39 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 16 unt; 0 def)
% Number of atoms : 185 ( 11 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 206 ( 59 ~; 48 |; 79 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 50 ( 44 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f224,plain,
$false,
inference(subsumption_resolution,[],[f223,f145]) ).
fof(f145,plain,
aElement0(xv),
inference(subsumption_resolution,[],[f143,f99]) ).
fof(f99,plain,
aSet0(xT),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
aSet0(xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__725) ).
fof(f143,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(resolution,[],[f107,f78]) ).
fof(f78,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
( ! [X0] :
( sdtlseqdt0(X0,xu)
| ~ aElementOf0(X0,xS) )
& aElementOf0(xv,xT)
& ! [X1] :
( ( ( ( aElementOf0(sK0(X1),xS)
& ~ sdtlseqdt0(sK0(X1),X1) )
| ~ aElementOf0(X1,xT) )
& ~ aUpperBoundOfIn0(X1,xS,xT) )
| sdtlseqdt0(xu,X1) )
& ! [X3] :
( sdtlseqdt0(X3,xv)
| ~ aElementOf0(X3,xS) )
& aElementOf0(xu,xT)
& ! [X4] :
( sdtlseqdt0(xv,X4)
| ( ~ aUpperBoundOfIn0(X4,xS,xT)
& ( ~ aElementOf0(X4,xT)
| ( aElementOf0(sK1(X4),xS)
& ~ sdtlseqdt0(sK1(X4),X4) ) ) ) )
& aElementOf0(xv,xT)
& aUpperBoundOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xu,xT)
& aSupremumOfIn0(xv,xS,xT)
& aUpperBoundOfIn0(xu,xS,xT) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f40,f42,f41]) ).
fof(f41,plain,
! [X1] :
( ? [X2] :
( aElementOf0(X2,xS)
& ~ sdtlseqdt0(X2,X1) )
=> ( aElementOf0(sK0(X1),xS)
& ~ sdtlseqdt0(sK0(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X4] :
( ? [X5] :
( aElementOf0(X5,xS)
& ~ sdtlseqdt0(X5,X4) )
=> ( aElementOf0(sK1(X4),xS)
& ~ sdtlseqdt0(sK1(X4),X4) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
( ! [X0] :
( sdtlseqdt0(X0,xu)
| ~ aElementOf0(X0,xS) )
& aElementOf0(xv,xT)
& ! [X1] :
( ( ( ? [X2] :
( aElementOf0(X2,xS)
& ~ sdtlseqdt0(X2,X1) )
| ~ aElementOf0(X1,xT) )
& ~ aUpperBoundOfIn0(X1,xS,xT) )
| sdtlseqdt0(xu,X1) )
& ! [X3] :
( sdtlseqdt0(X3,xv)
| ~ aElementOf0(X3,xS) )
& aElementOf0(xu,xT)
& ! [X4] :
( sdtlseqdt0(xv,X4)
| ( ~ aUpperBoundOfIn0(X4,xS,xT)
& ( ~ aElementOf0(X4,xT)
| ? [X5] :
( aElementOf0(X5,xS)
& ~ sdtlseqdt0(X5,X4) ) ) ) )
& aElementOf0(xv,xT)
& aUpperBoundOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xu,xT)
& aSupremumOfIn0(xv,xS,xT)
& aUpperBoundOfIn0(xu,xS,xT) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
( ! [X5] :
( sdtlseqdt0(X5,xu)
| ~ aElementOf0(X5,xS) )
& aElementOf0(xv,xT)
& ! [X0] :
( ( ( ? [X1] :
( aElementOf0(X1,xS)
& ~ sdtlseqdt0(X1,X0) )
| ~ aElementOf0(X0,xT) )
& ~ aUpperBoundOfIn0(X0,xS,xT) )
| sdtlseqdt0(xu,X0) )
& ! [X4] :
( sdtlseqdt0(X4,xv)
| ~ aElementOf0(X4,xS) )
& aElementOf0(xu,xT)
& ! [X2] :
( sdtlseqdt0(xv,X2)
| ( ~ aUpperBoundOfIn0(X2,xS,xT)
& ( ~ aElementOf0(X2,xT)
| ? [X3] :
( aElementOf0(X3,xS)
& ~ sdtlseqdt0(X3,X2) ) ) ) )
& aElementOf0(xv,xT)
& aUpperBoundOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xu,xT)
& aSupremumOfIn0(xv,xS,xT)
& aUpperBoundOfIn0(xu,xS,xT) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
( aUpperBoundOfIn0(xu,xS,xT)
& ! [X5] :
( aElementOf0(X5,xS)
=> sdtlseqdt0(X5,xu) )
& aElementOf0(xu,xT)
& ! [X4] :
( aElementOf0(X4,xS)
=> sdtlseqdt0(X4,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xv,xS,xT)
& ! [X0] :
( ( ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xT) )
| aUpperBoundOfIn0(X0,xS,xT) )
=> sdtlseqdt0(xu,X0) )
& aUpperBoundOfIn0(xv,xS,xT)
& aElementOf0(xu,xT)
& ! [X2] :
( ( ( aElementOf0(X2,xT)
& ! [X3] :
( aElementOf0(X3,xS)
=> sdtlseqdt0(X3,X2) ) )
| aUpperBoundOfIn0(X2,xS,xT) )
=> sdtlseqdt0(xv,X2) )
& aSupremumOfIn0(xu,xS,xT) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
( aSupremumOfIn0(xv,xS,xT)
& ! [X0] :
( ( ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xT) )
| aUpperBoundOfIn0(X0,xS,xT) )
=> sdtlseqdt0(xu,X0) )
& ! [X0] :
( ( ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xT) )
| aUpperBoundOfIn0(X0,xS,xT) )
=> sdtlseqdt0(xv,X0) )
& aElementOf0(xu,xT)
& aUpperBoundOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& aElementOf0(xu,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(X0,xv) )
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(X0,xu) )
& aUpperBoundOfIn0(xv,xS,xT)
& aElementOf0(xv,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__744) ).
fof(f107,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0] :
( ! [X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1) )
| ~ aSet0(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(f223,plain,
~ aElement0(xv),
inference(subsumption_resolution,[],[f222,f122]) ).
fof(f122,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f81,f73]) ).
fof(f73,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f43]) ).
fof(f81,plain,
! [X4] :
( ~ aUpperBoundOfIn0(X4,xS,xT)
| sdtlseqdt0(xv,X4) ),
inference(cnf_transformation,[],[f43]) ).
fof(f222,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xv) ),
inference(subsumption_resolution,[],[f221,f105]) ).
fof(f105,plain,
xu != xv,
inference(cnf_transformation,[],[f22]) ).
fof(f22,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(f221,plain,
( xu = xv
| ~ aElement0(xv)
| ~ sdtlseqdt0(xv,xu) ),
inference(subsumption_resolution,[],[f214,f146]) ).
fof(f146,plain,
aElement0(xu),
inference(subsumption_resolution,[],[f142,f99]) ).
fof(f142,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[],[f107,f75]) ).
fof(f75,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f43]) ).
fof(f214,plain,
( ~ aElement0(xu)
| xu = xv
| ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xv) ),
inference(resolution,[],[f104,f125]) ).
fof(f125,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f84,f77]) ).
fof(f77,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f43]) ).
fof(f84,plain,
! [X1] :
( ~ aUpperBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(xu,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f104,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| X0 = X1
| ~ aElement0(X1)
| ~ aElement0(X0)
| ~ sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( ~ aElement0(X0)
| ~ sdtlseqdt0(X1,X0)
| X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
! [X1,X0] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X0] :
( ( aElement0(X0)
& aElement0(X1) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n004.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 : Tue Aug 30 01:23:05 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.50 % (9899)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.51 % (9926)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.21/0.51 % (9899)First to succeed.
% 0.21/0.51 % (9909)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.52 % (9899)Refutation found. Thanks to Tanya!
% 0.21/0.52 % SZS status Theorem for theBenchmark
% 0.21/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52 % (9899)------------------------------
% 0.21/0.52 % (9899)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (9899)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (9899)Termination reason: Refutation
% 0.21/0.52
% 0.21/0.52 % (9899)Memory used [KB]: 6012
% 0.21/0.52 % (9899)Time elapsed: 0.105 s
% 0.21/0.52 % (9899)Instructions burned: 4 (million)
% 0.21/0.52 % (9899)------------------------------
% 0.21/0.52 % (9899)------------------------------
% 0.21/0.52 % (9894)Success in time 0.156 s
%------------------------------------------------------------------------------