TSTP Solution File: NUM592+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM592+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 : n010.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:18 EDT 2024
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 8 unt; 0 def)
% Number of atoms : 141 ( 21 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 172 ( 75 ~; 62 |; 29 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 38 ( 31 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f703,plain,
$false,
inference(avatar_sat_refutation,[],[f678,f686,f694]) ).
fof(f694,plain,
spl22_22,
inference(avatar_contradiction_clause,[],[f693]) ).
fof(f693,plain,
( $false
| spl22_22 ),
inference(subsumption_resolution,[],[f692,f318]) ).
fof(f318,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
( ! [X0] :
( xu = sdtlpdtrp0(xd,X0)
| ~ aElementOf0(X0,slbdtsldtrb0(xX,xk))
| ~ aSet0(X0) )
& isCountable0(xX)
& aSubsetOf0(xX,xY)
& aElementOf0(xu,xT) ),
inference(flattening,[],[f119]) ).
fof(f119,plain,
( ! [X0] :
( xu = sdtlpdtrp0(xd,X0)
| ~ aElementOf0(X0,slbdtsldtrb0(xX,xk))
| ~ aSet0(X0) )
& isCountable0(xX)
& aSubsetOf0(xX,xY)
& aElementOf0(xu,xT) ),
inference(ennf_transformation,[],[f93]) ).
fof(f93,axiom,
( ! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xX,xk))
& aSet0(X0) )
=> xu = sdtlpdtrp0(xd,X0) )
& isCountable0(xX)
& aSubsetOf0(xX,xY)
& aElementOf0(xu,xT) ),
file('/export/starexec/sandbox/tmp/tmp.u9zuQOgk6a/Vampire---4.8_16665',m__4545) ).
fof(f692,plain,
( ~ aElementOf0(xu,xT)
| spl22_22 ),
inference(subsumption_resolution,[],[f691,f320]) ).
fof(f320,plain,
isCountable0(xX),
inference(cnf_transformation,[],[f120]) ).
fof(f691,plain,
( ~ isCountable0(xX)
| ~ aElementOf0(xu,xT)
| spl22_22 ),
inference(subsumption_resolution,[],[f689,f319]) ).
fof(f319,plain,
aSubsetOf0(xX,xY),
inference(cnf_transformation,[],[f120]) ).
fof(f689,plain,
( ~ aSubsetOf0(xX,xY)
| ~ isCountable0(xX)
| ~ aElementOf0(xu,xT)
| spl22_22 ),
inference(resolution,[],[f677,f470]) ).
fof(f470,plain,
! [X0,X1] :
( aElementOf0(sK6(X0,X1),slbdtsldtrb0(X1,xk))
| ~ aSubsetOf0(X1,xY)
| ~ isCountable0(X1)
| ~ aElementOf0(X0,xT) ),
inference(forward_demodulation,[],[f323,f311]) ).
fof(f311,plain,
xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(cnf_transformation,[],[f91]) ).
fof(f91,axiom,
( xd = sdtlpdtrp0(xC,xi)
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) ),
file('/export/starexec/sandbox/tmp/tmp.u9zuQOgk6a/Vampire---4.8_16665',m__4448_02) ).
fof(f323,plain,
! [X0,X1] :
( aElementOf0(sK6(X0,X1),slbdtsldtrb0(X1,xk))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f220]) ).
fof(f220,plain,
! [X0] :
( ! [X1] :
( ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),sK6(X0,X1)) != X0
& aElementOf0(sK6(X0,X1),slbdtsldtrb0(X1,xk))
& aSet0(sK6(X0,X1)) )
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
| ~ aElementOf0(X0,xT) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f122,f219]) ).
fof(f219,plain,
! [X0,X1] :
( ? [X2] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) != X0
& aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2) )
=> ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),sK6(X0,X1)) != X0
& aElementOf0(sK6(X0,X1),slbdtsldtrb0(X1,xk))
& aSet0(sK6(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ? [X2] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) != X0
& aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2) )
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
| ~ aElementOf0(X0,xT) ),
inference(flattening,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ? [X2] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) != X0
& aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2) )
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
| ~ aElementOf0(X0,xT) ),
inference(ennf_transformation,[],[f95]) ).
fof(f95,negated_conjecture,
~ ? [X0] :
( ? [X1] :
( ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) = X0 )
& isCountable0(X1)
& aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aElementOf0(X0,xT) ),
inference(negated_conjecture,[],[f94]) ).
fof(f94,conjecture,
? [X0] :
( ? [X1] :
( ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(X1,xk))
& aSet0(X2) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) = X0 )
& isCountable0(X1)
& aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aElementOf0(X0,xT) ),
file('/export/starexec/sandbox/tmp/tmp.u9zuQOgk6a/Vampire---4.8_16665',m__) ).
fof(f677,plain,
( ~ aElementOf0(sK6(xu,xX),slbdtsldtrb0(xX,xk))
| spl22_22 ),
inference(avatar_component_clause,[],[f675]) ).
fof(f675,plain,
( spl22_22
<=> aElementOf0(sK6(xu,xX),slbdtsldtrb0(xX,xk)) ),
introduced(avatar_definition,[new_symbols(naming,[spl22_22])]) ).
fof(f686,plain,
spl22_21,
inference(avatar_contradiction_clause,[],[f685]) ).
fof(f685,plain,
( $false
| spl22_21 ),
inference(subsumption_resolution,[],[f684,f318]) ).
fof(f684,plain,
( ~ aElementOf0(xu,xT)
| spl22_21 ),
inference(subsumption_resolution,[],[f683,f320]) ).
fof(f683,plain,
( ~ isCountable0(xX)
| ~ aElementOf0(xu,xT)
| spl22_21 ),
inference(subsumption_resolution,[],[f681,f319]) ).
fof(f681,plain,
( ~ aSubsetOf0(xX,xY)
| ~ isCountable0(xX)
| ~ aElementOf0(xu,xT)
| spl22_21 ),
inference(resolution,[],[f673,f471]) ).
fof(f471,plain,
! [X0,X1] :
( aSet0(sK6(X0,X1))
| ~ aSubsetOf0(X1,xY)
| ~ isCountable0(X1)
| ~ aElementOf0(X0,xT) ),
inference(forward_demodulation,[],[f322,f311]) ).
fof(f322,plain,
! [X0,X1] :
( aSet0(sK6(X0,X1))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f220]) ).
fof(f673,plain,
( ~ aSet0(sK6(xu,xX))
| spl22_21 ),
inference(avatar_component_clause,[],[f671]) ).
fof(f671,plain,
( spl22_21
<=> aSet0(sK6(xu,xX)) ),
introduced(avatar_definition,[new_symbols(naming,[spl22_21])]) ).
fof(f678,plain,
( ~ spl22_21
| ~ spl22_22 ),
inference(avatar_split_clause,[],[f669,f675,f671]) ).
fof(f669,plain,
( ~ aElementOf0(sK6(xu,xX),slbdtsldtrb0(xX,xk))
| ~ aSet0(sK6(xu,xX)) ),
inference(subsumption_resolution,[],[f668,f318]) ).
fof(f668,plain,
( ~ aElementOf0(xu,xT)
| ~ aElementOf0(sK6(xu,xX),slbdtsldtrb0(xX,xk))
| ~ aSet0(sK6(xu,xX)) ),
inference(equality_resolution,[],[f656]) ).
fof(f656,plain,
! [X0] :
( xu != X0
| ~ aElementOf0(X0,xT)
| ~ aElementOf0(sK6(X0,xX),slbdtsldtrb0(xX,xk))
| ~ aSet0(sK6(X0,xX)) ),
inference(superposition,[],[f489,f321]) ).
fof(f321,plain,
! [X0] :
( xu = sdtlpdtrp0(xd,X0)
| ~ aElementOf0(X0,slbdtsldtrb0(xX,xk))
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f489,plain,
! [X0] :
( sdtlpdtrp0(xd,sK6(X0,xX)) != X0
| ~ aElementOf0(X0,xT) ),
inference(subsumption_resolution,[],[f488,f320]) ).
fof(f488,plain,
! [X0] :
( sdtlpdtrp0(xd,sK6(X0,xX)) != X0
| ~ isCountable0(xX)
| ~ aElementOf0(X0,xT) ),
inference(resolution,[],[f319,f469]) ).
fof(f469,plain,
! [X0,X1] :
( ~ aSubsetOf0(X1,xY)
| sdtlpdtrp0(xd,sK6(X0,X1)) != X0
| ~ isCountable0(X1)
| ~ aElementOf0(X0,xT) ),
inference(forward_demodulation,[],[f468,f311]) ).
fof(f468,plain,
! [X0,X1] :
( sdtlpdtrp0(xd,sK6(X0,X1)) != X0
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT) ),
inference(forward_demodulation,[],[f324,f312]) ).
fof(f312,plain,
xd = sdtlpdtrp0(xC,xi),
inference(cnf_transformation,[],[f91]) ).
fof(f324,plain,
! [X0,X1] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),sK6(X0,X1)) != X0
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f220]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM592+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % 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.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 14:35:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.u9zuQOgk6a/Vampire---4.8_16665
% 0.55/0.74 % (16996)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.55/0.74 % (16990)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.55/0.74 % (16992)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.55/0.74 % (16991)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.55/0.74 % (16993)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.55/0.74 % (16994)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.55/0.74 % (16995)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.55/0.74 % (16997)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.55/0.75 % (16992)First to succeed.
% 0.55/0.75 % (16992)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16915"
% 0.55/0.75 % (16992)Refutation found. Thanks to Tanya!
% 0.55/0.75 % SZS status Theorem for Vampire---4
% 0.55/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75 % (16992)------------------------------
% 0.55/0.75 % (16992)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (16992)Termination reason: Refutation
% 0.55/0.75
% 0.55/0.75 % (16992)Memory used [KB]: 1378
% 0.55/0.75 % (16992)Time elapsed: 0.017 s
% 0.55/0.75 % (16992)Instructions burned: 26 (million)
% 0.55/0.75 % (16915)Success in time 0.384 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------