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

View Problem - Process Solution

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

% Result   : Unsatisfiable 2.38s 0.73s
% Output   : Refutation 2.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  15   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   34 (  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f9521,plain,
    $false,
    inference(subsumption_resolution,[],[f9520,f3]) ).

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

fof(f9520,plain,
    ~ is_a_theorem(implies(not(a),implies(not(b),not(a)))),
    inference(subsumption_resolution,[],[f9484,f2]) ).

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

fof(f9484,plain,
    ( ~ is_a_theorem(implies(b,implies(not(b),not(a))))
    | ~ is_a_theorem(implies(not(a),implies(not(b),not(a)))) ),
    inference(resolution,[],[f769,f7]) ).

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

fof(f769,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X2))
      | ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(not(X0),X2)) ),
    inference(resolution,[],[f149,f89]) ).

fof(f89,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(implies(not(X0),X1)) ),
    inference(resolution,[],[f29,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(f29,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X0,X1),X1))),
    inference(resolution,[],[f14,f6]) ).

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : LCL045-1 : 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.13/0.35  % Computer : n020.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   : Fri May  3 13:29:01 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.36  % (13559)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (13561)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37  TRYING [1]
% 0.13/0.37  TRYING [2]
% 0.13/0.37  % (13560)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.37  % (13562)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.13/0.37  % (13563)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  % (13565)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.37  % (13564)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.37  TRYING [3]
% 0.13/0.38  TRYING [1]
% 0.13/0.38  TRYING [1]
% 0.13/0.38  TRYING [2]
% 0.13/0.38  TRYING [2]
% 0.13/0.38  % (13566)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.13/0.38  TRYING [3]
% 0.13/0.38  TRYING [3]
% 0.13/0.38  TRYING [1]
% 0.13/0.38  TRYING [2]
% 0.13/0.38  TRYING [3]
% 0.13/0.38  TRYING [4]
% 0.20/0.39  TRYING [4]
% 0.20/0.39  TRYING [4]
% 0.20/0.39  TRYING [4]
% 0.20/0.43  TRYING [5]
% 0.20/0.44  TRYING [5]
% 0.20/0.45  TRYING [5]
% 0.20/0.46  TRYING [5]
% 1.51/0.57  TRYING [6]
% 1.51/0.59  TRYING [6]
% 1.51/0.59  TRYING [6]
% 1.51/0.59  TRYING [6]
% 2.38/0.73  % (13565)First to succeed.
% 2.38/0.73  % (13565)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13559"
% 2.38/0.73  % (13565)Refutation found. Thanks to Tanya!
% 2.38/0.73  % SZS status Unsatisfiable for theBenchmark
% 2.38/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 2.38/0.73  % (13565)------------------------------
% 2.38/0.73  % (13565)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.38/0.73  % (13565)Termination reason: Refutation
% 2.38/0.73  
% 2.38/0.73  % (13565)Memory used [KB]: 3514
% 2.38/0.73  % (13565)Time elapsed: 0.356 s
% 2.38/0.73  % (13565)Instructions burned: 846 (million)
% 2.38/0.73  % (13559)Success in time 0.356 s
%------------------------------------------------------------------------------