TSTP Solution File: COM045_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM045_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 04:46:22 EDT 2024
% Result : Theorem 0.61s 0.77s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 59
% Syntax : Number of formulae : 72 ( 10 unt; 55 typ; 0 def)
% Number of atoms : 24 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 4 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 4 ( 3 usr)
% Number of type conns : 48 ( 23 >; 25 *; 0 +; 0 <<)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-3 aty)
% Number of functors : 32 ( 32 usr; 10 con; 0-5 aty)
% Number of variables : 66 ( 26 !; 0 ?; 66 :)
% ( 40 !>; 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,
atom: $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
div_mod:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
plus_plus:
!>[X0: $tType] : fun(X0,fun(X0,X0)) ).
tff(func_def_3,type,
times_times:
!>[X0: $tType] : ( X0 > fun(X0,X0) ) ).
tff(func_def_4,type,
iprod:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).
tff(func_def_5,type,
zipwith0:
!>[X0: $tType,X1: $tType,X2: $tType] : ( fun(X0,fun(X1,X2)) > fun(list(X0),fun(list(X1),list(X2))) ) ).
tff(func_def_6,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_7,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_8,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_9,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_10,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
asubst: ( int * list(int) * atom ) > atom ).
tff(func_def_12,type,
c_PresArith_Oatom_OLe: ( int * list(int) ) > atom ).
tff(func_def_13,type,
nDvd: ( int * int * list(int) ) > atom ).
tff(func_def_14,type,
atom_case:
!>[X0: $tType] : ( ( fun(int,fun(list(int),X0)) * fun(int,fun(int,fun(list(int),X0))) * fun(int,fun(int,fun(list(int),X0))) * atom ) > X0 ) ).
tff(func_def_15,type,
atom_rec:
!>[X0: $tType] : ( ( fun(int,fun(list(int),X0)) * fun(int,fun(int,fun(list(int),X0))) * fun(int,fun(int,fun(list(int),X0))) * atom ) > X0 ) ).
tff(func_def_16,type,
divisor: atom > int ).
tff(func_def_17,type,
hd_coeff: atom > int ).
tff(func_def_18,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_19,type,
fFalse: bool ).
tff(func_def_20,type,
fTrue: bool ).
tff(func_def_21,type,
a: atom ).
tff(func_def_22,type,
d: int ).
tff(func_def_23,type,
e: list(int) ).
tff(func_def_24,type,
i: int ).
tff(func_def_25,type,
j: int ).
tff(func_def_26,type,
ks: list(int) ).
tff(func_def_27,type,
ks1: list(int) ).
tff(func_def_28,type,
l: int ).
tff(func_def_29,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
cl_Groups_Oplus:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
comm_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
semiring_div:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
comm_monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
ab_semigroup_mult:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
ab_sem1668676832m_mult:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_18,type,
i_Z: ( atom * list(int) ) > $o ).
tff(pred_def_19,type,
pp: bool > $o ).
tff(pred_def_20,type,
sQ1_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f288,plain,
$false,
inference(subsumption_resolution,[],[f287,f227]) ).
tff(f227,plain,
semiring_div(int),
inference(cnf_transformation,[],[f107]) ).
tff(f107,axiom,
semiring_div(int),
file('/export/starexec/sandbox2/tmp/tmp.rleXV95MFR/Vampire---4.8_9203',arity_Int_Oint___Divides_Osemiring__div) ).
tff(f287,plain,
~ semiring_div(int),
inference(resolution,[],[f249,f278]) ).
tff(f278,plain,
~ sQ1_eqProxy(int,div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d),div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),div_mod(int,l,d)),div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e)),d)),d)),
inference(forward_literal_rewriting,[],[f234,f276]) ).
tff(f276,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ1_eqProxy(X0,X2,X1)
| ~ sQ1_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f233]) ).
tff(f233,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ1_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ1_eqProxy])]) ).
tff(f234,plain,
~ sQ1_eqProxy(int,div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),div_mod(int,l,d)),div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e)),d)),d),div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d)),
inference(equality_proxy_replacement,[],[f190,f233]) ).
tff(f190,plain,
div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),div_mod(int,l,d)),div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e)),d)),d) != div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d),
inference(cnf_transformation,[],[f121]) ).
tff(f121,plain,
div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),div_mod(int,l,d)),div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e)),d)),d) != div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d),
inference(flattening,[],[f120]) ).
tff(f120,negated_conjecture,
( ~ div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),div_mod(int,l,d)),div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e)),d)),d) = div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d) ),
inference(negated_conjecture,[],[f119]) ).
tff(f119,conjecture,
div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),div_mod(int,l,d)),div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e)),d)),d) = div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d),
file('/export/starexec/sandbox2/tmp/tmp.rleXV95MFR/Vampire---4.8_9203',conj_0) ).
tff(f249,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0] :
( sQ1_eqProxy(X0,div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),X2),X1),div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),div_mod(X0,X3,X1)),div_mod(X0,X2,X1)),X1))
| ~ semiring_div(X0) ),
inference(equality_proxy_replacement,[],[f205,f233]) ).
tff(f205,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0] :
( ( div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),X2),X1) = div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),div_mod(X0,X3,X1)),div_mod(X0,X2,X1)),X1) )
| ~ semiring_div(X0) ),
inference(cnf_transformation,[],[f169]) ).
tff(f169,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0,X3: X0] : ( div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),X2),X1) = div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),div_mod(X0,X3,X1)),div_mod(X0,X2,X1)),X1) )
| ~ semiring_div(X0) ),
inference(ennf_transformation,[],[f136]) ).
tff(f136,plain,
! [X0: $tType] :
( semiring_div(X0)
=> ! [X1: X0,X2: X0,X3: X0] : ( div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),X2),X1) = div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),div_mod(X0,X3,X1)),div_mod(X0,X2,X1)),X1) ) ),
inference(rectify,[],[f22]) ).
tff(f22,axiom,
! [X0: $tType] :
( semiring_div(X0)
=> ! [X12: X0,X4: X0,X5: X0] : ( div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X5),X4),X12) = div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),div_mod(X0,X5,X12)),div_mod(X0,X4,X12)),X12) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rleXV95MFR/Vampire---4.8_9203',fact_21_mod__add__eq) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : COM045_5 : TPTP v8.1.2. 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.16/0.36 % Computer : n013.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.22/0.36 % CPULimit : 300
% 0.22/0.36 % WCLimit : 300
% 0.22/0.36 % DateTime : Fri May 3 21:25:53 EDT 2024
% 0.22/0.36 % CPUTime :
% 0.22/0.36 This is a TF1_THM_EQU_NAR problem
% 0.22/0.36 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/tmp/tmp.rleXV95MFR/Vampire---4.8_9203
% 0.61/0.76 % (9380)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.61/0.76 % (9384)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.61/0.76 % (9383)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.61/0.76 % (9382)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.61/0.76 % (9386)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.61/0.77 % (9381)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.61/0.77 % (9385)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.61/0.77 % (9387)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.61/0.77 % (9387)Refutation not found, incomplete strategy% (9387)------------------------------
% 0.61/0.77 % (9387)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77 % (9387)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (9387)Memory used [KB]: 1092
% 0.61/0.77 % (9387)Time elapsed: 0.004 s
% 0.61/0.77 % (9387)Instructions burned: 4 (million)
% 0.61/0.77 % (9385)Refutation not found, incomplete strategy% (9385)------------------------------
% 0.61/0.77 % (9385)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77 % (9385)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (9385)Memory used [KB]: 1095
% 0.61/0.77 % (9385)Time elapsed: 0.004 s
% 0.61/0.77 % (9385)Instructions burned: 4 (million)
% 0.61/0.77 % (9386)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.77 % (9380)First to succeed.
% 0.61/0.77 % (9387)------------------------------
% 0.61/0.77 % (9387)------------------------------
% 0.61/0.77 % (9385)------------------------------
% 0.61/0.77 % (9385)------------------------------
% 0.61/0.77 % (9383)Refutation not found, incomplete strategy% (9383)------------------------------
% 0.61/0.77 % (9383)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77 % (9383)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (9383)Memory used [KB]: 1107
% 0.61/0.77 % (9383)Time elapsed: 0.004 s
% 0.61/0.77 % (9383)Instructions burned: 5 (million)
% 0.61/0.77 % (9380)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9378"
% 0.61/0.77 % (9383)------------------------------
% 0.61/0.77 % (9383)------------------------------
% 0.61/0.77 % (9380)Refutation found. Thanks to Tanya!
% 0.61/0.77 % SZS status Theorem for Vampire---4
% 0.61/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.77 % (9380)------------------------------
% 0.61/0.77 % (9380)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77 % (9380)Termination reason: Refutation
% 0.61/0.77
% 0.61/0.77 % (9380)Memory used [KB]: 1144
% 0.61/0.77 % (9380)Time elapsed: 0.004 s
% 0.61/0.77 % (9380)Instructions burned: 10 (million)
% 0.61/0.77 % (9378)Success in time 0.401 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------