TSTP Solution File: LCL130-1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n005.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 : Wed Aug 31 17:46:59 EDT 2022

% Result   : Unsatisfiable 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   7 unt;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  12   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    6 (   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   :   40 (  40   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f185,plain,
    $false,
    inference(subsumption_resolution,[],[f170,f38]) ).

fof(f38,plain,
    ! [X0] : is_a_theorem(equivalent(X0,X0)),
    inference(resolution,[],[f11,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/sandbox/benchmark/theBenchmark.p',p_4) ).

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

fof(f10,plain,
    ! [X6,X4,X5] :
      ( ~ is_a_theorem(equivalent(X4,X6))
      | ~ is_a_theorem(equivalent(X4,X5))
      | is_a_theorem(equivalent(X5,X6)) ),
    inference(resolution,[],[f8,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(f8,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
      | ~ is_a_theorem(equivalent(X0,X2)) ),
    inference(resolution,[],[f6,f1]) ).

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(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(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(f170,plain,
    ~ is_a_theorem(equivalent(a,a)),
    inference(resolution,[],[f22,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) ).

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

fof(f14,plain,
    ! [X18,X19,X16,X17] :
      ( ~ is_a_theorem(equivalent(equivalent(X16,X17),X18))
      | is_a_theorem(equivalent(X18,equivalent(X19,X17)))
      | ~ is_a_theorem(equivalent(X16,X19)) ),
    inference(resolution,[],[f10,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34  % Computer : n005.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 01:37:33 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  % (6266)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.50  % (6273)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.21/0.50  % (6280)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.21/0.51  % (6263)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.21/0.51  % (6262)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.21/0.51  % (6266)Instruction limit reached!
% 0.21/0.51  % (6266)------------------------------
% 0.21/0.51  % (6266)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (6266)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (6266)Termination reason: Unknown
% 0.21/0.51  % (6266)Termination phase: Saturation
% 0.21/0.51  
% 0.21/0.51  % (6266)Memory used [KB]: 5373
% 0.21/0.51  % (6266)Time elapsed: 0.110 s
% 0.21/0.51  % (6266)Instructions burned: 2 (million)
% 0.21/0.51  % (6266)------------------------------
% 0.21/0.51  % (6266)------------------------------
% 0.21/0.51  % (6261)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.21/0.52  % (6264)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.21/0.52  TRYING [1]
% 0.21/0.52  % (6280)First to succeed.
% 0.21/0.52  % (6280)Refutation found. Thanks to Tanya!
% 0.21/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52  % (6280)------------------------------
% 0.21/0.52  % (6280)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (6280)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (6280)Termination reason: Refutation
% 0.21/0.52  
% 0.21/0.52  % (6280)Memory used [KB]: 1023
% 0.21/0.52  % (6280)Time elapsed: 0.120 s
% 0.21/0.52  % (6280)Instructions burned: 14 (million)
% 0.21/0.52  % (6280)------------------------------
% 0.21/0.52  % (6280)------------------------------
% 0.21/0.52  % (6257)Success in time 0.165 s
%------------------------------------------------------------------------------