TSTP Solution File: NUM571+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM571+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/sandbox2/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 : Sun May 5 08:13:07 EDT 2024
% Result : Theorem 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 4 unt; 0 def)
% Number of atoms : 101 ( 19 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 95 ( 29 ~; 32 |; 27 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 6 ( 3 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f341,plain,
$false,
inference(avatar_sat_refutation,[],[f311,f316,f327,f334,f338]) ).
fof(f338,plain,
( ~ spl16_1
| spl16_3 ),
inference(avatar_contradiction_clause,[],[f337]) ).
fof(f337,plain,
( $false
| ~ spl16_1
| spl16_3 ),
inference(subsumption_resolution,[],[f336,f194]) ).
fof(f194,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnf_transformation,[],[f75]) ).
fof(f75,axiom,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.5uF6IQqD2F/Vampire---4.8_29558',m__3435) ).
fof(f336,plain,
( ~ aSubsetOf0(xS,szNzAzT0)
| ~ spl16_1
| spl16_3 ),
inference(forward_demodulation,[],[f335,f209]) ).
fof(f209,plain,
xS = sdtlpdtrp0(xN,sz00),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
( ! [X0] :
( ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) )
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) )
& xS = sdtlpdtrp0(xN,sz00)
& szNzAzT0 = szDzozmdt0(xN)
& aFunction0(xN) ),
inference(flattening,[],[f94]) ).
fof(f94,plain,
( ! [X0] :
( ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) )
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) )
& xS = sdtlpdtrp0(xN,sz00)
& szNzAzT0 = szDzozmdt0(xN)
& aFunction0(xN) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
( ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) ) )
& xS = sdtlpdtrp0(xN,sz00)
& szNzAzT0 = szDzozmdt0(xN)
& aFunction0(xN) ),
file('/export/starexec/sandbox2/tmp/tmp.5uF6IQqD2F/Vampire---4.8_29558',m__3623) ).
fof(f335,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,sz00),szNzAzT0)
| ~ spl16_1
| spl16_3 ),
inference(forward_demodulation,[],[f314,f306]) ).
fof(f306,plain,
( sz00 = xi
| ~ spl16_1 ),
inference(avatar_component_clause,[],[f304]) ).
fof(f304,plain,
( spl16_1
<=> sz00 = xi ),
introduced(avatar_definition,[new_symbols(naming,[spl16_1])]) ).
fof(f314,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| spl16_3 ),
inference(avatar_component_clause,[],[f313]) ).
fof(f313,plain,
( spl16_3
<=> aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_3])]) ).
fof(f334,plain,
( ~ spl16_1
| spl16_2 ),
inference(avatar_contradiction_clause,[],[f333]) ).
fof(f333,plain,
( $false
| ~ spl16_1
| spl16_2 ),
inference(subsumption_resolution,[],[f332,f195]) ).
fof(f195,plain,
isCountable0(xS),
inference(cnf_transformation,[],[f75]) ).
fof(f332,plain,
( ~ isCountable0(xS)
| ~ spl16_1
| spl16_2 ),
inference(forward_demodulation,[],[f328,f209]) ).
fof(f328,plain,
( ~ isCountable0(sdtlpdtrp0(xN,sz00))
| ~ spl16_1
| spl16_2 ),
inference(backward_demodulation,[],[f309,f306]) ).
fof(f309,plain,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| spl16_2 ),
inference(avatar_component_clause,[],[f308]) ).
fof(f308,plain,
( spl16_2
<=> isCountable0(sdtlpdtrp0(xN,xi)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_2])]) ).
fof(f327,plain,
( ~ spl16_3
| ~ spl16_2 ),
inference(avatar_split_clause,[],[f219,f308,f313]) ).
fof(f219,plain,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f99,plain,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(ennf_transformation,[],[f86]) ).
fof(f86,negated_conjecture,
~ ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(negated_conjecture,[],[f85]) ).
fof(f85,conjecture,
( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.5uF6IQqD2F/Vampire---4.8_29558',m__) ).
fof(f316,plain,
( spl16_1
| spl16_3 ),
inference(avatar_split_clause,[],[f217,f313,f304]) ).
fof(f217,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| sz00 = xi ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
( ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& xi = szszuzczcdt0(sK4)
& aElementOf0(sK4,szNzAzT0) )
| sz00 = xi ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f98,f155]) ).
fof(f155,plain,
( ? [X0] :
( szszuzczcdt0(X0) = xi
& aElementOf0(X0,szNzAzT0) )
=> ( xi = szszuzczcdt0(sK4)
& aElementOf0(sK4,szNzAzT0) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
( ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& ? [X0] :
( szszuzczcdt0(X0) = xi
& aElementOf0(X0,szNzAzT0) ) )
| sz00 = xi ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
( sz00 != xi
=> ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& ? [X0] :
( szszuzczcdt0(X0) = xi
& aElementOf0(X0,szNzAzT0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5uF6IQqD2F/Vampire---4.8_29558',m__3702_02) ).
fof(f311,plain,
( spl16_1
| spl16_2 ),
inference(avatar_split_clause,[],[f218,f308,f304]) ).
fof(f218,plain,
( isCountable0(sdtlpdtrp0(xN,xi))
| sz00 = xi ),
inference(cnf_transformation,[],[f156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM571+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n002.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 : Fri May 3 14:48:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.5uF6IQqD2F/Vampire---4.8_29558
% 0.58/0.73 % (29673)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.58/0.73 % (29667)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.58/0.73 % (29670)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.58/0.73 % (29671)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.58/0.73 % (29668)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.58/0.73 % (29672)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.58/0.74 % (29674)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.58/0.74 % (29670)First to succeed.
% 0.58/0.74 % (29670)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29666"
% 0.58/0.74 % (29672)Also succeeded, but the first one will report.
% 0.58/0.74 % (29668)Also succeeded, but the first one will report.
% 0.58/0.74 % (29670)Refutation found. Thanks to Tanya!
% 0.58/0.74 % SZS status Theorem for Vampire---4
% 0.58/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.74 % (29670)------------------------------
% 0.58/0.74 % (29670)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (29670)Termination reason: Refutation
% 0.58/0.74
% 0.58/0.74 % (29670)Memory used [KB]: 1184
% 0.58/0.74 % (29670)Time elapsed: 0.008 s
% 0.58/0.74 % (29670)Instructions burned: 11 (million)
% 0.58/0.74 % (29666)Success in time 0.376 s
% 0.58/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------