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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL008-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:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f72,plain,
    $false,
    inference(avatar_sat_refutation,[],[f60,f71]) ).

fof(f71,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f68]) ).

fof(f68,plain,
    ( $false
    | ~ spl0_2 ),
    inference(resolution,[],[f58,f29]) ).

fof(f29,plain,
    ~ is_a_theorem(equivalent(a,a)),
    inference(resolution,[],[f16,f3]) ).

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

fof(f16,plain,
    ! [X10,X8,X9] :
      ( is_a_theorem(equivalent(equivalent(X8,X9),equivalent(X9,X10)))
      | ~ is_a_theorem(equivalent(X8,X10)) ),
    inference(resolution,[],[f8,f9]) ).

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

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

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

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

fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

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

fof(f8,plain,
    ! [X6,X7,X4,X5] :
      ( ~ is_a_theorem(equivalent(X4,equivalent(X5,X6)))
      | is_a_theorem(equivalent(X4,equivalent(X6,X7)))
      | ~ is_a_theorem(equivalent(X5,X7)) ),
    inference(resolution,[],[f6,f4]) ).

fof(f58,plain,
    ( ! [X1] : is_a_theorem(equivalent(X1,X1))
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f57]) ).

fof(f57,plain,
    ( spl0_2
  <=> ! [X1] : is_a_theorem(equivalent(X1,X1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f60,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f48,f57]) ).

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

fof(f24,plain,
    ! [X14,X12,X13] :
      ( ~ is_a_theorem(equivalent(equivalent(X12,X13),equivalent(X14,X12)))
      | is_a_theorem(equivalent(X14,X13)) ),
    inference(resolution,[],[f11,f1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : LCL008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.31  % Computer : n005.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31  % CPULimit   : 300
% 0.15/0.31  % WCLimit    : 300
% 0.15/0.31  % DateTime   : Tue Aug 30 01:28:33 EDT 2022
% 0.15/0.31  % CPUTime    : 
% 0.15/0.46  % (12674)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.15/0.47  % (12668)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.15/0.47  % (12666)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.15/0.47  % (12667)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.15/0.47  % (12678)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.15/0.48  % (12686)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.15/0.48  % (12668)Instruction limit reached!
% 0.15/0.48  % (12668)------------------------------
% 0.15/0.48  % (12668)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48  % (12668)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.48  % (12668)Termination reason: Unknown
% 0.15/0.48  % (12668)Termination phase: Saturation
% 0.15/0.48  
% 0.15/0.48  % (12668)Memory used [KB]: 5373
% 0.15/0.48  % (12668)Time elapsed: 0.104 s
% 0.15/0.48  % (12668)Instructions burned: 2 (million)
% 0.15/0.48  % (12668)------------------------------
% 0.15/0.48  % (12668)------------------------------
% 0.15/0.48  % (12670)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.15/0.48  % (12682)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.15/0.48  % (12675)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.15/0.48  % (12670)First to succeed.
% 0.15/0.48  % (12684)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.15/0.48  % (12670)Refutation found. Thanks to Tanya!
% 0.15/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48  % (12670)------------------------------
% 0.15/0.48  % (12670)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48  % (12670)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.48  % (12670)Termination reason: Refutation
% 0.15/0.48  
% 0.15/0.48  % (12670)Memory used [KB]: 5373
% 0.15/0.48  % (12670)Time elapsed: 0.106 s
% 0.15/0.48  % (12670)Instructions burned: 3 (million)
% 0.15/0.48  % (12670)------------------------------
% 0.15/0.48  % (12670)------------------------------
% 0.15/0.48  % (12659)Success in time 0.161 s
%------------------------------------------------------------------------------