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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL131-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 : n023.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 10.32s 1.82s
% Output   : Refutation 10.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   39 (  20 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   55 (  29   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    8 (   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   :  127 ( 127   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f40663,plain,
    $false,
    inference(resolution,[],[f1629,f5165]) ).

fof(f5165,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)),X0)),
    inference(resolution,[],[f2248,f2068]) ).

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

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

fof(f4,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,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/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

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

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

fof(f1527,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
      | ~ is_a_theorem(X0)
      | is_a_theorem(equivalent(X2,X1)) ),
    inference(resolution,[],[f1382,f9]) ).

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

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

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

fof(f1284,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X2),X1)))),
    inference(resolution,[],[f365,f217]) ).

fof(f217,plain,
    ! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(X1,X1)))),
    inference(resolution,[],[f55,f9]) ).

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

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

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

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

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

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

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

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

fof(f2248,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))),
    inference(resolution,[],[f1653,f55]) ).

fof(f1653,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X2,X2)),X1))
      | is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[],[f1469,f89]) ).

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

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

fof(f1469,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,equivalent(X2,X2)))))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f1314,f222]) ).

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

fof(f1314,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X2)),X2))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f1284,f777]) ).

fof(f777,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
      | is_a_theorem(X0)
      | ~ is_a_theorem(X2) ),
    inference(resolution,[],[f172,f17]) ).

fof(f17,plain,
    ! [X0] : is_a_theorem(equivalent(X0,X0)),
    inference(resolution,[],[f15,f9]) ).

fof(f15,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
    inference(resolution,[],[f11,f9]) ).

fof(f11,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,[],[f9,f5]) ).

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

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

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

fof(f1629,plain,
    ! [X2,X3,X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(X0,X2))),X3),equivalent(a,X3))),
    inference(resolution,[],[f175,f2]) ).

fof(f175,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(a,X1)))
      | ~ is_a_theorem(equivalent(X0,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))) ),
    inference(resolution,[],[f37,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/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL131-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n023.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon Apr 29 23:00:40 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.36  % (23042)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37  % (23050)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.37  % (23047)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.37  % (23046)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.37  % (23049)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.37  % (23048)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.37  % (23051)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.37  % (23045)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37  TRYING [1]
% 0.15/0.37  TRYING [1]
% 0.15/0.37  TRYING [1]
% 0.15/0.37  TRYING [1]
% 0.15/0.37  TRYING [2]
% 0.15/0.37  TRYING [2]
% 0.15/0.37  TRYING [2]
% 0.15/0.37  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.40  TRYING [4]
% 0.15/0.40  TRYING [4]
% 0.15/0.40  TRYING [4]
% 0.15/0.40  TRYING [4]
% 3.04/0.80  TRYING [5]
% 3.04/0.81  TRYING [5]
% 3.69/0.86  TRYING [5]
% 3.69/0.87  TRYING [5]
% 10.32/1.82  % (23047)First to succeed.
% 10.32/1.82  % (23047)Refutation found. Thanks to Tanya!
% 10.32/1.82  % SZS status Unsatisfiable for theBenchmark
% 10.32/1.82  % SZS output start Proof for theBenchmark
% See solution above
% 10.32/1.82  % (23047)------------------------------
% 10.32/1.82  % (23047)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 10.32/1.82  % (23047)Termination reason: Refutation
% 10.32/1.82  
% 10.32/1.82  % (23047)Memory used [KB]: 13138
% 10.32/1.82  % (23047)Time elapsed: 1.449 s
% 10.32/1.82  % (23047)Instructions burned: 5421 (million)
% 10.32/1.82  % (23047)------------------------------
% 10.32/1.82  % (23047)------------------------------
% 10.32/1.82  % (23042)Success in time 1.449 s
%------------------------------------------------------------------------------