TSTP Solution File: LAT382+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LAT382+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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 May 1 03:10:03 EDT 2024
% Result : Theorem 0.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 57 ( 20 unt; 0 def)
% Number of atoms : 181 ( 9 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 221 ( 97 ~; 89 |; 25 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 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 : 61 ( 57 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f135,plain,
$false,
inference(subsumption_resolution,[],[f134,f84]) ).
fof(f84,plain,
aElement0(xu),
inference(subsumption_resolution,[],[f83,f48]) ).
fof(f48,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
aSet0(xT),
file('/export/starexec/sandbox/tmp/tmp.KmedwAu6PX/Vampire---4.8_27265',m__773) ).
fof(f83,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[],[f78,f69]) ).
fof(f69,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.KmedwAu6PX/Vampire---4.8_27265',mEOfElem) ).
fof(f78,plain,
aElementOf0(xu,xT),
inference(subsumption_resolution,[],[f77,f48]) ).
fof(f77,plain,
( aElementOf0(xu,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f74,f49]) ).
fof(f49,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f16,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/tmp/tmp.KmedwAu6PX/Vampire---4.8_27265',m__773_01) ).
fof(f74,plain,
( aElementOf0(xu,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f50,f57]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ aInfimumOfIn0(X2,X1,X0)
| aElementOf0(X2,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ( ~ sdtlseqdt0(sK1(X0,X1,X2),X2)
& aLowerBoundOfIn0(sK1(X0,X1,X2),X1,X0) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X4] :
( sdtlseqdt0(X4,X2)
| ~ aLowerBoundOfIn0(X4,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f40,f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) )
=> ( ~ sdtlseqdt0(sK1(X0,X1,X2),X2)
& aLowerBoundOfIn0(sK1(X0,X1,X2),X1,X0) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X4] :
( sdtlseqdt0(X4,X2)
| ~ aLowerBoundOfIn0(X4,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) )
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.KmedwAu6PX/Vampire---4.8_27265',mDefInf) ).
fof(f50,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
( aInfimumOfIn0(xv,xS,xT)
& aInfimumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/tmp/tmp.KmedwAu6PX/Vampire---4.8_27265',m__792) ).
fof(f134,plain,
~ aElement0(xu),
inference(subsumption_resolution,[],[f133,f95]) ).
fof(f95,plain,
aElement0(xv),
inference(subsumption_resolution,[],[f94,f48]) ).
fof(f94,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[],[f89,f69]) ).
fof(f89,plain,
aElementOf0(xv,xT),
inference(subsumption_resolution,[],[f88,f48]) ).
fof(f88,plain,
( aElementOf0(xv,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f85,f49]) ).
fof(f85,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f51,f57]) ).
fof(f51,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f133,plain,
( ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(subsumption_resolution,[],[f132,f127]) ).
fof(f127,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f93,f80]) ).
fof(f80,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(subsumption_resolution,[],[f79,f48]) ).
fof(f79,plain,
( aLowerBoundOfIn0(xu,xS,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f75,f49]) ).
fof(f75,plain,
( aLowerBoundOfIn0(xu,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f50,f58]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ aInfimumOfIn0(X2,X1,X0)
| aLowerBoundOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f93,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv) ),
inference(subsumption_resolution,[],[f92,f48]) ).
fof(f92,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f87,f49]) ).
fof(f87,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f51,f59]) ).
fof(f59,plain,
! [X2,X0,X1,X4] :
( ~ aInfimumOfIn0(X2,X1,X0)
| ~ aLowerBoundOfIn0(X4,X1,X0)
| sdtlseqdt0(X4,X2)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f132,plain,
( ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(subsumption_resolution,[],[f131,f52]) ).
fof(f52,plain,
xu != xv,
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
xu != xv,
inference(flattening,[],[f19]) ).
fof(f19,negated_conjecture,
xu != xv,
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
xu = xv,
file('/export/starexec/sandbox/tmp/tmp.KmedwAu6PX/Vampire---4.8_27265',m__) ).
fof(f131,plain,
( xu = xv
| ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(resolution,[],[f121,f62]) ).
fof(f62,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f26]) ).
fof(f26,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/sandbox/tmp/tmp.KmedwAu6PX/Vampire---4.8_27265',mASymm) ).
fof(f121,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f82,f91]) ).
fof(f91,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(subsumption_resolution,[],[f90,f48]) ).
fof(f90,plain,
( aLowerBoundOfIn0(xv,xS,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f86,f49]) ).
fof(f86,plain,
( aLowerBoundOfIn0(xv,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f51,f58]) ).
fof(f82,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu) ),
inference(subsumption_resolution,[],[f81,f48]) ).
fof(f81,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f76,f49]) ).
fof(f76,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f50,f59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LAT382+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n008.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 16:23:57 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.32 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.KmedwAu6PX/Vampire---4.8_27265
% 0.60/0.79 % (27392)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.79 % (27393)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.79 % (27391)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.60/0.79 % (27395)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.79 % (27394)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.79 % (27390)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.79 % (27396)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.60/0.79 % (27397)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.79 % (27393)Refutation not found, incomplete strategy% (27393)------------------------------
% 0.60/0.79 % (27393)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.79 % (27393)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79
% 0.60/0.79 % (27393)Memory used [KB]: 1039
% 0.60/0.79 % (27393)Time elapsed: 0.003 s
% 0.60/0.79 % (27393)Instructions burned: 3 (million)
% 0.60/0.79 % (27393)------------------------------
% 0.60/0.79 % (27393)------------------------------
% 0.60/0.79 % (27395)First to succeed.
% 0.60/0.79 % (27390)Also succeeded, but the first one will report.
% 0.60/0.79 % (27395)Refutation found. Thanks to Tanya!
% 0.60/0.79 % SZS status Theorem for Vampire---4
% 0.60/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.79 % (27395)------------------------------
% 0.60/0.79 % (27395)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.79 % (27395)Termination reason: Refutation
% 0.60/0.79
% 0.60/0.79 % (27395)Memory used [KB]: 1059
% 0.60/0.79 % (27395)Time elapsed: 0.005 s
% 0.60/0.79 % (27395)Instructions burned: 6 (million)
% 0.60/0.79 % (27395)------------------------------
% 0.60/0.79 % (27395)------------------------------
% 0.60/0.79 % (27379)Success in time 0.468 s
% 0.60/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------