TSTP Solution File: LCL773_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL773_5 : TPTP v8.1.2. 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 : 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 : Wed May 1 03:20:01 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 55
% Syntax : Number of formulae : 63 ( 7 unt; 52 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 71 ( 33 >; 38 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 32 ( 32 usr; 6 con; 0-5 aty)
% Number of variables : 33 ( 12 !; 0 ?; 33 :)
% ( 21 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
dB: $tType ).
tff(type_def_8,type,
list: $tType > $tType ).
tff(type_def_9,type,
nat: $tType ).
tff(type_def_10,type,
char: $tType ).
tff(type_def_11,type,
literal: $tType ).
tff(type_def_12,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
sgn_sgn:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_1,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
bool_size: bool > nat ).
tff(func_def_3,type,
if:
!>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
it: fun(dB,bool) ).
tff(func_def_5,type,
abs: dB > dB ).
tff(func_def_6,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_7,type,
var: nat > dB ).
tff(func_def_8,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_9,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_10,type,
dB_size: dB > nat ).
tff(func_def_11,type,
lift: ( dB * nat ) > dB ).
tff(func_def_12,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_13,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_14,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_15,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_16,type,
nat_size: nat > nat ).
tff(func_def_17,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
char_size: char > nat ).
tff(func_def_20,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_21,type,
fFalse: bool ).
tff(func_def_22,type,
fTrue: bool ).
tff(func_def_23,type,
i: nat ).
tff(func_def_24,type,
r: dB ).
tff(func_def_25,type,
sK4:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_26,type,
sK5: ( dB * dB * dB ) > dB ).
tff(func_def_27,type,
sK6: ( dB * dB * dB ) > dB ).
tff(func_def_28,type,
sK7: ( dB * dB * dB ) > dB ).
tff(func_def_29,type,
sK8: ( dB * dB ) > dB ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
sgn_if:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
beta: ( dB * dB ) > $o ).
tff(pred_def_8,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_9,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_10,type,
pp: bool > $o ).
tff(pred_def_11,type,
sP0: ( nat * nat * fun(nat,fun(nat,bool)) ) > $o ).
tff(pred_def_12,type,
sP1: ( nat * nat * fun(nat,fun(nat,bool)) ) > $o ).
tff(pred_def_13,type,
sP2: ( dB * dB * dB ) > $o ).
tff(pred_def_14,type,
sP3: ( dB * dB * dB ) > $o ).
tff(f317,plain,
$false,
inference(unit_resulting_resolution,[],[f227,f229,f232]) ).
tff(f232,plain,
! [X2: dB,X0: nat,X1: nat] :
( pp(aa(dB,bool,it,subst(X2,var(X1),X0)))
| ~ pp(aa(dB,bool,it,X2)) ),
inference(cnf_transformation,[],[f171]) ).
tff(f171,plain,
! [X0: nat,X1: nat,X2: dB] :
( pp(aa(dB,bool,it,subst(X2,var(X1),X0)))
| ~ pp(aa(dB,bool,it,X2)) ),
inference(ennf_transformation,[],[f126]) ).
tff(f126,plain,
! [X0: nat,X1: nat,X2: dB] :
( pp(aa(dB,bool,it,X2))
=> pp(aa(dB,bool,it,subst(X2,var(X1),X0))) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X4: nat,X5: nat,X6: dB] :
( pp(aa(dB,bool,it,X6))
=> pp(aa(dB,bool,it,subst(X6,var(X5),X4))) ),
file('/export/starexec/sandbox/tmp/tmp.jsoYRmGKvI/Vampire---4.8_18516',fact_1_subst__Var__IT) ).
tff(f229,plain,
~ pp(aa(dB,bool,it,subst(r,var(i),zero_zero(nat)))),
inference(cnf_transformation,[],[f123]) ).
tff(f123,plain,
~ pp(aa(dB,bool,it,subst(r,var(i),zero_zero(nat)))),
inference(flattening,[],[f122]) ).
tff(f122,negated_conjecture,
~ pp(aa(dB,bool,it,subst(r,var(i),zero_zero(nat)))),
inference(negated_conjecture,[],[f121]) ).
tff(f121,conjecture,
pp(aa(dB,bool,it,subst(r,var(i),zero_zero(nat)))),
file('/export/starexec/sandbox/tmp/tmp.jsoYRmGKvI/Vampire---4.8_18516',conj_2) ).
tff(f227,plain,
pp(aa(dB,bool,it,r)),
inference(cnf_transformation,[],[f119]) ).
tff(f119,axiom,
pp(aa(dB,bool,it,r)),
file('/export/starexec/sandbox/tmp/tmp.jsoYRmGKvI/Vampire---4.8_18516',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL773_5 : TPTP v8.1.2. Released v6.0.0.
% 0.11/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.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Apr 30 16:41:17 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TF1_THM_EQU_NAR problem
% 0.15/0.37 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.jsoYRmGKvI/Vampire---4.8_18516
% 0.57/0.76 % (18774)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.57/0.76 % (18774)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.57/0.76 % (18775)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.57/0.76 % (18768)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.57/0.76 % (18770)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.57/0.76 % (18769)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.57/0.76 % (18772)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.57/0.76 % (18773)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.57/0.76 % (18771)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.57/0.76 % (18774)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.57/0.76 % (18774)First to succeed.
% 0.57/0.76 % (18775)Also succeeded, but the first one will report.
% 0.57/0.76 % (18774)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (18774)------------------------------
% 0.57/0.76 % (18774)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (18774)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (18774)Memory used [KB]: 1176
% 0.57/0.76 % (18774)Time elapsed: 0.004 s
% 0.57/0.76 % (18774)Instructions burned: 10 (million)
% 0.57/0.76 % (18774)------------------------------
% 0.57/0.76 % (18774)------------------------------
% 0.57/0.76 % (18764)Success in time 0.382 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------