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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL130-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 : Tue Apr 30 13:40:35 EDT 2024

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

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

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

fof(f237,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))))),
    inference(resolution,[],[f212,f46]) ).

fof(f46,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
    inference(resolution,[],[f45,f5]) ).

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

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

fof(f4,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f2,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(f45,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X3),equivalent(X2,X3)))
      | is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(resolution,[],[f36,f1]) ).

fof(f36,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X3,X2)),equivalent(equivalent(X0,X1),X3))),
    inference(resolution,[],[f32,f14]) ).

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

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

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

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

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

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

fof(f19,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(equivalent(X0,X3),equivalent(X2,X3)))),
    inference(resolution,[],[f14,f6]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LCL130-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n020.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   : Mon Apr 29 22:53:17 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (4643)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (4645)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38  % (4648)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38  % (4646)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.15/0.38  % (4647)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.38  % (4649)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38  % (4650)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.15/0.38  % (4644)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [3]
% 0.15/0.39  % (4648)First to succeed.
% 0.15/0.39  % (4648)Refutation found. Thanks to Tanya!
% 0.15/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39  % (4648)------------------------------
% 0.15/0.39  % (4648)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39  % (4648)Termination reason: Refutation
% 0.15/0.39  
% 0.15/0.39  % (4648)Memory used [KB]: 848
% 0.15/0.39  % (4648)Time elapsed: 0.009 s
% 0.15/0.39  % (4648)Instructions burned: 13 (million)
% 0.15/0.39  % (4648)------------------------------
% 0.15/0.39  % (4648)------------------------------
% 0.15/0.39  % (4643)Success in time 0.018 s
%------------------------------------------------------------------------------