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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL040-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 : n031.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 18.24s 2.99s
% Output   : Refutation 18.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  16   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   39 (  39   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f61377,plain,
    $false,
    inference(subsumption_resolution,[],[f61268,f2]) ).

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

fof(f61268,plain,
    ~ is_a_theorem(implies(b,implies(a,b))),
    inference(resolution,[],[f2056,f7]) ).

fof(f7,axiom,
    ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_21) ).

fof(f2056,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X0,implies(X1,X3))))
      | ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f224,f97]) ).

fof(f97,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X3,implies(implies(X0,X1),implies(X0,X2))))),
    inference(resolution,[],[f55,f3]) ).

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/sandbox/benchmark/theBenchmark.p',cn_35) ).

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

fof(f22,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,f8]) ).

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

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

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(f224,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(X2,implies(X0,implies(X1,X3))))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X2,implies(X0,X3))) ),
    inference(resolution,[],[f77,f22]) ).

fof(f77,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f26,f8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : LCL040-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n031.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   : Fri May  3 13:52:02 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.22/0.36  % (5883)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38  % (5884)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38  % (5887)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.38  % (5886)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.22/0.38  % (5888)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.38  % (5889)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.38  % (5885)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38  % (5890)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.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [3]
% 0.22/0.38  TRYING [3]
% 0.22/0.38  TRYING [3]
% 0.22/0.38  TRYING [3]
% 0.22/0.39  TRYING [4]
% 0.22/0.39  TRYING [4]
% 0.22/0.39  TRYING [4]
% 0.22/0.39  TRYING [4]
% 0.22/0.42  TRYING [5]
% 0.22/0.42  TRYING [5]
% 0.22/0.42  TRYING [5]
% 0.22/0.43  TRYING [5]
% 0.22/0.52  TRYING [6]
% 0.22/0.52  TRYING [6]
% 0.22/0.52  TRYING [6]
% 0.22/0.52  TRYING [6]
% 2.88/0.80  TRYING [7]
% 2.88/0.80  TRYING [7]
% 2.88/0.81  TRYING [7]
% 3.41/0.83  TRYING [7]
% 9.31/1.73  TRYING [8]
% 9.31/1.74  TRYING [8]
% 9.94/1.78  TRYING [8]
% 10.32/1.83  TRYING [8]
% 18.24/2.99  % (5889)First to succeed.
% 18.24/2.99  % (5889)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5883"
% 18.24/2.99  % (5889)Refutation found. Thanks to Tanya!
% 18.24/2.99  % SZS status Unsatisfiable for theBenchmark
% 18.24/2.99  % SZS output start Proof for theBenchmark
% See solution above
% 18.24/3.00  % (5889)------------------------------
% 18.24/3.00  % (5889)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 18.24/3.00  % (5889)Termination reason: Refutation
% 18.24/3.00  
% 18.24/3.00  % (5889)Memory used [KB]: 20971
% 18.24/3.00  % (5889)Time elapsed: 2.613 s
% 18.24/3.00  % (5889)Instructions burned: 9188 (million)
% 18.24/3.00  % (5883)Success in time 2.594 s
%------------------------------------------------------------------------------