TSTP Solution File: DAT084_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT084_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 : 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:49:35 EDT 2024

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

% 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(func_def_11,type,
    sK0: list ).

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

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

tff(f66,plain,
    $false,
    inference(subsumption_resolution,[],[f65,f24]) ).

tff(f24,plain,
    ! [X0: $int] : ~ $less(X0,X0),
    introduced(theory_axiom_142,[]) ).

tff(f65,plain,
    $less(length(sK0),length(sK0)),
    inference(evaluation,[],[f64]) ).

tff(f64,plain,
    ( $less(length(sK0),length(sK0))
    | ~ $less(0,1) ),
    inference(superposition,[],[f52,f21]) ).

tff(f21,plain,
    ! [X0: $int] : ( $sum(X0,0) = X0 ),
    introduced(theory_axiom_137,[]) ).

tff(f52,plain,
    ! [X0: $int] :
      ( $less($sum(length(sK0),X0),length(sK0))
      | ~ $less(X0,1) ),
    inference(superposition,[],[f48,f19]) ).

tff(f19,plain,
    ! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
    introduced(theory_axiom_135,[]) ).

tff(f48,plain,
    ! [X0: $int] :
      ( $less($sum(X0,length(sK0)),length(sK0))
      | ~ $less(X0,1) ),
    inference(superposition,[],[f27,f46]) ).

tff(f46,plain,
    length(sK0) = $sum(1,length(sK0)),
    inference(superposition,[],[f38,f39]) ).

tff(f39,plain,
    ! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
    inference(cnf_transformation,[],[f33]) ).

tff(f33,plain,
    ! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
    inference(rectify,[],[f8]) ).

tff(f8,axiom,
    ! [X3: $int,X4: list] : ( length(cons(X3,X4)) = $sum(1,length(X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_1) ).

tff(f38,plain,
    length(sK0) = length(cons(1,sK0)),
    inference(cnf_transformation,[],[f32]) ).

tff(f32,plain,
    ? [X0: list] : ( length(X0) = length(cons(1,X0)) ),
    inference(flattening,[],[f31]) ).

tff(f31,plain,
    ~ ~ ? [X0: list] : ( length(X0) = length(cons(1,X0)) ),
    inference(rectify,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ~ ? [X1: list] : ( length(X1) = length(cons(1,X1)) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ~ ? [X1: list] : ( length(X1) = length(cons(1,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).

tff(f27,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( $less($sum(X0,X2),$sum(X1,X2))
      | ~ $less(X0,X1) ),
    introduced(theory_axiom_145,[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : DAT084_1 : TPTP v8.2.0. Released v6.1.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.16/0.37  % Computer : n007.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Sun May 19 23:08:38 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.16/0.37  This is a TF0_THM_EQU_ARI problem
% 0.16/0.38  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.60/0.79  % (4873)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.60/0.79  % (4876)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.60/0.79  % (4875)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.60/0.79  % (4872)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.60/0.79  % (4869)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.60/0.79  % (4871)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.79  % (4874)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.60/0.79  % (4876)Refutation not found, incomplete strategy% (4876)------------------------------
% 0.60/0.79  % (4876)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (4876)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79  
% 0.60/0.79  % (4876)Memory used [KB]: 957
% 0.60/0.79  % (4876)Time elapsed: 0.003 s
% 0.60/0.79  % (4876)Instructions burned: 3 (million)
% 0.60/0.79  % (4872)Refutation not found, incomplete strategy% (4872)------------------------------
% 0.60/0.79  % (4872)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (4872)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79  
% 0.60/0.79  % (4876)------------------------------
% 0.60/0.79  % (4876)------------------------------
% 0.60/0.79  % (4872)Memory used [KB]: 974
% 0.60/0.79  % (4872)Time elapsed: 0.003 s
% 0.60/0.79  % (4872)Instructions burned: 3 (million)
% 0.60/0.79  % (4872)------------------------------
% 0.60/0.79  % (4872)------------------------------
% 0.60/0.79  % (4873)Refutation not found, incomplete strategy% (4873)------------------------------
% 0.60/0.79  % (4873)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (4873)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.80  
% 0.60/0.80  % (4873)Memory used [KB]: 1049
% 0.60/0.80  % (4873)Time elapsed: 0.004 s
% 0.60/0.80  % (4873)Instructions burned: 4 (million)
% 0.60/0.80  % (4873)------------------------------
% 0.60/0.80  % (4873)------------------------------
% 0.60/0.80  % (4869)Refutation not found, incomplete strategy% (4869)------------------------------
% 0.60/0.80  % (4869)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80  % (4869)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.80  
% 0.60/0.80  % (4869)Memory used [KB]: 1054
% 0.60/0.80  % (4869)Time elapsed: 0.003 s
% 0.60/0.80  % (4869)Instructions burned: 3 (million)
% 0.60/0.80  % (4875)First to succeed.
% 0.60/0.80  % (4874)Also succeeded, but the first one will report.
% 0.60/0.80  % (4869)------------------------------
% 0.60/0.80  % (4869)------------------------------
% 0.60/0.80  % (4875)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4868"
% 0.60/0.80  % (4875)Refutation found. Thanks to Tanya!
% 0.60/0.80  % SZS status Theorem for theBenchmark
% 0.60/0.80  % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.80  % (4875)------------------------------
% 0.60/0.80  % (4875)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80  % (4875)Termination reason: Refutation
% 0.60/0.80  
% 0.60/0.80  % (4875)Memory used [KB]: 1048
% 0.60/0.80  % (4875)Time elapsed: 0.005 s
% 0.60/0.80  % (4875)Instructions burned: 5 (million)
% 0.60/0.80  % (4868)Success in time 0.414 s
% 0.60/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------