TSTP Solution File: LAT381+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n008.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:35 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 59 ( 20 unt; 0 def)
% Number of atoms : 191 ( 12 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 232 ( 100 ~; 93 |; 27 &)
% ( 2 <=>; 10 =>; 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 : 65 ( 61 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f149,plain,
$false,
inference(subsumption_resolution,[],[f147,f146]) ).
fof(f146,plain,
~ sdtlseqdt0(xu,xv),
inference(subsumption_resolution,[],[f145,f121]) ).
fof(f121,plain,
aElement0(xv),
inference(subsumption_resolution,[],[f120,f101]) ).
fof(f101,plain,
aSet0(xT),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725) ).
fof(f120,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(resolution,[],[f116,f70]) ).
fof(f70,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(f116,plain,
aElementOf0(xv,xT),
inference(subsumption_resolution,[],[f115,f90]) ).
fof(f90,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725_01) ).
fof(f115,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(subsumption_resolution,[],[f112,f101]) ).
fof(f112,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aElementOf0(xv,xT) ),
inference(resolution,[],[f93,f100]) ).
fof(f100,plain,
aSupremumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f16,axiom,
( aSupremumOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__744) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| aElementOf0(X2,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0] :
( ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ( ~ sdtlseqdt0(X2,sK4(X0,X1,X2))
& aUpperBoundOfIn0(sK4(X0,X1,X2),X1,X0) ) )
& ( ( aElementOf0(X2,X0)
& aUpperBoundOfIn0(X2,X1,X0)
& ! [X4] :
( sdtlseqdt0(X2,X4)
| ~ aUpperBoundOfIn0(X4,X1,X0) ) )
| ~ aSupremumOfIn0(X2,X1,X0) ) ) )
| ~ aSet0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f61,f62]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
=> ( ~ sdtlseqdt0(X2,sK4(X0,X1,X2))
& aUpperBoundOfIn0(sK4(X0,X1,X2),X1,X0) ) ),
introduced(choice_axiom,[]) ).
fof(f61,plain,
! [X0] :
( ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) ) )
& ( ( aElementOf0(X2,X0)
& aUpperBoundOfIn0(X2,X1,X0)
& ! [X4] :
( sdtlseqdt0(X2,X4)
| ~ aUpperBoundOfIn0(X4,X1,X0) ) )
| ~ aSupremumOfIn0(X2,X1,X0) ) ) )
| ~ aSet0(X0) ),
inference(rectify,[],[f60]) ).
fof(f60,plain,
! [X0] :
( ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) ) )
& ( ( aElementOf0(X2,X0)
& aUpperBoundOfIn0(X2,X1,X0)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) ) )
| ~ aSupremumOfIn0(X2,X1,X0) ) ) )
| ~ aSet0(X0) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) ) )
& ( ( aElementOf0(X2,X0)
& aUpperBoundOfIn0(X2,X1,X0)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) ) )
| ~ aSupremumOfIn0(X2,X1,X0) ) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0] :
( ! [X1] :
( ~ aSubsetOf0(X1,X0)
| ! [X2] :
( aSupremumOfIn0(X2,X1,X0)
<=> ( aElementOf0(X2,X0)
& aUpperBoundOfIn0(X2,X1,X0)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) ) ) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( aSupremumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( aUpperBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X2,X3) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSup) ).
fof(f145,plain,
( ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv) ),
inference(subsumption_resolution,[],[f144,f84]) ).
fof(f84,plain,
xu != xv,
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
xu != xv,
inference(flattening,[],[f18]) ).
fof(f18,negated_conjecture,
xu != xv,
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f144,plain,
( xu = xv
| ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv) ),
inference(subsumption_resolution,[],[f143,f118]) ).
fof(f118,plain,
aElement0(xu),
inference(subsumption_resolution,[],[f117,f101]) ).
fof(f117,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(resolution,[],[f114,f70]) ).
fof(f114,plain,
aElementOf0(xu,xT),
inference(subsumption_resolution,[],[f113,f101]) ).
fof(f113,plain,
( ~ aSet0(xT)
| aElementOf0(xu,xT) ),
inference(subsumption_resolution,[],[f111,f90]) ).
fof(f111,plain,
( ~ aSubsetOf0(xS,xT)
| aElementOf0(xu,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f93,f99]) ).
fof(f99,plain,
aSupremumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f143,plain,
( ~ aElement0(xu)
| ~ sdtlseqdt0(xu,xv)
| xu = xv
| ~ aElement0(xv) ),
inference(resolution,[],[f142,f69]) ).
fof(f69,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ~ aElement0(X1)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aElement0(X0) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X1,X0] :
( ~ aElement0(X0)
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| X0 = X1
| ~ aElement0(X1) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X1,X0] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X0,X1)
& sdtlseqdt0(X1,X0) )
=> X0 = X1 ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X0] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
fof(f142,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f136,f100]) ).
fof(f136,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu) ),
inference(subsumption_resolution,[],[f135,f90]) ).
fof(f135,plain,
! [X0] :
( sdtlseqdt0(X0,xu)
| ~ aSubsetOf0(xS,xT)
| ~ aSupremumOfIn0(X0,xS,xT) ),
inference(subsumption_resolution,[],[f134,f101]) ).
fof(f134,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xS,xT)
| ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| sdtlseqdt0(X0,xu) ),
inference(resolution,[],[f125,f91]) ).
fof(f91,plain,
! [X2,X0,X1,X4] :
( ~ aUpperBoundOfIn0(X4,X1,X0)
| sdtlseqdt0(X2,X4)
| ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSupremumOfIn0(X2,X1,X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f125,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(subsumption_resolution,[],[f124,f90]) ).
fof(f124,plain,
( aUpperBoundOfIn0(xu,xS,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(subsumption_resolution,[],[f122,f101]) ).
fof(f122,plain,
( ~ aSet0(xT)
| aUpperBoundOfIn0(xu,xS,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(resolution,[],[f92,f99]) ).
fof(f92,plain,
! [X2,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| aUpperBoundOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f147,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f140,f99]) ).
fof(f140,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv) ),
inference(subsumption_resolution,[],[f139,f101]) ).
fof(f139,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f138,f90]) ).
fof(f138,plain,
! [X0] :
( sdtlseqdt0(X0,xv)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT)
| ~ aSupremumOfIn0(X0,xS,xT) ),
inference(resolution,[],[f127,f91]) ).
fof(f127,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(subsumption_resolution,[],[f126,f90]) ).
fof(f126,plain,
( ~ aSubsetOf0(xS,xT)
| aUpperBoundOfIn0(xv,xS,xT) ),
inference(subsumption_resolution,[],[f123,f101]) ).
fof(f123,plain,
( ~ aSet0(xT)
| aUpperBoundOfIn0(xv,xS,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(resolution,[],[f92,f100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT381+1 : 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 : n008.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:30:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (22277)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (22293)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.50 % (22277)First to succeed.
% 0.19/0.50 % (22285)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.51 % (22277)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (22277)------------------------------
% 0.19/0.51 % (22277)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (22277)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (22277)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (22277)Memory used [KB]: 5500
% 0.19/0.51 % (22277)Time elapsed: 0.109 s
% 0.19/0.51 % (22277)Instructions burned: 4 (million)
% 0.19/0.51 % (22277)------------------------------
% 0.19/0.51 % (22277)------------------------------
% 0.19/0.51 % (22272)Success in time 0.159 s
%------------------------------------------------------------------------------