TSTP Solution File: CSR119_8 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : CSR119_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n013.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:46:02 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   39 (  13 unt;   4 typ;   0 def)
%            Number of atoms       :  231 (  31 equ)
%            Maximal formula atoms :    6 (   6 avg)
%            Number of connectives :   65 (  27   ~;  29   |;   7   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  160 ( 158 fml;   2 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   12 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   12 (   9   !;   3   ?;   6   :)

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

tff(func_def_7,type,
    bG0: $i > $o ).

tff(func_def_8,type,
    bG1: $o ).

tff(pred_def_1,type,
    holdsDuring_THFTYPE_IiooI: ( $i * $o ) > $o ).

tff(f74,plain,
    $false,
    inference(subsumption_resolution,[],[f72,f57]) ).

tff(f57,plain,
    holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false),
    inference(backward_demodulation,[],[f20,f54]) ).

tff(f54,plain,
    $false = bG1,
    inference(subsumption_resolution,[],[f48,f24]) ).

tff(f24,plain,
    ( holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)
    | ( $false = bG1 ) ),
    inference(superposition,[],[f20,f5]) ).

tff(f5,plain,
    ! [X0: $o] :
      ( ( $true = (X0) )
      | ( $false = (X0) ) ),
    introduced(fool_axiom,[]) ).

tff(f48,plain,
    ( ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)
    | ( $false = bG1 ) ),
    inference(superposition,[],[f19,f35]) ).

tff(f35,plain,
    ( ( $true = bG0(lMary_THFTYPE_i) )
    | ( $false = bG1 ) ),
    inference(resolution,[],[f17,f32]) ).

tff(f32,plain,
    ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
    | ( $false = bG1 ) ),
    inference(trivial_inequality_removal,[],[f31]) ).

tff(f31,plain,
    ( ( $true != $true )
    | likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
    | ( $false = bG1 ) ),
    inference(superposition,[],[f15,f5]) ).

tff(f15,plain,
    ( ( $true != bG1 )
    | likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ),
    inference(cnf_transformation,[],[f12]) ).

tff(f12,plain,
    ( ( ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
        & likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) )
      | ( $true != bG1 ) )
    & ( ( $true = bG1 )
      | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
      | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ) ),
    inference(flattening,[],[f11]) ).

tff(f11,plain,
    ( ( ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
        & likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) )
      | ( $true != bG1 ) )
    & ( ( $true = bG1 )
      | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
      | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ) ),
    inference(nnf_transformation,[],[f8]) ).

tff(f8,plain,
    ( ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
      & likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) )
  <=> ( $true = bG1 ) ),
    introduced(fool_formula_definition,[new_symbols(definition,[bG1])]) ).

tff(f17,plain,
    ! [X0: $i] :
      ( ~ likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i)
      | ( $true = bG0(X0) ) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f13,plain,
    ! [X0] :
      ( ( likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i)
        | ( $true != bG0(X0) ) )
      & ( ( $true = bG0(X0) )
        | ~ likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i) ) ),
    inference(nnf_transformation,[],[f6]) ).

tff(f6,plain,
    ! [X0] :
      ( likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i)
    <=> ( $true = bG0(X0) ) ),
    introduced(fool_formula_definition,[new_symbols(definition,[bG0])]) ).

tff(f19,plain,
    ! [X0: $i] : ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),bG0(X0)),
    inference(cnf_transformation,[],[f10]) ).

tff(f10,plain,
    ! [X0] : ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),bG0(X0)),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,plain,
    ~ ? [X0] : holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),bG0(X0)),
    inference(fool_elimination,[],[f3,f6]) ).

tff(f3,negated_conjecture,
    ~ ? [X0] : holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i)),
    inference(negated_conjecture,[],[f2]) ).

tff(f2,conjecture,
    ? [X0] : holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

tff(f20,plain,
    holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),bG1),
    inference(cnf_transformation,[],[f9]) ).

tff(f9,plain,
    holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),bG1),
    inference(fool_elimination,[],[f1,f8]) ).

tff(f1,axiom,
    holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),
      ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
      & likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) )),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).

tff(f72,plain,
    ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false),
    inference(superposition,[],[f19,f69]) ).

tff(f69,plain,
    $false = bG0(lMary_THFTYPE_i),
    inference(subsumption_resolution,[],[f67,f57]) ).

tff(f67,plain,
    ( ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)
    | ( $false = bG0(lMary_THFTYPE_i) ) ),
    inference(superposition,[],[f19,f64]) ).

tff(f64,plain,
    ( ( $false = bG0(lSue_THFTYPE_i) )
    | ( $false = bG0(lMary_THFTYPE_i) ) ),
    inference(resolution,[],[f63,f39]) ).

