TSTP Solution File: COM095_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM095_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 : n027.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:32 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 64
% Syntax : Number of formulae : 73 ( 8 unt; 61 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 : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 65 ( 37 >; 28 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 46 ( 46 usr; 10 con; 0-6 aty)
% Number of variables : 58 ( 4 !; 0 ?; 58 :)
% ( 54 !>; 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,
nat: $tType ).
tff(type_def_9,type,
atom: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_11,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
n_lists:
!>[X0: $tType] : ( ( nat * list(X0) ) > list(list(X0)) ) ).
tff(func_def_1,type,
product:
!>[X0: $tType,X1: $tType] : ( ( list(X0) * list(X1) ) > list(product_prod(X0,X1)) ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
equal_equal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
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)) * list(X0) * list(X1) ) > list(X2) ) ).
tff(func_def_6,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_7,type,
lexord:
!>[X0: $tType] : ( fun(product_prod(X0,X0),bool) > fun(product_prod(list(X0),list(X0)),bool) ) ).
tff(func_def_8,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_9,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_10,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_11,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_12,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_13,type,
member1:
!>[X0: $tType] : fun(list(X0),fun(X0,bool)) ).
tff(func_def_14,type,
remdups:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_15,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_16,type,
set:
!>[X0: $tType] : fun(list(X0),fun(X0,bool)) ).
tff(func_def_17,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_18,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_19,type,
transpose:
!>[X0: $tType] : ( list(list(X0)) > list(list(X0)) ) ).
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,
product_Pair:
!>[X0: $tType,X1: $tType] : ( ( X0 * X1 ) > product_prod(X0,X1) ) ).
tff(func_def_23,type,
product_curry:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(product_prod(X0,X1),X2) * X0 * X1 ) > X2 ) ).
tff(func_def_24,type,
produc1605651328_split:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * product_prod(X0,X1) ) > X2 ) ).
tff(func_def_25,type,
product_prod_rec:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * product_prod(X0,X1) ) > X2 ) ).
tff(func_def_26,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_27,type,
fFalse: bool ).
tff(func_def_28,type,
fTrue: bool ).
tff(func_def_29,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_30,type,
a: atom ).
tff(func_def_31,type,
as: list(atom) ).
tff(func_def_32,type,
li: int ).
tff(func_def_33,type,
lks: list(int) ).
tff(func_def_34,type,
x: int ).
tff(func_def_35,type,
xs: list(int) ).
tff(func_def_36,type,
sK0: int ).
tff(func_def_37,type,
sK1: int ).
tff(func_def_38,type,
sK2:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_39,type,
sK3:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_40,type,
sK4:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_41,type,
sK5:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_42,type,
sK6:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
enum:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
cl_HOL_Oequal:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
listMem:
!>[X0: $tType] : ( ( X0 * list(X0) ) > $o ) ).
tff(pred_def_6,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_7,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_8,type,
i_Z: ( atom * list(int) ) > $o ).
tff(pred_def_9,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_10,type,
pp: bool > $o ).
tff(pred_def_11,type,
sQ7_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f199,plain,
$false,
inference(subsumption_resolution,[],[f198,f175]) ).
tff(f175,plain,
member(atom,a,aa(list(atom),fun(atom,bool),set(atom),as)),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
member(atom,a,aa(list(atom),fun(atom,bool),set(atom),as)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__096a_A_058_Aset_Aas_096) ).
tff(f198,plain,
~ member(atom,a,aa(list(atom),fun(atom,bool),set(atom),as)),
inference(resolution,[],[f162,f176]) ).
tff(f176,plain,
! [X0: atom] :
( i_Z(X0,cons(int,x,xs))
| ~ member(atom,X0,aa(list(atom),fun(atom,bool),set(atom),as)) ),
inference(cnf_transformation,[],[f143]) ).
tff(f143,plain,
! [X0: atom] :
( i_Z(X0,cons(int,x,xs))
| ~ member(atom,X0,aa(list(atom),fun(atom,bool),set(atom),as)) ),
inference(ennf_transformation,[],[f129]) ).
tff(f129,plain,
! [X0: atom] :
( member(atom,X0,aa(list(atom),fun(atom,bool),set(atom),as))
=> i_Z(X0,cons(int,x,xs)) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X4: atom] :
( member(atom,X4,aa(list(atom),fun(atom,bool),set(atom),as))
=> i_Z(X4,cons(int,x,xs)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_x) ).
tff(f162,plain,
~ i_Z(a,cons(int,x,xs)),
inference(cnf_transformation,[],[f119]) ).
tff(f119,plain,
~ i_Z(a,cons(int,x,xs)),
inference(flattening,[],[f118]) ).
tff(f118,negated_conjecture,
~ i_Z(a,cons(int,x,xs)),
inference(negated_conjecture,[],[f117]) ).
tff(f117,conjecture,
i_Z(a,cons(int,x,xs)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COM095_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n027.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 10:19:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF1_THM_EQU_NAR problem
% 0.15/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/benchmark/theBenchmark.p
% 0.55/0.76 % (32313)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.76 % (32306)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.76 % (32313)First to succeed.
% 0.55/0.76 % (32312)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.76 % (32306)Also succeeded, but the first one will report.
% 0.55/0.76 % (32313)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32305"
% 0.55/0.76 % (32308)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.76 % (32313)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for theBenchmark
% 0.55/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.76 % (32313)------------------------------
% 0.55/0.76 % (32313)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (32313)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (32313)Memory used [KB]: 1098
% 0.55/0.76 % (32313)Time elapsed: 0.005 s
% 0.55/0.76 % (32313)Instructions burned: 4 (million)
% 0.55/0.76 % (32305)Success in time 0.384 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------