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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL014-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 : n029.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:47 EDT 2024

% Result   : Unsatisfiable 33.27s 5.15s
% Output   : Refutation 33.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   40 (  28 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  14   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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   :  103 ( 103   !;   0   ?)

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

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

fof(f108812,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X0,X2)),equivalent(X2,X1)))),
    inference(resolution,[],[f55529,f14382]) ).

fof(f14382,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X1,equivalent(X2,X0))),X2)),
    inference(resolution,[],[f9640,f4863]) ).

fof(f4863,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X1,X0))
      | is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[],[f4671,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(f4671,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
    inference(resolution,[],[f4541,f4]) ).

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

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

fof(f4541,plain,
    ! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X0)))),
    inference(resolution,[],[f4483,f105]) ).

fof(f105,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X0,X1)),equivalent(X1,X2)),X2)),
    inference(resolution,[],[f99,f7]) ).

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

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

fof(f99,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X1)),
    inference(resolution,[],[f97,f7]) ).

fof(f97,plain,
    ! [X0] : is_a_theorem(equivalent(X0,X0)),
    inference(resolution,[],[f67,f30]) ).

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

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

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

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

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

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

fof(f4483,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(X1,X0),X1))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f4479,f1]) ).

fof(f4479,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X0),X1)),
    inference(subsumption_resolution,[],[f4448,f97]) ).

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

fof(f3995,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X0),equivalent(equivalent(equivalent(X1,X2),X1),X2))),
    inference(resolution,[],[f2219,f33]) ).

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

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

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

fof(f113,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(X1)
      | is_a_theorem(equivalent(equivalent(X0,X0),X1)) ),
    inference(resolution,[],[f102,f1]) ).

fof(f102,plain,
    ! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X1),X0))),
    inference(resolution,[],[f97,f40]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(X1)
      | is_a_theorem(equivalent(X0,equivalent(X1,X0))) ),
    inference(resolution,[],[f32,f1]) ).

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

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

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

fof(f4543,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,equivalent(X2,X0)))),
    inference(resolution,[],[f4483,f10]) ).

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

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

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

fof(f11231,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X0)))),
    inference(resolution,[],[f4862,f4863]) ).

fof(f4862,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
    inference(resolution,[],[f4671,f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : LCL014-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32  % Computer : n029.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri May  3 13:45:37 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  % (13250)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34  % (13251)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.34  % (13253)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.11/0.34  % (13254)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.11/0.34  % (13255)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.34  TRYING [1]
% 0.11/0.34  % (13256)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.34  % (13257)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.11/0.34  TRYING [1]
% 0.11/0.34  TRYING [2]
% 0.11/0.34  TRYING [1]
% 0.11/0.34  TRYING [2]
% 0.11/0.34  TRYING [2]
% 0.11/0.34  TRYING [3]
% 0.11/0.34  % (13252)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.34  TRYING [3]
% 0.11/0.34  TRYING [1]
% 0.11/0.34  TRYING [3]
% 0.11/0.34  TRYING [2]
% 0.11/0.34  TRYING [3]
% 0.11/0.35  TRYING [4]
% 0.11/0.35  TRYING [4]
% 0.11/0.35  TRYING [4]
% 0.11/0.35  TRYING [4]
% 0.17/0.47  TRYING [5]
% 0.17/0.47  TRYING [5]
% 0.17/0.47  TRYING [5]
% 0.17/0.48  TRYING [5]
% 31.02/4.84  TRYING [6]
% 33.27/5.14  % (13255)First to succeed.
% 33.27/5.15  % (13255)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13250"
% 33.27/5.15  % (13255)Refutation found. Thanks to Tanya!
% 33.27/5.15  % SZS status Unsatisfiable for theBenchmark
% 33.27/5.15  % SZS output start Proof for theBenchmark
% See solution above
% 33.27/5.15  % (13255)------------------------------
% 33.27/5.15  % (13255)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 33.27/5.15  % (13255)Termination reason: Refutation
% 33.27/5.15  
% 33.27/5.15  % (13255)Memory used [KB]: 48553
% 33.27/5.15  % (13255)Time elapsed: 4.792 s
% 33.27/5.15  % (13255)Instructions burned: 10330 (million)
% 33.27/5.15  % (13250)Success in time 4.826 s
%------------------------------------------------------------------------------