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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL108-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 : n007.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:44:04 EDT 2024

% Result   : Unsatisfiable 0.15s 0.39s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (  13 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   17 (   9   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Maximal term depth    :    8 (   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   :  105 ( 105   !;   0   ?)

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

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

fof(f98,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
    inference(resolution,[],[f82,f44]) ).

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

fof(f9,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),equivalent(equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(X5,X7))),equivalent(X4,equivalent(X6,X7))),X2)))
      | is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(resolution,[],[f6,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(f6,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)),equivalent(equivalent(X1,X2),X7))),
    inference(resolution,[],[f5,f4]) ).

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

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

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

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

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

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

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

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

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

fof(f78,plain,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,equivalent(X3,X0)),equivalent(X2,equivalent(X3,X4)))),equivalent(X1,X4))),
    inference(resolution,[],[f75,f40]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LCL108-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n007.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:38:05 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (363)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (364)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38  % (368)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38  % (366)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  % (367)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  % (369)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38  % (370)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  % (365)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 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 [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [2]
% 0.15/0.39  TRYING [3]
% 0.15/0.39  TRYING [3]
% 0.15/0.39  TRYING [3]
% 0.15/0.39  % (368)First to succeed.
% 0.15/0.39  TRYING [3]
% 0.15/0.39  % (368)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-363"
% 0.15/0.39  % (368)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  % (368)------------------------------
% 0.15/0.39  % (368)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39  % (368)Termination reason: Refutation
% 0.15/0.39  
% 0.15/0.39  % (368)Memory used [KB]: 843
% 0.15/0.39  % (368)Time elapsed: 0.008 s
% 0.15/0.39  % (368)Instructions burned: 10 (million)
% 0.15/0.39  % (363)Success in time 0.023 s
%------------------------------------------------------------------------------