TSTP Solution File: COM080_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM080_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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 : Mon May 20 19:10:26 EDT 2024
% Result : Theorem 0.73s 0.90s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 71
% Syntax : Number of formulae : 86 ( 5 unt; 67 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 14 ~; 5 |; 5 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 56 ( 37 >; 19 *; 0 +; 0 <<)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-5 aty)
% Number of functors : 47 ( 47 usr; 12 con; 0-5 aty)
% Number of variables : 73 ( 23 !; 2 ?; 73 :)
% ( 48 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
fm: $tType > $tType ).
tff(type_def_9,type,
nat: $tType ).
tff(type_def_10,type,
atom: $tType ).
tff(type_def_11,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_12,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
plus_plus:
!>[X0: $tType] : fun(X0,fun(X0,X0)) ).
tff(func_def_1,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
iprod:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).
tff(func_def_4,type,
zipwith0:
!>[X0: $tType,X1: $tType,X2: $tType] : ( fun(X0,fun(X1,X2)) > fun(list(X0),fun(list(X1),list(X2))) ) ).
tff(func_def_5,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_6,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_7,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_8,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_9,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_10,type,
set:
!>[X0: $tType] : ( list(X0) > fun(X0,bool) ) ).
tff(func_def_11,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_13,type,
list_conj:
!>[X0: $tType] : ( list(fm(X0)) > fm(X0) ) ).
tff(func_def_14,type,
list_disj:
!>[X0: $tType] : ( list(fm(X0)) > fm(X0) ) ).
tff(func_def_15,type,
map_fm:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * fm(X0) ) > fm(X1) ) ).
tff(func_def_16,type,
neg:
!>[X0: $tType] : ( fm(X0) > fm(X0) ) ).
tff(func_def_17,type,
suc: nat > nat ).
tff(func_def_18,type,
i_Z: fun(atom,fun(list(int),bool)) ).
tff(func_def_19,type,
asubst: ( int * list(int) ) > fun(atom,atom) ).
tff(func_def_20,type,
divisor: atom > int ).
tff(func_def_21,type,
lbounds: list(atom) > list(product_prod(int,list(int))) ).
tff(func_def_22,type,
qEpres896714165pres_1: list(atom) > fm(atom) ).
tff(func_def_23,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_24,type,
fFalse: bool ).
tff(func_def_25,type,
fTrue: bool ).
tff(func_def_26,type,
as: list(atom) ).
tff(func_def_27,type,
il: int ).
tff(func_def_28,type,
ksl: list(int) ).
tff(func_def_29,type,
m: int ).
tff(func_def_30,type,
xs: list(int) ).
tff(func_def_31,type,
sK0: atom ).
tff(func_def_32,type,
sK1:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_33,type,
sK2:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_34,type,
sK3:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_35,type,
sK4:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_36,type,
sK5: int ).
tff(func_def_37,type,
sK6: list(int) ).
tff(func_def_38,type,
sK7: int ).
tff(func_def_39,type,
sK8:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_40,type,
sK9:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_41,type,
sK10:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_42,type,
sK11:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(pred_def_1,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
cl_Groups_Oplus:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
ab_semigroup_add:
!>[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,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_13,type,
interpret:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(list(X1),bool)) * fm(X0) * list(X1) ) > $o ) ).
tff(pred_def_14,type,
qfree:
!>[X0: $tType] : ( fm(X0) > $o ) ).
tff(pred_def_15,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_16,type,
pp: bool > $o ).
tff(f199,plain,
$false,
inference(subsumption_resolution,[],[f197,f169]) ).
tff(f169,plain,
member(atom,sK0,set(atom,as)),
inference(cnf_transformation,[],[f150]) ).
tff(f150,plain,
( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,sK0),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m)),iprod(int,ksl,xs)),xs)))
& member(atom,sK0,set(atom,as)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f140,f149]) ).
tff(f149,plain,
( ? [X0: atom] :
( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X0),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m)),iprod(int,ksl,xs)),xs)))
& member(atom,X0,set(atom,as)) )
=> ( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,sK0),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m)),iprod(int,ksl,xs)),xs)))
& member(atom,sK0,set(atom,as)) ) ),
introduced(choice_axiom,[]) ).
tff(f140,plain,
? [X0: atom] :
( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X0),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m)),iprod(int,ksl,xs)),xs)))
& member(atom,X0,set(atom,as)) ),
inference(ennf_transformation,[],[f125]) ).
tff(f125,plain,
~ ! [X0: atom] :
( member(atom,X0,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X0),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m)),iprod(int,ksl,xs)),xs))) ),
inference(rectify,[],[f124]) ).
tff(f124,negated_conjecture,
~ ! [X22: atom] :
( member(atom,X22,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X22),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m)),iprod(int,ksl,xs)),xs))) ),
inference(negated_conjecture,[],[f123]) ).
tff(f123,conjecture,
! [X22: atom] :
( member(atom,X22,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X22),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m)),iprod(int,ksl,xs)),xs))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f197,plain,
~ member(atom,sK0,set(atom,as)),
inference(resolution,[],[f195,f183]) ).
tff(f183,plain,
! [X0: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m),ksl),X0)),xs))
| ~ member(atom,X0,set(atom,as)) ),
inference(cnf_transformation,[],[f146]) ).
tff(f146,plain,
! [X0: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m),ksl),X0)),xs))
| ~ member(atom,X0,set(atom,as)) ),
inference(ennf_transformation,[],[f133]) ).
tff(f133,plain,
! [X0: atom] :
( member(atom,X0,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m),ksl),X0)),xs)) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X4: atom] :
( member(atom,X4,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m),ksl),X4)),xs)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__096ALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_A_Iasubst_A_Iil_A_L_Am_J_Aksl_Aa_J_Axs_096) ).
tff(f195,plain,
~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m),ksl),sK0)),xs)),
inference(resolution,[],[f170,f190]) ).
tff(f190,plain,
! [X2: list(int),X3: int,X0: list(int),X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),X3),iprod(int,X2,X0)),X0)))
| ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(X3,X2),X1)),X0)) ),
inference(cnf_transformation,[],[f168]) ).
tff(f168,plain,
! [X0: list(int),X1: atom,X2: list(int),X3: int] :
( ( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(X3,X2),X1)),X0))
| ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),X3),iprod(int,X2,X0)),X0))) )
& ( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),X3),iprod(int,X2,X0)),X0)))
| ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(X3,X2),X1)),X0)) ) ),
inference(nnf_transformation,[],[f139]) ).
tff(f139,plain,
! [X0: list(int),X1: atom,X2: list(int),X3: int] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(X3,X2),X1)),X0))
<=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),X3),iprod(int,X2,X0)),X0))) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X12: list(int),X13: atom,X14: list(int),X15: int] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,aa(atom,atom,asubst(X15,X14),X13)),X12))
<=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X13),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),X15),iprod(int,X14,X12)),X12))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_IZ__asubst) ).
tff(f170,plain,
~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,sK0),cons(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),aa(int,int,aa(int,fun(int,int),plus_plus(int),il),m)),iprod(int,ksl,xs)),xs))),
inference(cnf_transformation,[],[f150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : COM080_5 : TPTP v8.2.0. Released v6.0.0.
% 0.14/0.15 % 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.15/0.36 % Computer : n007.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 : Sun May 19 10:11:53 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.89 % (7263)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 (2994ds/34Mi)
% 0.73/0.89 % (7265)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.73/0.89 % (7264)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 (2994ds/51Mi)
% 0.73/0.89 % (7267)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 (2994ds/34Mi)
% 0.73/0.89 % (7266)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.73/0.89 % (7268)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.73/0.89 % (7269)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 (2994ds/83Mi)
% 0.73/0.89 % (7270)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 (2994ds/56Mi)
% 0.73/0.89 % (7269)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.73/0.89 % (7268)First to succeed.
% 0.73/0.89 % (7270)Also succeeded, but the first one will report.
% 0.73/0.89 % (7269)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.73/0.90 % (7268)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-7262"
% 0.73/0.90 % (7268)Refutation found. Thanks to Tanya!
% 0.73/0.90 % SZS status Theorem for theBenchmark
% 0.73/0.90 % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.90 % (7268)------------------------------
% 0.73/0.90 % (7268)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (7268)Termination reason: Refutation
% 0.73/0.90
% 0.73/0.90 % (7268)Memory used [KB]: 1110
% 0.73/0.90 % (7268)Time elapsed: 0.005 s
% 0.73/0.90 % (7268)Instructions burned: 7 (million)
% 0.73/0.90 % (7262)Success in time 0.521 s
% 0.73/0.90 % Vampire---4.8 exiting
%------------------------------------------------------------------------------