TSTP Solution File: LCL082-1 by Vampire-SAT---4.8

View Problem - Process Solution

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

% Computer : n018.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 Apr 30 13:40:25 EDT 2024

% Result   : Unsatisfiable 0.15s 0.39s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   25 (   8 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  20   ~;  17   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   58 (  58   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f108,plain,
    $false,
    inference(avatar_sat_refutation,[],[f47,f83,f101,f107]) ).

fof(f107,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[],[f106]) ).

fof(f106,plain,
    ( $false
    | ~ spl0_6 ),
    inference(resolution,[],[f100,f3]) ).

fof(f3,axiom,
    ~ is_a_theorem(implies(a,implies(b,a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_2) ).

fof(f100,plain,
    ( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f99]) ).

fof(f99,plain,
    ( spl0_6
  <=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).

fof(f101,plain,
    ( spl0_1
    | spl0_6
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f95,f81,f99,f13]) ).

fof(f13,plain,
    ( spl0_1
  <=> ! [X2] : ~ is_a_theorem(X2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f81,plain,
    ( spl0_5
  <=> ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).

fof(f95,plain,
    ( ! [X2,X0,X1] :
        ( is_a_theorem(implies(X0,implies(X1,X0)))
        | ~ is_a_theorem(X2) )
    | ~ spl0_5 ),
    inference(resolution,[],[f84,f1]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(X1)
      | ~ is_a_theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f84,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
    | ~ spl0_5 ),
    inference(resolution,[],[f82,f7]) ).

fof(f7,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ is_a_theorem(implies(implies(implies(X3,X1),implies(X4,X1)),implies(X1,X2)))
      | is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f5,f1]) ).

fof(f5,plain,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
    inference(resolution,[],[f4,f2]) ).

fof(f2,axiom,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz) ).

fof(f4,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X1,X3),X0))
      | is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
    inference(resolution,[],[f2,f1]) ).

fof(f82,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0)))
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f81]) ).

fof(f83,plain,
    ( spl0_1
    | spl0_5 ),
    inference(avatar_split_clause,[],[f76,f81,f13]) ).

fof(f76,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0)))
      | ~ is_a_theorem(X3) ),
    inference(resolution,[],[f50,f1]) ).

fof(f50,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1)))),
    inference(resolution,[],[f21,f2]) ).

fof(f21,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ is_a_theorem(implies(implies(X4,implies(X2,X5)),implies(implies(X1,X2),implies(X3,X2))))
      | is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X3,X2)))) ),
    inference(resolution,[],[f6,f1]) ).

fof(f6,plain,
    ! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(implies(X3,X1),implies(X4,X1))),implies(X5,implies(implies(X3,X1),implies(X4,X1))))),
    inference(resolution,[],[f5,f4]) ).

fof(f47,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f35]) ).

fof(f35,plain,
    ( $false
    | ~ spl0_1 ),
    inference(resolution,[],[f14,f2]) ).

fof(f14,plain,
    ( ! [X2] : ~ is_a_theorem(X2)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : LCL082-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n018.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Apr 29 23:03:13 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.37  % (12276)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (12281)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  % (12278)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38  % (12279)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38  TRYING [3]
% 0.15/0.38  % (12283)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38  % (12284)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38  % (12280)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  % (12285)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.39  TRYING [3]
% 0.15/0.39  TRYING [1]
% 0.15/0.39  TRYING [2]
% 0.15/0.39  TRYING [3]
% 0.15/0.39  TRYING [4]
% 0.15/0.39  TRYING [3]
% 0.15/0.39  % (12284)First to succeed.
% 0.15/0.39  % (12280)Also succeeded, but the first one will report.
% 0.15/0.39  TRYING [4]
% 0.15/0.39  % (12284)Refutation found. Thanks to Tanya!
% 0.15/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39  % (12284)------------------------------
% 0.15/0.39  % (12284)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39  % (12284)Termination reason: Refutation
% 0.15/0.39  
% 0.15/0.39  % (12284)Memory used [KB]: 782
% 0.15/0.39  % (12284)Time elapsed: 0.005 s
% 0.15/0.39  % (12284)Instructions burned: 6 (million)
% 0.15/0.39  % (12284)------------------------------
% 0.15/0.39  % (12284)------------------------------
% 0.15/0.39  % (12276)Success in time 0.021 s
%------------------------------------------------------------------------------