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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL039-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 : 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 : Sun May  5 07:43:51 EDT 2024

% Result   : Unsatisfiable 0.16s 0.39s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   36 (  11 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   61 (  32   ~;  27   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   54 (  54   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1473,plain,
    $false,
    inference(avatar_sat_refutation,[],[f441,f795,f1472]) ).

fof(f1472,plain,
    ~ spl0_11,
    inference(avatar_contradiction_clause,[],[f1471]) ).

fof(f1471,plain,
    ( $false
    | ~ spl0_11 ),
    inference(resolution,[],[f1184,f152]) ).

fof(f152,plain,
    ~ is_a_theorem(implies(a,not(necessary(not(a))))),
    inference(resolution,[],[f151,f8]) ).

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

fof(f151,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(necessary(X0),X1))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f74,f7]) ).

fof(f7,axiom,
    ! [X0] :
      ( is_a_theorem(necessary(X0))
      | ~ is_a_theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_of_necessitation) ).

fof(f74,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(necessary(implies(X0,X1)))
      | is_a_theorem(implies(necessary(X0),X1)) ),
    inference(resolution,[],[f49,f13]) ).

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

fof(f49,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,necessary(X1)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f24,f6]) ).

fof(f6,axiom,
    ! [X0] : is_a_theorem(implies(necessary(X0),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',necessitation2) ).

fof(f24,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X2,X1))
      | ~ is_a_theorem(implies(X0,X2))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f19,f10]) ).

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

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

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

fof(f16,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) ).

fof(f1184,plain,
    ( ! [X0] : is_a_theorem(implies(X0,not(necessary(not(X0)))))
    | ~ spl0_11 ),
    inference(resolution,[],[f826,f11]) ).

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

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(f826,plain,
    ( ! [X0] : is_a_theorem(implies(not(not(necessary(X0))),X0))
    | ~ spl0_11 ),
    inference(resolution,[],[f794,f49]) ).

fof(f794,plain,
    ( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
    | ~ spl0_11 ),
    inference(avatar_component_clause,[],[f793]) ).

fof(f793,plain,
    ( spl0_11
  <=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_11])]) ).

fof(f795,plain,
    ( spl0_11
    | spl0_1 ),
    inference(avatar_split_clause,[],[f778,f37,f793]) ).

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

fof(f778,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(X0)
      | is_a_theorem(implies(not(not(X1)),X1)) ),
    inference(resolution,[],[f133,f171]) ).

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

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

fof(f133,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,implies(not(X2),not(X0))))
      | ~ is_a_theorem(X0)
      | is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[],[f79,f24]) ).

fof(f79,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),not(X1)),X0))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f25,f10]) ).

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

fof(f441,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f396]) ).

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

fof(f38,plain,
    ( ! [X1] : ~ is_a_theorem(X1)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f37]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : LCL039-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.11  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.32  % Computer : n013.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 300
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Fri May  3 13:20:04 EDT 2024
% 0.10/0.32  % CPUTime    : 
% 0.10/0.32  % (20880)Running in auto input_syntax mode. Trying TPTP
% 0.10/0.34  % (20884)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.10/0.34  % (20887)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.10/0.34  % (20886)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.10/0.34  % (20885)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.10/0.34  % (20882)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.10/0.34  % (20883)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.10/0.34  TRYING [1]
% 0.10/0.34  TRYING [2]
% 0.10/0.34  TRYING [1]
% 0.10/0.34  TRYING [1]
% 0.10/0.34  TRYING [2]
% 0.10/0.34  TRYING [2]
% 0.10/0.34  TRYING [3]
% 0.10/0.34  TRYING [3]
% 0.10/0.34  TRYING [3]
% 0.10/0.34  % (20881)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.10/0.34  TRYING [1]
% 0.10/0.34  TRYING [2]
% 0.10/0.34  TRYING [3]
% 0.16/0.34  TRYING [4]
% 0.16/0.35  TRYING [4]
% 0.16/0.35  TRYING [4]
% 0.16/0.35  TRYING [4]
% 0.16/0.37  TRYING [5]
% 0.16/0.37  TRYING [5]
% 0.16/0.38  TRYING [5]
% 0.16/0.38  TRYING [5]
% 0.16/0.39  % (20886)First to succeed.
% 0.16/0.39  % (20886)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20880"
% 0.16/0.39  % (20886)Refutation found. Thanks to Tanya!
% 0.16/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.39  % (20886)------------------------------
% 0.16/0.39  % (20886)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.39  % (20886)Termination reason: Refutation
% 0.16/0.39  
% 0.16/0.39  % (20886)Memory used [KB]: 1291
% 0.16/0.39  % (20886)Time elapsed: 0.056 s
% 0.16/0.39  % (20886)Instructions burned: 112 (million)
% 0.16/0.39  % (20880)Success in time 0.07 s
%------------------------------------------------------------------------------