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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM748^1 : TPTP v8.2.0. Released v3.7.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 : n020.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 : Tue May 21 01:45:28 EDT 2024

% Result   : Theorem 0.15s 0.38s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   31 (  19 unt;  12 typ;   0 def)
%            Number of atoms       :   33 (  13 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :  311 (   7   ~;   0   |;   0   &; 304   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   16 (   0   ^  16   !;   0   ?;  16   :)

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

thf(type_def_7,type,
    nat: $tType ).

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

thf(func_def_1,type,
    x: frac ).

thf(func_def_2,type,
    y: frac ).

thf(func_def_3,type,
    eq: frac > frac > $o ).

thf(func_def_4,type,
    nat: $tType ).

thf(func_def_5,type,
    fr: nat > nat > frac ).

thf(func_def_6,type,
    pl: nat > nat > nat ).

thf(func_def_7,type,
    ts: nat > nat > nat ).

thf(func_def_8,type,
    num: frac > nat ).

thf(func_def_9,type,
    den: frac > nat ).

thf(f20,plain,
    $false,
    inference(subsumption_resolution,[],[f19,f15]) ).

thf(f15,plain,
    ! [X0: frac] :
      ( ( eq @ X0 @ X0 )
      = $true ),
    inference(cnf_transformation,[],[f10]) ).

thf(f10,plain,
    ! [X0: frac] :
      ( ( eq @ X0 @ X0 )
      = $true ),
    inference(fool_elimination,[],[f9]) ).

thf(f9,plain,
    ! [X0: frac] : ( eq @ X0 @ X0 ),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    ! [X0: frac] : ( eq @ X0 @ X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).

thf(f19,plain,
    ( $true
   != ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) ) ),
    inference(forward_demodulation,[],[f18,f17]) ).

thf(f17,plain,
    ! [X0: nat,X1: nat] :
      ( ( ts @ X0 @ X1 )
      = ( ts @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    ! [X0: nat,X1: nat] :
      ( ( ts @ X0 @ X1 )
      = ( ts @ X1 @ X0 ) ),
    inference(rectify,[],[f2]) ).

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

thf(f18,plain,
    ( $true
   != ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ) ),
    inference(forward_demodulation,[],[f16,f14]) ).

thf(f14,plain,
    ! [X0: nat,X1: nat] :
      ( ( pl @ X0 @ X1 )
      = ( pl @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f12]) ).

thf(f12,plain,
    ! [X0: nat,X1: nat] :
      ( ( pl @ X0 @ X1 )
      = ( pl @ X1 @ X0 ) ),
    inference(rectify,[],[f3]) ).

thf(f3,axiom,
    ! [X1: nat,X0: nat] :
      ( ( pl @ X0 @ X1 )
      = ( pl @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz6) ).

thf(f16,plain,
    ( ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
   != $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f11,plain,
    ( ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
   != $true ),
    inference(flattening,[],[f8]) ).

thf(f8,plain,
    ( ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
   != $true ),
    inference(fool_elimination,[],[f7]) ).

thf(f7,plain,
    ~ ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ),
    inference(rectify,[],[f5]) ).

thf(f5,negated_conjecture,
    ~ ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ),
    inference(negated_conjecture,[],[f4]) ).

thf(f4,conjecture,
    eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz58) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUM748^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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.15/0.35  % Computer : n020.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon May 20 07:28:08 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a TH0_THM_EQU_NAR problem
% 0.15/0.36  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.15/0.37  % (891)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.37  % (891)Instruction limit reached!
% 0.15/0.37  % (891)------------------------------
% 0.15/0.37  % (891)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (891)Termination reason: Unknown
% 0.15/0.37  % (891)Termination phase: Saturation
% 0.15/0.37  
% 0.15/0.37  % (891)Memory used [KB]: 5500
% 0.15/0.37  % (891)Time elapsed: 0.002 s
% 0.15/0.37  % (891)Instructions burned: 2 (million)
% 0.15/0.37  % (891)------------------------------
% 0.15/0.37  % (891)------------------------------
% 0.15/0.38  % (886)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.15/0.38  % (890)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.15/0.38  % (888)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.15/0.38  % (892)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.15/0.38  % (893)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.15/0.38  % (894)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38  % (895)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.15/0.38  % (892)Instruction limit reached!
% 0.15/0.38  % (892)------------------------------
% 0.15/0.38  % (892)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (892)Termination reason: Unknown
% 0.15/0.38  % (892)Termination phase: Clausification
% 0.15/0.38  
% 0.15/0.38  % (892)Memory used [KB]: 895
% 0.15/0.38  % (892)Time elapsed: 0.003 s
% 0.15/0.38  % (892)Instructions burned: 2 (million)
% 0.15/0.38  % (892)------------------------------
% 0.15/0.38  % (892)------------------------------
% 0.15/0.38  % (893)First to succeed.
% 0.15/0.38  % (888)Instruction limit reached!
% 0.15/0.38  % (888)------------------------------
% 0.15/0.38  % (888)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (888)Termination reason: Unknown
% 0.15/0.38  % (888)Termination phase: Saturation
% 0.15/0.38  
% 0.15/0.38  % (888)Memory used [KB]: 5500
% 0.15/0.38  % (888)Time elapsed: 0.005 s
% 0.15/0.38  % (888)Instructions burned: 4 (million)
% 0.15/0.38  % (888)------------------------------
% 0.15/0.38  % (888)------------------------------
% 0.15/0.38  % (894)Also succeeded, but the first one will report.
% 0.15/0.38  % (896)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.15/0.38  % (890)Also succeeded, but the first one will report.
% 0.15/0.38  % (893)Refutation found. Thanks to Tanya!
% 0.15/0.38  % SZS status Theorem for theBenchmark
% 0.15/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38  % (893)------------------------------
% 0.15/0.38  % (893)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (893)Termination reason: Refutation
% 0.15/0.38  
% 0.15/0.38  % (893)Memory used [KB]: 5500
% 0.15/0.38  % (893)Time elapsed: 0.005 s
% 0.15/0.38  % (893)Instructions burned: 2 (million)
% 0.15/0.38  % (893)------------------------------
% 0.15/0.38  % (893)------------------------------
% 0.15/0.38  % (885)Success in time 0.01 s
% 0.15/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------