TSTP Solution File: LCL774_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL774_5 : TPTP v8.2.0. Released v6.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 : n012.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 00:22:48 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 45
% Syntax : Number of formulae : 51 ( 8 unt; 43 typ; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 44 ( 23 >; 21 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 28 ( 28 usr; 6 con; 0-5 aty)
% Number of variables : 24 ( 3 !; 0 ?; 24 :)
% ( 21 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
plus_plus:
!>[X0: $tType] : fun(X0,fun(X0,X0)) ).
tff(func_def_1,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
it: fun(dB,bool) ).
tff(func_def_3,type,
abs: dB > dB ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_7,type,
dB_rec:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB ) > X0 ) ).
tff(func_def_8,type,
dB_size: dB > nat ).
tff(func_def_9,type,
lift: ( dB * nat ) > dB ).
tff(func_def_10,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_11,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_12,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_15,type,
suc: nat > nat ).
tff(func_def_16,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_17,type,
fFalse: bool ).
tff(func_def_18,type,
fTrue: bool ).
tff(func_def_19,type,
i: nat ).
tff(func_def_20,type,
r: dB ).
tff(func_def_21,type,
sK0: fun(nat,bool) > nat ).
tff(func_def_22,type,
sK1: fun(nat,bool) > nat ).
tff(func_def_23,type,
sK2:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_24,type,
sK3: nat > nat ).
tff(func_def_25,type,
sK4: nat > nat ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
beta: ( dB * dB ) > $o ).
tff(pred_def_10,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_11,type,
pp: bool > $o ).
tff(pred_def_12,type,
sQ5_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f328,plain,
$false,
inference(subsumption_resolution,[],[f191,f195]) ).
tff(f195,plain,
! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
inference(cnf_transformation,[],[f116]) ).
tff(f116,plain,
! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X3: nat] : pp(aa(dB,bool,it,var(X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_Var__IT) ).
tff(f191,plain,
~ pp(aa(dB,bool,it,var(i))),
inference(cnf_transformation,[],[f112]) ).
tff(f112,plain,
~ pp(aa(dB,bool,it,var(i))),
inference(flattening,[],[f111]) ).
tff(f111,negated_conjecture,
~ pp(aa(dB,bool,it,var(i))),
inference(negated_conjecture,[],[f110]) ).
tff(f110,conjecture,
pp(aa(dB,bool,it,var(i))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL774_5 : TPTP v8.2.0. Released v6.0.0.
% 0.12/0.14 % 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.14/0.35 % Computer : n012.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 : Mon May 20 03:16:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF1_THM_EQU_NAR problem
% 0.14/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/benchmark/theBenchmark.p
% 0.55/0.74 % (30522)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.74 % (30515)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.74 % (30517)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.74 % (30516)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.74 % (30518)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.74 % (30519)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.74 % (30520)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.74 % (30521)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.74 % (30522)First to succeed.
% 0.55/0.74 % (30522)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30514"
% 0.55/0.74 % (30522)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for theBenchmark
% 0.55/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74 % (30522)------------------------------
% 0.55/0.74 % (30522)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (30522)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (30522)Memory used [KB]: 1116
% 0.55/0.74 % (30522)Time elapsed: 0.003 s
% 0.55/0.74 % (30522)Instructions burned: 8 (million)
% 0.55/0.74 % (30514)Success in time 0.38 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------