TSTP Solution File: NUM565+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM565+3 : TPTP v8.2.0. 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 : n020.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 : Tue May 21 01:43:18 EDT 2024
% Result : Theorem 0.54s 0.73s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 112 ( 40 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 124 ( 36 ~; 17 |; 58 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 23 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f458,plain,
$false,
inference(trivial_inequality_removal,[],[f454]) ).
fof(f454,plain,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,slcrc0),
inference(backward_demodulation,[],[f303,f450]) ).
fof(f450,plain,
slcrc0 = sK14,
inference(subsumption_resolution,[],[f449,f296]) ).
fof(f296,plain,
aSet0(sK14),
inference(cnf_transformation,[],[f198]) ).
fof(f198,plain,
( sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK14)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& aElementOf0(sK14,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(sK14)
& aSubsetOf0(sK14,xS)
& ! [X2] :
( aElementOf0(X2,xS)
| ~ aElementOf0(X2,sK14) )
& aSet0(sK14) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f196,f197]) ).
fof(f197,plain,
( ? [X0] :
( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X2] :
( aElementOf0(X2,xS)
| ~ aElementOf0(X2,X0) )
& aSet0(X0) )
=> ( sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK14)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& aElementOf0(sK14,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(sK14)
& aSubsetOf0(sK14,xS)
& ! [X2] :
( aElementOf0(X2,xS)
| ~ aElementOf0(X2,sK14) )
& aSet0(sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f196,plain,
? [X0] :
( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X2] :
( aElementOf0(X2,xS)
| ~ aElementOf0(X2,X0) )
& aSet0(X0) ),
inference(rectify,[],[f100]) ).
fof(f100,plain,
? [X0] :
( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
& ! [X2] : ~ aElementOf0(X2,slcrc0)
& aSet0(slcrc0)
& aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,X0) )
& aSet0(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
& ! [X2] : ~ aElementOf0(X2,slcrc0)
& aSet0(slcrc0)
& aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,X0) )
& aSet0(X0) ),
inference(ennf_transformation,[],[f85]) ).
fof(f85,plain,
~ ! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X2] : aElementOf0(X2,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
inference(rectify,[],[f81]) ).
fof(f81,negated_conjecture,
~ ! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X1] : aElementOf0(X1,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
inference(negated_conjecture,[],[f80]) ).
fof(f80,conjecture,
! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X1] : aElementOf0(X1,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f449,plain,
( slcrc0 = sK14
| ~ aSet0(sK14) ),
inference(trivial_inequality_removal,[],[f447]) ).
fof(f447,plain,
( xK != xK
| slcrc0 = sK14
| ~ aSet0(sK14) ),
inference(superposition,[],[f388,f386]) ).
fof(f386,plain,
xK = sbrdtbr0(sK14),
inference(definition_unfolding,[],[f299,f290]) ).
fof(f290,plain,
sz00 = xK,
inference(cnf_transformation,[],[f78]) ).
fof(f78,axiom,
sz00 = xK,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3462) ).
fof(f299,plain,
sz00 = sbrdtbr0(sK14),
inference(cnf_transformation,[],[f198]) ).
fof(f388,plain,
! [X0] :
( sbrdtbr0(X0) != xK
| slcrc0 = X0
| ~ aSet0(X0) ),
inference(definition_unfolding,[],[f319,f290]) ).
fof(f319,plain,
! [X0] :
( slcrc0 = X0
| sz00 != sbrdtbr0(X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f206]) ).
fof(f206,plain,
! [X0] :
( ( ( sz00 = sbrdtbr0(X0)
| slcrc0 != X0 )
& ( slcrc0 = X0
| sz00 != sbrdtbr0(X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f303,plain,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK14),
inference(cnf_transformation,[],[f198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM565+3 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 07:37:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/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/benchmark/theBenchmark.p
% 0.54/0.72 % (12444)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.72 % (12445)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.72 % (12446)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 theBenchmark for (2996ds/34Mi)
% 0.54/0.72 % (12447)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.72 % (12448)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 theBenchmark for (2996ds/83Mi)
% 0.54/0.72 % (12449)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.54/0.72 % (12442)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 theBenchmark for (2996ds/34Mi)
% 0.54/0.73 % (12444)First to succeed.
% 0.54/0.73 % (12444)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12441"
% 0.54/0.73 % (12444)Refutation found. Thanks to Tanya!
% 0.54/0.73 % SZS status Theorem for theBenchmark
% 0.54/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.73 % (12444)------------------------------
% 0.54/0.73 % (12444)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73 % (12444)Termination reason: Refutation
% 0.54/0.73
% 0.54/0.73 % (12444)Memory used [KB]: 1321
% 0.54/0.73 % (12444)Time elapsed: 0.007 s
% 0.54/0.73 % (12444)Instructions burned: 17 (million)
% 0.54/0.73 % (12441)Success in time 0.375 s
% 0.54/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------