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 : n017.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 : Sun May 5 07:25:13 EDT 2024
% Result : Theorem 0.57s 0.78s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 69 ( 22 unt; 1 typ; 0 def)
% Number of atoms : 337 ( 9 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 249 ( 108 ~; 101 |; 25 &)
% ( 7 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 128 ( 128 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 9 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 73 ( 68 !; 4 ?; 32 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_11,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f144,plain,
$false,
inference(avatar_sat_refutation,[],[f98,f107,f113,f139,f143]) ).
tff(f143,plain,
spl3_3,
inference(avatar_contradiction_clause,[],[f142]) ).
tff(f142,plain,
( $false
| spl3_3 ),
inference(subsumption_resolution,[],[f140,f93]) ).
tff(f93,plain,
( ~ sdtlseqdt0(xu,xv)
| spl3_3 ),
inference(avatar_component_clause,[],[f91]) ).
tff(f91,plain,
( spl3_3
<=> sdtlseqdt0(xu,xv) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
tff(f140,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f123,f40]) ).
tff(f40,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f17]) ).
tff(f17,axiom,
( aInfimumOfIn0(xv,xS,xT)
& aInfimumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/tmp/tmp.oCUjXH2QHc/Vampire---4.8_7391',m__792) ).
tff(f123,plain,
! [X0: $i] :
( ~ aInfimumOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv) ),
inference(subsumption_resolution,[],[f122,f38]) ).
tff(f38,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
tff(f15,axiom,
aSet0(xT),
file('/export/starexec/sandbox/tmp/tmp.oCUjXH2QHc/Vampire---4.8_7391',m__773) ).
tff(f122,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xv)
| ~ aInfimumOfIn0(X0,xS,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f120,f39]) ).
tff(f39,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f16]) ).
tff(f16,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/tmp/tmp.oCUjXH2QHc/Vampire---4.8_7391',m__773_01) ).
tff(f120,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xv)
| ~ aInfimumOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f104,f49]) ).
tff(f49,plain,
! [X2: $i,X0: $i,X1: $i] :
( aLowerBoundOfIn0(X2,X1,X0)
| ~ aInfimumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f37]) ).
tff(f37,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])],[f35,f36]) ).
tff(f36,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,[]) ).
tff(f35,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,[],[f34]) ).
tff(f34,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,[],[f33]) ).
tff(f33,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]) ).
tff(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]) ).
tff(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.oCUjXH2QHc/Vampire---4.8_7391',mDefInf) ).
tff(f104,plain,
! [X0: $i] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv) ),
inference(subsumption_resolution,[],[f103,f38]) ).
tff(f103,plain,
! [X0: $i] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f100,f39]) ).
tff(f100,plain,
! [X0: $i] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f50,f41]) ).
tff(f41,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f17]) ).
tff(f50,plain,
! [X2: $i,X0: $i,X1: $i,X4: $i] :
( ~ aInfimumOfIn0(X2,X1,X0)
| ~ aLowerBoundOfIn0(X4,X1,X0)
| sdtlseqdt0(X4,X2)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f37]) ).
tff(f139,plain,
spl3_4,
inference(avatar_split_clause,[],[f138,f95]) ).
tff(f95,plain,
( spl3_4
<=> sdtlseqdt0(xv,xu) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
tff(f138,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f117,f41]) ).
tff(f117,plain,
! [X0: $i] :
( ~ aInfimumOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu) ),
inference(subsumption_resolution,[],[f116,f38]) ).
tff(f116,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xu)
| ~ aInfimumOfIn0(X0,xS,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f114,f39]) ).
tff(f114,plain,
! [X0: $i] :
( sdtlseqdt0(X0,xu)
| ~ aInfimumOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f102,f49]) ).
tff(f102,plain,
! [X0: $i] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu) ),
inference(subsumption_resolution,[],[f101,f38]) ).
tff(f101,plain,
! [X0: $i] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f99,f39]) ).
tff(f99,plain,
! [X0: $i] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f50,f40]) ).
tff(f113,plain,
spl3_2,
inference(avatar_split_clause,[],[f112,f87]) ).
tff(f87,plain,
( spl3_2
<=> aElement0(xv) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
tff(f112,plain,
aElement0(xv),
inference(subsumption_resolution,[],[f108,f38]) ).
tff(f108,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[],[f78,f47]) ).
tff(f47,plain,
! [X0: $i,X1: $i] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.oCUjXH2QHc/Vampire---4.8_7391',mEOfElem) ).
tff(f78,plain,
aElementOf0(xv,xT),
inference(subsumption_resolution,[],[f77,f38]) ).
tff(f77,plain,
( aElementOf0(xv,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f74,f39]) ).
tff(f74,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f48,f41]) ).
tff(f48,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ aInfimumOfIn0(X2,X1,X0)
| aElementOf0(X2,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f37]) ).
tff(f107,plain,
spl3_1,
inference(avatar_split_clause,[],[f80,f83]) ).
tff(f83,plain,
( spl3_1
<=> aElement0(xu) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
tff(f80,plain,
aElement0(xu),
inference(subsumption_resolution,[],[f79,f38]) ).
tff(f79,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[],[f76,f47]) ).
tff(f76,plain,
aElementOf0(xu,xT),
inference(subsumption_resolution,[],[f75,f38]) ).
tff(f75,plain,
( aElementOf0(xu,xT)
| ~ aSet0(xT) ),
inference(subsumption_resolution,[],[f73,f39]) ).
tff(f73,plain,
( aElementOf0(xu,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f48,f40]) ).
tff(f98,plain,
( ~ spl3_1
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f81,f95,f91,f87,f83]) ).
tff(f81,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(resolution,[],[f56,f55]) ).
tff(f55,plain,
~ sQ2_eqProxy($i,xu,xv),
inference(equality_proxy_replacement,[],[f42,f54]) ).
tff(f54,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ2_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ2_eqProxy])]) ).
tff(f42,plain,
xu != xv,
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
xu != xv,
inference(flattening,[],[f19]) ).
tff(f19,negated_conjecture,
( ~ xu = xv ),
inference(negated_conjecture,[],[f18]) ).
tff(f18,conjecture,
xu = xv,
file('/export/starexec/sandbox/tmp/tmp.oCUjXH2QHc/Vampire---4.8_7391',m__) ).
tff(f56,plain,
! [X0: $i,X1: $i] :
( sQ2_eqProxy($i,X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(equality_proxy_replacement,[],[f53,f54]) ).
tff(f53,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f27]) ).
tff(f27,plain,
! [X0,X1] :
( ( X0 = X1 )
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f26]) ).
tff(f26,plain,
! [X0,X1] :
( ( X0 = X1 )
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> ( X0 = X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.oCUjXH2QHc/Vampire---4.8_7391',mASymm) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : LAT382+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.17 % 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.15/0.39 % Computer : n017.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Fri May 3 11:39:51 EDT 2024
% 0.15/0.39 % CPUTime :
% 0.15/0.39 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.39 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.oCUjXH2QHc/Vampire---4.8_7391
% 0.57/0.77 % (7649)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 (2996ds/34Mi)
% 0.57/0.78 % (7651)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.78 % (7650)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 (2996ds/51Mi)
% 0.57/0.78 % (7653)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 (2996ds/34Mi)
% 0.57/0.78 % (7652)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.78 % (7654)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.78 % (7655)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 (2996ds/83Mi)
% 0.57/0.78 % (7656)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 (2996ds/56Mi)
% 0.57/0.78 % (7649)First to succeed.
% 0.57/0.78 % (7652)Refutation not found, incomplete strategy% (7652)------------------------------
% 0.57/0.78 % (7652)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.78 % (7652)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.78
% 0.57/0.78 % (7652)Memory used [KB]: 1040
% 0.57/0.78 % (7652)Time elapsed: 0.004 s
% 0.57/0.78 % (7652)Instructions burned: 3 (million)
% 0.57/0.78 % (7652)------------------------------
% 0.57/0.78 % (7652)------------------------------
% 0.57/0.78 % (7656)Also succeeded, but the first one will report.
% 0.57/0.78 % (7649)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-7639"
% 0.57/0.78 % (7654)Also succeeded, but the first one will report.
% 0.57/0.78 % (7649)Refutation found. Thanks to Tanya!
% 0.57/0.78 % SZS status Theorem for Vampire---4
% 0.57/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.78 % (7649)------------------------------
% 0.57/0.78 % (7649)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.78 % (7649)Termination reason: Refutation
% 0.57/0.78
% 0.57/0.78 % (7649)Memory used [KB]: 1070
% 0.57/0.78 % (7649)Time elapsed: 0.004 s
% 0.57/0.78 % (7649)Instructions burned: 6 (million)
% 0.57/0.78 % (7639)Success in time 0.382 s
% 0.57/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------