TSTP Solution File: ITP209^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ITP209^1 : TPTP v8.2.0. Released v8.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 : n003.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 22:34:50 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   26 (  13 unt;  13 typ;   0 def)
%            Number of atoms       :   13 (  12 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   89 (   5   ~;   0   |;   0   &;  84   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   20 (  20   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   16 (   0   ^  15   !;   0   ?;  16   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(func_def_0,type,
    a: $tType ).

thf(func_def_1,type,
    syntax_ac_operator_a: ( a > a > a ) > $o ).

thf(func_def_2,type,
    a2: a ).

thf(func_def_3,type,
    b: a ).

thf(func_def_4,type,
    c: a ).

thf(func_def_5,type,
    f: a > a > a ).

thf(func_def_17,type,
    sK0: ( a > a > a ) > a ).

thf(func_def_18,type,
    sK1: ( a > a > a ) > a ).

thf(func_def_19,type,
    sK2: ( a > a > a ) > a ).

thf(func_def_20,type,
    sK3: ( a > a > a ) > a ).

thf(func_def_21,type,
    sK4: ( a > a > a ) > a ).

thf(func_def_23,type,
    ph6: 
      !>[X0: $tType] : X0 ).

thf(f54,plain,
    $false,
    inference(subsumption_resolution,[],[f53,f47]) ).

thf(f47,plain,
    ! [X2: a,X0: a,X1: a] :
      ( ( f @ X2 @ ( f @ X0 @ X1 ) )
      = ( f @ ( f @ X2 @ X0 ) @ X1 ) ),
    inference(cnf_transformation,[],[f30]) ).

thf(f30,plain,
    ! [X0: a,X1: a,X2: a] :
      ( ( f @ X2 @ ( f @ X0 @ X1 ) )
      = ( f @ ( f @ X2 @ X0 ) @ X1 ) ),
    inference(rectify,[],[f4]) ).

thf(f4,axiom,
    ! [X1: a,X2: a,X0: a] :
      ( ( f @ X0 @ ( f @ X1 @ X2 ) )
      = ( f @ ( f @ X0 @ X1 ) @ X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_right__assoc) ).

thf(f53,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ a2 @ ( f @ b @ c ) ) ),
    inference(forward_demodulation,[],[f52,f50]) ).

thf(f50,plain,
    ! [X0: a,X1: a] :
      ( ( f @ X0 @ X1 )
      = ( f @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f31]) ).

thf(f31,plain,
    ! [X0: a,X1: a] :
      ( ( f @ X0 @ X1 )
      = ( f @ X1 @ X0 ) ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ! [X1: a,X0: a] :
      ( ( f @ X0 @ X1 )
      = ( f @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_commute) ).

thf(f52,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ a2 @ ( f @ c @ b ) ) ),
    inference(forward_demodulation,[],[f49,f47]) ).

thf(f49,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(cnf_transformation,[],[f28]) ).

thf(f28,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(flattening,[],[f12]) ).

thf(f12,negated_conjecture,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(negated_conjecture,[],[f11]) ).

thf(f11,conjecture,
    ( ( f @ ( f @ a2 @ b ) @ c )
    = ( f @ ( f @ a2 @ c ) @ b ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : ITP209^1 : TPTP v8.2.0. Released v8.1.0.
% 0.12/0.14  % 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.13/0.35  % Computer : n003.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat May 18 16:10:22 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a TH0_THM_EQU_NAR problem
% 0.13/0.35  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37  % (10073)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37  % (10068)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.13/0.37  % (10069)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.13/0.37  % (10070)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37  % (10071)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37  % (10067)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.13/0.37  % (10072)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.13/0.37  % (10074)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.13/0.37  % (10070)Instruction limit reached!
% 0.13/0.37  % (10070)------------------------------
% 0.13/0.37  % (10070)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (10070)Termination reason: Unknown
% 0.13/0.37  % (10070)Termination phase: Property scanning
% 0.13/0.37  % (10071)Instruction limit reached!
% 0.13/0.37  % (10071)------------------------------
% 0.13/0.37  % (10071)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  
% 0.13/0.37  % (10070)Memory used [KB]: 895
% 0.13/0.37  % (10070)Time elapsed: 0.003 s
% 0.13/0.37  % (10070)Instructions burned: 2 (million)
% 0.13/0.37  % (10070)------------------------------
% 0.13/0.37  % (10070)------------------------------
% 0.13/0.37  % (10071)Termination reason: Unknown
% 0.13/0.37  % (10071)Termination phase: shuffling
% 0.13/0.37  
% 0.13/0.37  % (10071)Memory used [KB]: 1023
% 0.13/0.37  % (10071)Time elapsed: 0.003 s
% 0.13/0.37  % (10071)Instructions burned: 2 (million)
% 0.13/0.37  % (10071)------------------------------
% 0.13/0.37  % (10071)------------------------------
% 0.13/0.37  % (10068)Instruction limit reached!
% 0.13/0.37  % (10068)------------------------------
% 0.13/0.37  % (10068)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (10068)Termination reason: Unknown
% 0.13/0.37  % (10068)Termination phase: Property scanning
% 0.13/0.37  
% 0.13/0.37  % (10068)Memory used [KB]: 1023
% 0.13/0.37  % (10068)Time elapsed: 0.004 s
% 0.13/0.37  % (10068)Instructions burned: 4 (million)
% 0.13/0.37  % (10068)------------------------------
% 0.13/0.37  % (10068)------------------------------
% 0.13/0.37  % (10074)Instruction limit reached!
% 0.13/0.37  % (10074)------------------------------
% 0.13/0.37  % (10074)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (10074)Termination reason: Unknown
% 0.13/0.37  % (10074)Termination phase: Property scanning
% 0.13/0.37  
% 0.13/0.37  % (10074)Memory used [KB]: 1023
% 0.13/0.37  % (10074)Time elapsed: 0.004 s
% 0.13/0.37  % (10074)Instructions burned: 3 (million)
% 0.13/0.37  % (10074)------------------------------
% 0.13/0.37  % (10074)------------------------------
% 0.13/0.37  % (10072)First to succeed.
% 0.13/0.37  % (10073)Also succeeded, but the first one will report.
% 0.13/0.37  % (10072)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37  % (10072)------------------------------
% 0.13/0.37  % (10072)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (10072)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (10072)Memory used [KB]: 5500
% 0.13/0.37  % (10072)Time elapsed: 0.005 s
% 0.13/0.37  % (10072)Instructions burned: 4 (million)
% 0.13/0.37  % (10072)------------------------------
% 0.13/0.37  % (10072)------------------------------
% 0.13/0.37  % (10066)Success in time 0.018 s
% 0.13/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------