TSTP Solution File: DAT087_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT087_1 : TPTP v8.2.0. Released v6.1.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 : 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:49:36 EDT 2024

% Result   : Theorem 0.73s 0.90s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   25 (  11 unt;  10 typ;   0 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   7   ~;   2   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   42 (   0 atm;   7 fun;  18 num;  17 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :   13 (   8   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (  28   !;   0   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    list: $tType ).

tff(func_def_0,type,
    nil: list ).

tff(func_def_1,type,
    cons: ( $int * list ) > list ).

tff(func_def_2,type,
    head: list > $int ).

tff(func_def_3,type,
    tail: list > list ).

tff(func_def_5,type,
    length: list > $int ).

tff(func_def_8,type,
    count: ( $int * list ) > $int ).

tff(func_def_9,type,
    append: ( list * list ) > list ).

tff(pred_def_1,type,
    in: ( $int * list ) > $o ).

tff(pred_def_2,type,
    inRange: ( $int * list ) > $o ).

tff(f58,plain,
    $false,
    inference(evaluation,[],[f48]) ).

tff(f48,plain,
    0 = $sum(0,1),
    inference(superposition,[],[f43,f40]) ).

tff(f40,plain,
    ! [X0: $int] : ( 0 = count(X0,nil) ),
    inference(cnf_transformation,[],[f9]) ).

tff(f9,axiom,
    ! [X0: $int] : ( 0 = count(X0,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a) ).

tff(f43,plain,
    ! [X0: list] : ( count(1,X0) = $sum(count(1,X0),1) ),
    inference(superposition,[],[f37,f42]) ).

tff(f42,plain,
    ! [X2: list,X1: $int] : ( count(X1,cons(X1,X2)) = $sum(count(X1,X2),1) ),
    inference(equality_resolution,[],[f38]) ).

tff(f38,plain,
    ! [X2: list,X0: $int,X1: $int] :
      ( ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) )
      | ( X0 != X1 ) ),
    inference(cnf_transformation,[],[f35]) ).

tff(f35,plain,
    ! [X0: $int,X1: $int,X2: list] :
      ( ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) )
      | ( X0 != X1 ) ),
    inference(ennf_transformation,[],[f33]) ).

tff(f33,plain,
    ! [X0: $int,X1: $int,X2: list] :
      ( ( X0 = X1 )
     => ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) ) ),
    inference(rectify,[],[f11]) ).

tff(f11,axiom,
    ! [X0: $int,X3: $int,X4: list,X5: $int] :
      ( ( X0 = X3 )
     => ( count(X0,cons(X3,X4)) = $sum(count(X0,X4),1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_4) ).

tff(f37,plain,
    ! [X0: $int,X1: list] : ( count(X0,X1) = count(X0,cons(1,X1)) ),
    inference(cnf_transformation,[],[f32]) ).

tff(f32,plain,
    ! [X0: $int,X1: list] : ( count(X0,X1) = count(X0,cons(1,X1)) ),
    inference(flattening,[],[f31]) ).

tff(f31,plain,
    ~ ~ ! [X0: $int,X1: list] : ( count(X0,X1) = count(X0,cons(1,X1)) ),
    inference(rectify,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ~ ! [X5: $int,X1: list] : ( count(X5,X1) = count(X5,cons(1,X1)) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ~ ! [X5: $int,X1: list] : ( count(X5,X1) = count(X5,cons(1,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : DAT087_1 : TPTP v8.2.0. Released v6.1.0.
% 0.08/0.16  % 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.17/0.39  % Computer : n027.cluster.edu
% 0.17/0.39  % Model    : x86_64 x86_64
% 0.17/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39  % Memory   : 8042.1875MB
% 0.17/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39  % CPULimit   : 300
% 0.17/0.39  % WCLimit    : 300
% 0.17/0.39  % DateTime   : Sun May 19 23:05:38 EDT 2024
% 0.17/0.39  % CPUTime    : 
% 0.17/0.39  This is a TF0_THM_EQU_ARI problem
% 0.17/0.39  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/benchmark/theBenchmark.p
% 0.70/0.89  % (15121)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 (2995ds/34Mi)
% 0.70/0.89  % (15120)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.70/0.89  % (15124)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 (2995ds/56Mi)
% 0.73/0.89  % (15117)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 (2995ds/34Mi)
% 0.73/0.89  % (15119)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.73/0.89  % (15122)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.73/0.89  % (15124)Refutation not found, incomplete strategy% (15124)------------------------------
% 0.73/0.89  % (15124)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89  % (15124)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.89  
% 0.73/0.89  % (15124)Memory used [KB]: 957
% 0.73/0.89  % (15124)Time elapsed: 0.003 s
% 0.73/0.89  % (15124)Instructions burned: 3 (million)
% 0.73/0.89  % (15120)Refutation not found, incomplete strategy% (15120)------------------------------
% 0.73/0.89  % (15120)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89  % (15118)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 (2995ds/51Mi)
% 0.73/0.89  % (15120)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.89  
% 0.73/0.89  % (15120)Memory used [KB]: 973
% 0.73/0.89  % (15120)Time elapsed: 0.004 s
% 0.73/0.89  % (15120)Instructions burned: 3 (million)
% 0.73/0.89  % (15124)------------------------------
% 0.73/0.89  % (15124)------------------------------
% 0.73/0.89  % (15120)------------------------------
% 0.73/0.89  % (15120)------------------------------
% 0.73/0.89  % (15121)Refutation not found, incomplete strategy% (15121)------------------------------
% 0.73/0.89  % (15121)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89  % (15121)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.89  
% 0.73/0.89  % (15121)Memory used [KB]: 1049
% 0.73/0.89  % (15121)Time elapsed: 0.004 s
% 0.73/0.89  % (15121)Instructions burned: 4 (million)
% 0.73/0.89  % (15121)------------------------------
% 0.73/0.89  % (15121)------------------------------
% 0.73/0.89  % (15117)Refutation not found, incomplete strategy% (15117)------------------------------
% 0.73/0.89  % (15117)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89  % (15117)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.89  
% 0.73/0.89  % (15117)Memory used [KB]: 1053
% 0.73/0.89  % (15117)Time elapsed: 0.004 s
% 0.73/0.89  % (15117)Instructions burned: 3 (million)
% 0.73/0.89  % (15123)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 (2995ds/83Mi)
% 0.73/0.89  % (15122)First to succeed.
% 0.73/0.90  % (15117)------------------------------
% 0.73/0.90  % (15117)------------------------------
% 0.73/0.90  % (15122)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15116"
% 0.73/0.90  % (15122)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  % (15122)------------------------------
% 0.73/0.90  % (15122)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90  % (15122)Termination reason: Refutation
% 0.73/0.90  
% 0.73/0.90  % (15122)Memory used [KB]: 1046
% 0.73/0.90  % (15122)Time elapsed: 0.003 s
% 0.73/0.90  % (15122)Instructions burned: 4 (million)
% 0.73/0.90  % (15116)Success in time 0.492 s
% 0.73/0.90  % Vampire---4.8 exiting
%------------------------------------------------------------------------------