TSTP Solution File: SWV779_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV779_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 10:39:54 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 39
% Syntax : Number of formulae : 48 ( 7 unt; 37 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 7 ~; 3 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 5 ( 4 usr)
% Number of type conns : 39 ( 22 >; 17 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 28 ( 28 usr; 7 con; 0-5 aty)
% Number of variables : 37 ( 9 !; 0 ?; 37 :)
% ( 28 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
event: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
agent: $tType ).
tff(type_def_9,type,
msg: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( fun(X0,fun(X1,X2)) > fun(X1,fun(X0,X2)) ) ).
tff(func_def_2,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_3,type,
gets: ( agent * msg ) > event ).
tff(func_def_4,type,
initState: agent > fun(msg,bool) ).
tff(func_def_5,type,
knows: ( agent * list(event) ) > fun(msg,bool) ).
tff(func_def_6,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_7,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_8,type,
insert1:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_9,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_10,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_11,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_12,type,
rev:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_13,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
spy: agent ).
tff(func_def_15,type,
nS_Sha254967238shared: fun(list(event),bool) ).
tff(func_def_16,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_17,type,
insert:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > fun(X0,bool) ) ).
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,
fNot: fun(bool,bool) ).
tff(func_def_21,type,
fTrue: bool ).
tff(func_def_22,type,
fdisj: fun(bool,fun(bool,bool)) ).
tff(func_def_23,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_24,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_25,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(pred_def_1,type,
list_all:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_2,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
nS_Sha993195050haredp: list(event) > $o ).
tff(pred_def_4,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(f175,plain,
$false,
inference(trivial_inequality_removal,[],[f174]) ).
tff(f174,plain,
knows(spy,nil(event)) != knows(spy,nil(event)),
inference(backward_demodulation,[],[f143,f171]) ).
tff(f171,plain,
! [X0: $tType] : ( nil(X0) = rev(X0,nil(X0)) ),
inference(equality_resolution,[],[f158]) ).
tff(f158,plain,
! [X0: $tType,X1: list(X0)] :
( ( nil(X0) = rev(X0,X1) )
| ( nil(X0) != X1 ) ),
inference(cnf_transformation,[],[f141]) ).
tff(f141,plain,
! [X0: $tType,X1: list(X0)] :
( ( ( nil(X0) = rev(X0,X1) )
| ( nil(X0) != X1 ) )
& ( ( nil(X0) = X1 )
| ( nil(X0) != rev(X0,X1) ) ) ),
inference(nnf_transformation,[],[f127]) ).
tff(f127,plain,
! [X0: $tType,X1: list(X0)] :
( ( nil(X0) = rev(X0,X1) )
<=> ( nil(X0) = X1 ) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X2: $tType,X4: list(X2)] :
( ( nil(X2) = rev(X2,X4) )
<=> ( nil(X2) = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.xbejJdieuk/Vampire---4.8_32706',fact_2_rev__is__Nil__conv) ).
tff(f143,plain,
knows(spy,nil(event)) != knows(spy,rev(event,nil(event))),
inference(cnf_transformation,[],[f118]) ).
tff(f118,plain,
knows(spy,nil(event)) != knows(spy,rev(event,nil(event))),
inference(flattening,[],[f117]) ).
tff(f117,negated_conjecture,
( ~ knows(spy,nil(event)) = knows(spy,rev(event,nil(event))) ),
inference(negated_conjecture,[],[f116]) ).
tff(f116,conjecture,
knows(spy,nil(event)) = knows(spy,rev(event,nil(event))),
file('/export/starexec/sandbox/tmp/tmp.xbejJdieuk/Vampire---4.8_32706',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV779_5 : TPTP v8.1.2. Released v6.0.0.
% 0.12/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 21:08:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TF1_THM_EQU_NAR problem
% 0.14/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.xbejJdieuk/Vampire---4.8_32706
% 0.60/0.76 % (347)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.60/0.76 % (348)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.60/0.76 % (349)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.60/0.77 % (350)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.60/0.77 % (351)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.60/0.77 % (354)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.60/0.77 % (352)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.60/0.77 % (353)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.60/0.77 % (350)First to succeed.
% 0.60/0.77 % (353)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.77 % (350)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-346"
% 0.60/0.77 % (350)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for Vampire---4
% 0.60/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.77 % (350)------------------------------
% 0.60/0.77 % (350)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (350)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (350)Memory used [KB]: 1115
% 0.60/0.77 % (350)Time elapsed: 0.004 s
% 0.60/0.77 % (350)Instructions burned: 5 (million)
% 0.60/0.77 % (346)Success in time 0.398 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------