TSTP Solution File: LAT381+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LAT381+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 : n002.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:02 EDT 2024
% Result : Theorem 0.59s 0.81s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 22 unt; 0 def)
% Number of atoms : 211 ( 9 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 248 ( 107 ~; 101 |; 25 &)
% ( 7 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 5 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 67 ( 63 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f150,plain,
$false,
inference(avatar_sat_refutation,[],[f90,f128,f137,f142,f149]) ).
fof(f149,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f148]) ).
fof(f148,plain,
( $false
| spl4_2 ),
inference(subsumption_resolution,[],[f146,f47]) ).
fof(f47,plain,
aSet0(xT),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
aSet0(xT),
file('/export/starexec/sandbox/tmp/tmp.fdxEniCDYr/Vampire---4.8_3831',m__725) ).
fof(f146,plain,
( ~ aSet0(xT)
| spl4_2 ),
inference(resolution,[],[f144,f107]) ).
fof(f107,plain,
aElementOf0(xv,xT),
inference(subsumption_resolution,[],[f106,f47]) ).
fof(f106,plain,
( aElementOf0(xv,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f103,f48]) ).
fof(f48,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/tmp/tmp.fdxEniCDYr/Vampire---4.8_3831',m__725_01) ).
fof(f103,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f50,f56]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| aElementOf0(X2,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ( ~ sdtlseqdt0(X2,sK1(X0,X1,X2))
& aUpperBoundOfIn0(sK1(X0,X1,X2),X1,X0) )
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X4] :
( sdtlseqdt0(X2,X4)
| ~ aUpperBoundOfIn0(X4,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f39,f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
=> ( ~ sdtlseqdt0(X2,sK1(X0,X1,X2))
& aUpperBoundOfIn0(sK1(X0,X1,X2),X1,X0) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X4] :
( sdtlseqdt0(X2,X4)
| ~ aUpperBoundOfIn0(X4,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(rectify,[],[f38]) ).
fof(f38,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(flattening,[],[f37]) ).
fof(f37,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aSupremumOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X2,X3)
& aUpperBoundOfIn0(X3,X1,X0) )
| ~ aUpperBoundOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0) )
& ( ( ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) )
| ~ aSupremumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( aSupremumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(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/tmp/tmp.fdxEniCDYr/Vampire---4.8_3831',mDefSup) ).
fof(f50,plain,
aSupremumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f16,axiom,
( aSupremumOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/tmp/tmp.fdxEniCDYr/Vampire---4.8_3831',m__744) ).
fof(f144,plain,
( ! [X0] :
( ~ aElementOf0(xv,X0)
| ~ aSet0(X0) )
| spl4_2 ),
inference(resolution,[],[f81,f68]) ).
fof(f68,plain,
! [X0,X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,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.fdxEniCDYr/Vampire---4.8_3831',mEOfElem) ).
fof(f81,plain,
( ~ aElement0(xv)
| spl4_2 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f79,plain,
( spl4_2
<=> aElement0(xv) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f142,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f141]) ).
fof(f141,plain,
( $false
| spl4_1 ),
inference(subsumption_resolution,[],[f139,f47]) ).
fof(f139,plain,
( ~ aSet0(xT)
| spl4_1 ),
inference(resolution,[],[f91,f98]) ).
fof(f98,plain,
aElementOf0(xu,xT),
inference(subsumption_resolution,[],[f97,f47]) ).
fof(f97,plain,
( aElementOf0(xu,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f94,f48]) ).
fof(f94,plain,
( aElementOf0(xu,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f49,f56]) ).
fof(f49,plain,
aSupremumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f91,plain,
( ! [X0] :
( ~ aElementOf0(xu,X0)
| ~ aSet0(X0) )
| spl4_1 ),
inference(resolution,[],[f77,f68]) ).
fof(f77,plain,
( ~ aElement0(xu)
| spl4_1 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f75,plain,
( spl4_1
<=> aElement0(xu) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f137,plain,
spl4_4,
inference(avatar_split_clause,[],[f131,f87]) ).
fof(f87,plain,
( spl4_4
<=> sdtlseqdt0(xv,xu) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f131,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f111,f100]) ).
fof(f100,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(subsumption_resolution,[],[f99,f47]) ).
fof(f99,plain,
( aUpperBoundOfIn0(xu,xS,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f95,f48]) ).
fof(f95,plain,
( aUpperBoundOfIn0(xu,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f49,f57]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| aUpperBoundOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f111,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xv,X0) ),
inference(subsumption_resolution,[],[f110,f47]) ).
fof(f110,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xv,X0)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f105,f48]) ).
fof(f105,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xv,X0)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f50,f58]) ).
fof(f58,plain,
! [X2,X0,X1,X4] :
( ~ aSupremumOfIn0(X2,X1,X0)
| ~ aUpperBoundOfIn0(X4,X1,X0)
| sdtlseqdt0(X2,X4)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f128,plain,
spl4_3,
inference(avatar_split_clause,[],[f123,f83]) ).
fof(f83,plain,
( spl4_3
<=> sdtlseqdt0(xu,xv) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f123,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f102,f109]) ).
fof(f109,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(subsumption_resolution,[],[f108,f47]) ).
fof(f108,plain,
( aUpperBoundOfIn0(xv,xS,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f104,f48]) ).
fof(f104,plain,
( aUpperBoundOfIn0(xv,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f50,f57]) ).
fof(f102,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xu,X0) ),
inference(subsumption_resolution,[],[f101,f47]) ).
fof(f101,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xu,X0)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f96,f48]) ).
fof(f96,plain,
! [X0] :
( ~ aUpperBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(xu,X0)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f49,f58]) ).
fof(f90,plain,
( ~ spl4_1
| ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f73,f87,f83,f79,f75]) ).
fof(f73,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(resolution,[],[f70,f71]) ).
fof(f71,plain,
! [X0,X1] :
( sQ3_eqProxy(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(equality_proxy_replacement,[],[f61,f69]) ).
fof(f69,plain,
! [X0,X1] :
( sQ3_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ3_eqProxy])]) ).
fof(f61,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f25]) ).
fof(f25,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.fdxEniCDYr/Vampire---4.8_3831',mASymm) ).
fof(f70,plain,
~ sQ3_eqProxy(xu,xv),
inference(equality_proxy_replacement,[],[f51,f69]) ).
fof(f51,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/sandbox/tmp/tmp.fdxEniCDYr/Vampire---4.8_3831',m__) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LAT381+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.12 % 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.11/0.33 % Computer : n002.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Apr 30 16:43:40 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.33 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.fdxEniCDYr/Vampire---4.8_3831
% 0.59/0.80 % (3942)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.59/0.80 % (3943)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.59/0.80 % (3940)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.59/0.80 % (3941)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.59/0.80 % (3944)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.59/0.80 % (3945)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.59/0.80 % (3946)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.59/0.80 % (3947)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.59/0.81 % (3943)Refutation not found, incomplete strategy% (3943)------------------------------
% 0.59/0.81 % (3943)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.81 % (3943)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.81
% 0.59/0.81 % (3943)Memory used [KB]: 1039
% 0.59/0.81 % (3943)Time elapsed: 0.003 s
% 0.59/0.81 % (3943)Instructions burned: 3 (million)
% 0.59/0.81 % (3943)------------------------------
% 0.59/0.81 % (3943)------------------------------
% 0.59/0.81 % (3947)First to succeed.
% 0.59/0.81 % (3940)Also succeeded, but the first one will report.
% 0.59/0.81 % (3945)Also succeeded, but the first one will report.
% 0.59/0.81 % (3947)Refutation found. Thanks to Tanya!
% 0.59/0.81 % SZS status Theorem for Vampire---4
% 0.59/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.81 % (3947)------------------------------
% 0.59/0.81 % (3947)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.81 % (3947)Termination reason: Refutation
% 0.59/0.81
% 0.59/0.81 % (3947)Memory used [KB]: 1067
% 0.59/0.81 % (3947)Time elapsed: 0.004 s
% 0.59/0.81 % (3947)Instructions burned: 5 (million)
% 0.59/0.81 % (3947)------------------------------
% 0.59/0.81 % (3947)------------------------------
% 0.59/0.81 % (3938)Success in time 0.473 s
% 0.59/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------