tff(f39,plain,
    ! [X0: $i] :
      ( likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i)
      | ( $false = bG0(X0) ) ),
    inference(trivial_inequality_removal,[],[f38]) ).

tff(f38,plain,
    ! [X0: $i] :
      ( ( $true != $true )
      | likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i)
      | ( $false = bG0(X0) ) ),
    inference(superposition,[],[f18,f5]) ).

tff(f18,plain,
    ! [X0: $i] :
      ( ( $true != bG0(X0) )
      | likes_THFTYPE_IiioI(X0,lBill_THFTYPE_i) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f63,plain,
    ( ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
    | ( $false = bG0(lSue_THFTYPE_i) ) ),
    inference(resolution,[],[f62,f39]) ).

tff(f62,plain,
    ( ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
    | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ),
    inference(trivial_inequality_removal,[],[f61]) ).

tff(f61,plain,
    ( ( $true = $false )
    | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
    | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ),
    inference(forward_demodulation,[],[f14,f54]) ).

tff(f14,plain,
    ( ( $true = bG1 )
    | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
    | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ),
    inference(cnf_transformation,[],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : CSR119_8 : TPTP v8.2.0. Released v8.0.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n013.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   : Sun May 19 02:32:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (6236)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (6237)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.37  % (6241)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.37  % (6240)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.13/0.37  % (6238)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37  % (6242)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.37  Detected minimum model sizes of [1,1]
% 0.13/0.37  Detected maximum model sizes of [max,2]
% 0.13/0.37  Detected minimum model sizes of [1,1,1,1,1]
% 0.13/0.37  Detected minimum model sizes of [1,1,1,1,1]
% 0.13/0.37  Detected maximum model sizes of [1,2,max,1,2]
% 0.13/0.37  Detected maximum model sizes of [1,2,max,1,2]
% 0.13/0.37  TRYING [1,1]
% 0.13/0.37  TRYING [1,1,1,1,1]
% 0.13/0.37  TRYING [1,1,1,1,1]
% 0.13/0.37  TRYING [1,2]
% 0.13/0.37  TRYING [1,1,1,1,2]
% 0.13/0.37  TRYING [1,1,1,1,2]
% 0.13/0.37  TRYING [2,2]
% 0.13/0.37  TRYING [1,2,2,1,2]
% 0.13/0.37  TRYING [1,2,2,1,2]
% 0.13/0.37  Cannot enumerate next child to try in an incomplete setup
% 0.13/0.37  % (6241)First to succeed.
% 0.13/0.37  % (6237)Refutation not found, incomplete strategy% (6237)------------------------------
% 0.13/0.37  % (6237)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (6237)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37  
% 0.13/0.37  % (6237)Memory used [KB]: 728
% 0.13/0.37  % (6237)Time elapsed: 0.004 s
% 0.13/0.37  % (6237)Instructions burned: 4 (million)
% 0.13/0.37  Cannot enumerate next child to try in an incomplete setup
% 0.13/0.37  Cannot enumerate next child to try in an incomplete setup
% 0.13/0.37  % (6240)Refutation not found, incomplete strategy% (6240)------------------------------
% 0.13/0.37  % (6240)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (6240)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37  
% 0.13/0.37  % (6240)Memory used [KB]: 731
% 0.13/0.37  % (6240)Time elapsed: 0.004 s
% 0.13/0.37  % (6240)Instructions burned: 4 (million)
% 0.13/0.37  % (6238)Refutation not found, incomplete strategy% (6238)------------------------------
% 0.13/0.37  % (6238)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (6238)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37  
% 0.13/0.37  % (6238)Memory used [KB]: 731
% 0.13/0.37  % (6238)Time elapsed: 0.005 s
% 0.13/0.37  % (6237)------------------------------
% 0.13/0.37  % (6237)------------------------------
% 0.13/0.37  % (6238)Instructions burned: 4 (million)
% 0.13/0.37  % (6240)------------------------------
% 0.13/0.37  % (6240)------------------------------
% 0.13/0.37  % (6241)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6236"
% 0.13/0.37  % (6238)------------------------------
% 0.13/0.37  % (6238)------------------------------
% 0.13/0.37  % (6241)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  % (6241)------------------------------
% 0.13/0.37  % (6241)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (6241)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (6241)Memory used [KB]: 760
% 0.13/0.37  % (6241)Time elapsed: 0.005 s
% 0.13/0.37  % (6241)Instructions burned: 5 (million)
% 0.13/0.37  % (6236)Success in time 0.009 s
%------------------------------------------------------------------------------