TSTP Solution File: LCL076-3 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL076-3 : 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 : n016.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:23 EDT 2024

% Result   : Unsatisfiable 0.20s 0.39s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   21 (  10 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  15   ~;  13   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   34 (  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f380,plain,
    $false,
    inference(avatar_sat_refutation,[],[f292,f379]) ).

fof(f379,plain,
    ~ spl0_5,
    inference(avatar_contradiction_clause,[],[f378]) ).

fof(f378,plain,
    ( $false
    | ~ spl0_5 ),
    inference(resolution,[],[f295,f6]) ).

fof(f6,axiom,
    ~ is_a_theorem(implies(a,not(not(a)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_40) ).

fof(f295,plain,
    ( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
    | ~ spl0_5 ),
    inference(resolution,[],[f286,f8]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X1),not(X0)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f4,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(f4,axiom,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49) ).

fof(f286,plain,
    ( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f285]) ).

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

fof(f292,plain,
    spl0_5,
    inference(avatar_split_clause,[],[f241,f285]) ).

fof(f241,plain,
    ! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
    inference(resolution,[],[f69,f28]) ).

fof(f28,plain,
    ! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
    inference(resolution,[],[f24,f12]) ).

fof(f12,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
      | is_a_theorem(implies(X0,implies(X2,X1))) ),
    inference(resolution,[],[f5,f4]) ).

fof(f5,axiom,
    ! [X3,X4,X5] :
      ( ~ is_a_theorem(implies(X4,X5))
      | ~ is_a_theorem(implies(X3,X4))
      | is_a_theorem(implies(X3,X5)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).

fof(f24,plain,
    ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[],[f12,f2]) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : LCL076-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Apr 29 23:16:10 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % (6382)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (6388)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37  % (6384)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37  % (6387)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37  % (6386)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37  % (6383)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37  % (6385)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.14/0.37  % (6389)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.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [2]
% 0.14/0.37  TRYING [2]
% 0.14/0.37  TRYING [2]
% 0.14/0.37  TRYING [1]
% 0.14/0.37  TRYING [2]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [3]
% 0.20/0.38  TRYING [4]
% 0.20/0.38  TRYING [4]
% 0.20/0.38  TRYING [4]
% 0.20/0.39  TRYING [4]
% 0.20/0.39  % (6388)First to succeed.
% 0.20/0.39  % (6388)Refutation found. Thanks to Tanya!
% 0.20/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.39  % (6388)------------------------------
% 0.20/0.39  % (6388)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.39  % (6388)Termination reason: Refutation
% 0.20/0.39  
% 0.20/0.39  % (6388)Memory used [KB]: 886
% 0.20/0.39  % (6388)Time elapsed: 0.018 s
% 0.20/0.39  % (6388)Instructions burned: 30 (million)
% 0.20/0.39  % (6388)------------------------------
% 0.20/0.39  % (6388)------------------------------
% 0.20/0.39  % (6382)Success in time 0.034 s
%------------------------------------------------------------------------------