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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL118-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 : n014.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:33 EDT 2024

% Result   : Unsatisfiable 0.21s 0.45s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (  10 unt;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   15 (   8   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    7 (   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   :   51 (  51   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4419,plain,
    $false,
    inference(resolution,[],[f4374,f3]) ).

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

fof(f4374,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X2,X0)))),
    inference(resolution,[],[f20,f81]) ).

fof(f81,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X1,X0),equivalent(X2,X3))))
      | is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
    inference(resolution,[],[f60,f1]) ).

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

fof(f60,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X0))),equivalent(X2,equivalent(X1,X3)))),
    inference(resolution,[],[f26,f2]) ).

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

fof(f26,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(X2,X1),X3))
      | is_a_theorem(equivalent(equivalent(X0,equivalent(X1,equivalent(X2,X0))),X3)) ),
    inference(resolution,[],[f13,f1]) ).

fof(f13,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,equivalent(X1,equivalent(X0,X3))),X2))),
    inference(resolution,[],[f9,f4]) ).

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

fof(f9,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0)))),
    inference(resolution,[],[f7,f5]) ).

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

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

fof(f20,plain,
    ! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,equivalent(X1,X0)),equivalent(equivalent(X3,X4),equivalent(X5,equivalent(X4,equivalent(X3,X5))))))),
    inference(resolution,[],[f12,f5]) ).

fof(f12,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(X3)
      | is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,equivalent(X1,X0)),X3))) ),
    inference(resolution,[],[f8,f1]) ).

fof(f8,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,equivalent(X2,X1)),X0)))),
    inference(resolution,[],[f7,f2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : LCL118-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36  % Computer : n014.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon Apr 29 22:35:49 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.37  % (1391)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38  % (1392)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.38  % (1393)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38  % (1394)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.38  % (1396)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.38  % (1397)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.38  % (1395)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.38  % (1398)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.38  TRYING [1]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [2]
% 0.14/0.39  TRYING [3]
% 0.14/0.39  TRYING [3]
% 0.14/0.39  TRYING [3]
% 0.14/0.39  TRYING [3]
% 0.14/0.39  TRYING [4]
% 0.14/0.39  TRYING [4]
% 0.14/0.40  TRYING [4]
% 0.14/0.40  TRYING [4]
% 0.21/0.45  % (1396)First to succeed.
% 0.21/0.45  % (1396)Refutation found. Thanks to Tanya!
% 0.21/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.45  % (1396)------------------------------
% 0.21/0.45  % (1396)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.45  % (1396)Termination reason: Refutation
% 0.21/0.45  
% 0.21/0.45  % (1396)Memory used [KB]: 2230
% 0.21/0.45  % (1396)Time elapsed: 0.067 s
% 0.21/0.45  % (1396)Instructions burned: 206 (million)
% 0.21/0.45  % (1396)------------------------------
% 0.21/0.45  % (1396)------------------------------
% 0.21/0.45  % (1391)Success in time 0.083 s
%------------------------------------------------------------------------------