TSTP Solution File: NUM531+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM531+2 : 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 : n021.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:02 EDT 2024
% Result : Theorem 0.55s 0.72s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 8 unt; 1 typ; 0 def)
% Number of atoms : 75 ( 8 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 54 ( 23 ~; 7 |; 20 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 25 ( 25 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 17 ( 11 !; 5 ?; 2 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_6,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f48,plain,
$false,
inference(subsumption_resolution,[],[f47,f27]) ).
tff(f27,plain,
aSet0(sK0),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
( ( slcrc0 = sK0 )
& ! [X1] : ~ aElementOf0(X1,sK0)
& isCountable0(sK0)
& aSet0(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f16,f20]) ).
tff(f20,plain,
( ? [X0] :
( ( slcrc0 = X0 )
& ! [X1] : ~ aElementOf0(X1,X0)
& isCountable0(X0)
& aSet0(X0) )
=> ( ( slcrc0 = sK0 )
& ! [X1] : ~ aElementOf0(X1,sK0)
& isCountable0(sK0)
& aSet0(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f16,plain,
? [X0] :
( ( slcrc0 = X0 )
& ! [X1] : ~ aElementOf0(X1,X0)
& isCountable0(X0)
& aSet0(X0) ),
inference(flattening,[],[f15]) ).
tff(f15,plain,
? [X0] :
( ( slcrc0 = X0 )
& ! [X1] : ~ aElementOf0(X1,X0)
& isCountable0(X0)
& aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
tff(f10,negated_conjecture,
~ ! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> ~ ( ( slcrc0 = X0 )
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
inference(negated_conjecture,[],[f9]) ).
tff(f9,conjecture,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> ~ ( ( slcrc0 = X0 )
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f47,plain,
~ aSet0(sK0),
inference(subsumption_resolution,[],[f46,f39]) ).
tff(f39,plain,
isFinite0(sK0),
inference(definition_unfolding,[],[f34,f30]) ).
tff(f30,plain,
slcrc0 = sK0,
inference(cnf_transformation,[],[f21]) ).
tff(f34,plain,
isFinite0(slcrc0),
inference(cnf_transformation,[],[f6]) ).
tff(f6,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEmpFin) ).
tff(f46,plain,
( ~ isFinite0(sK0)
| ~ aSet0(sK0) ),
inference(resolution,[],[f35,f28]) ).
tff(f28,plain,
isCountable0(sK0),
inference(cnf_transformation,[],[f21]) ).
tff(f35,plain,
! [X0: $i] :
( ~ isCountable0(X0)
| ~ isFinite0(X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
! [X0] :
( ~ isFinite0(X0)
| ~ isCountable0(X0)
| ~ aSet0(X0) ),
inference(flattening,[],[f18]) ).
tff(f18,plain,
! [X0] :
( ~ isFinite0(X0)
| ~ isCountable0(X0)
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,axiom,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> ~ isFinite0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : NUM531+2 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.11 % 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.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 07:13:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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.55/0.72 % (32715)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.55/0.72 % (32717)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.72 % (32718)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.55/0.72 % (32720)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.55/0.72 % (32719)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.55/0.72 % (32716)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 theBenchmark for (2996ds/51Mi)
% 0.55/0.72 % (32722)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.55/0.72 % (32721)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.55/0.72 % (32715)First to succeed.
% 0.55/0.72 % (32715)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32714"
% 0.55/0.72 % (32718)Also succeeded, but the first one will report.
% 0.55/0.72 % (32720)Also succeeded, but the first one will report.
% 0.55/0.72 % (32719)Refutation not found, incomplete strategy% (32719)------------------------------
% 0.55/0.72 % (32719)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72 % (32719)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.72
% 0.55/0.72 % (32719)Memory used [KB]: 967
% 0.55/0.72 % (32719)Time elapsed: 0.003 s
% 0.55/0.72 % (32719)Instructions burned: 2 (million)
% 0.55/0.72 % (32717)Also succeeded, but the first one will report.
% 0.55/0.72 % (32722)Also succeeded, but the first one will report.
% 0.55/0.72 % (32716)Also succeeded, but the first one will report.
% 0.55/0.72 % (32719)------------------------------
% 0.55/0.72 % (32719)------------------------------
% 0.55/0.72 % (32721)Also succeeded, but the first one will report.
% 0.55/0.72 % (32715)Refutation found. Thanks to Tanya!
% 0.55/0.72 % SZS status Theorem for theBenchmark
% 0.55/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.72 % (32715)------------------------------
% 0.55/0.72 % (32715)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72 % (32715)Termination reason: Refutation
% 0.55/0.72
% 0.55/0.72 % (32715)Memory used [KB]: 962
% 0.55/0.72 % (32715)Time elapsed: 0.002 s
% 0.55/0.72 % (32715)Instructions burned: 2 (million)
% 0.55/0.72 % (32714)Success in time 0.396 s
% 0.55/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------