TSTP Solution File: LCL793_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL793_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 : 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 : Sun May 5 07:42:32 EDT 2024
% Result : Theorem 0.52s 0.75s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 47
% Syntax : Number of formulae : 56 ( 8 unt; 44 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 40 ( 21 >; 19 *; 0 +; 0 <<)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 23 ( 23 usr; 5 con; 0-5 aty)
% Number of variables : 30 ( 8 !; 0 ?; 30 :)
% ( 22 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
char: $tType ).
tff(type_def_9,type,
literal: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * 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,
app: ( dB * dB ) > dB ).
tff(func_def_4,type,
var: nat > dB ).
tff(func_def_5,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_6,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_7,type,
dB_size: dB > nat ).
tff(func_def_8,type,
lift: ( dB * nat ) > dB ).
tff(func_def_9,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_10,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_12,type,
nat_size: nat > nat ).
tff(func_def_13,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_14,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_15,type,
char_size: char > 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,
t: dB ).
tff(func_def_20,type,
u: dB ).
tff(func_def_21,type,
ua: dB ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
ordere223160158up_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
it: dB > $o ).
tff(pred_def_14,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_15,type,
pp: bool > $o ).
tff(pred_def_16,type,
sQ0_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f306,plain,
$false,
inference(subsumption_resolution,[],[f305,f256]) ).
tff(f256,plain,
it(lift(u,zero_zero(nat))),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
it(lift(u,zero_zero(nat))),
file('/export/starexec/sandbox/tmp/tmp.5BG8OrU5QN/Vampire---4.8_1166',fact_3__096IT_A_Ilift_Au_A0_J_096) ).
tff(f305,plain,
~ it(lift(u,zero_zero(nat))),
inference(resolution,[],[f222,f197]) ).
tff(f197,plain,
~ it(app(lift(u,zero_zero(nat)),var(zero_zero(nat)))),
inference(cnf_transformation,[],[f119]) ).
tff(f119,plain,
~ it(app(lift(u,zero_zero(nat)),var(zero_zero(nat)))),
inference(flattening,[],[f118]) ).
tff(f118,negated_conjecture,
~ it(app(lift(u,zero_zero(nat)),var(zero_zero(nat)))),
inference(negated_conjecture,[],[f117]) ).
tff(f117,conjecture,
it(app(lift(u,zero_zero(nat)),var(zero_zero(nat)))),
file('/export/starexec/sandbox/tmp/tmp.5BG8OrU5QN/Vampire---4.8_1166',conj_0) ).
tff(f222,plain,
! [X0: nat,X1: dB] :
( it(app(X1,var(X0)))
| ~ it(X1) ),
inference(cnf_transformation,[],[f168]) ).
tff(f168,plain,
! [X0: nat,X1: dB] :
( it(app(X1,var(X0)))
| ~ it(X1) ),
inference(ennf_transformation,[],[f137]) ).
tff(f137,plain,
! [X0: nat,X1: dB] :
( it(X1)
=> it(app(X1,var(X0))) ),
inference(rectify,[],[f7]) ).
tff(f7,axiom,
! [X3: nat,X4: dB] :
( it(X4)
=> it(app(X4,var(X3))) ),
file('/export/starexec/sandbox/tmp/tmp.5BG8OrU5QN/Vampire---4.8_1166',fact_6_app__Var__IT) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL793_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.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 13:23:58 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 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/tmp/tmp.5BG8OrU5QN/Vampire---4.8_1166
% 0.52/0.75 % (1275)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.52/0.75 % (1278)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.52/0.75 % (1277)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.52/0.75 % (1279)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.52/0.75 % (1276)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.52/0.75 % (1280)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.52/0.75 % (1281)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.52/0.75 % (1282)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.52/0.75 % (1281)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.52/0.75 % (1275)First to succeed.
% 0.52/0.75 % (1282)Also succeeded, but the first one will report.
% 0.52/0.75 % (1275)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1274"
% 0.52/0.75 % (1281)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.52/0.75 % (1278)Also succeeded, but the first one will report.
% 0.52/0.75 % (1280)Also succeeded, but the first one will report.
% 0.52/0.75 % (1275)Refutation found. Thanks to Tanya!
% 0.52/0.75 % SZS status Theorem for Vampire---4
% 0.52/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.52/0.75 % (1275)------------------------------
% 0.52/0.75 % (1275)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.75 % (1275)Termination reason: Refutation
% 0.52/0.75
% 0.52/0.75 % (1275)Memory used [KB]: 1091
% 0.52/0.75 % (1275)Time elapsed: 0.003 s
% 0.52/0.75 % (1275)Instructions burned: 5 (million)
% 0.52/0.75 % (1274)Success in time 0.381 s
% 0.52/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------