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

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL216-1 : TPTP v8.1.0. Released v1.1.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 : 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 : Wed Aug 31 17:47:22 EDT 2022

% Result   : Unsatisfiable 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   40 (  29 unt;   0 def)
%            Number of atoms       :   52 (   7 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   29 (  29   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f458,plain,
    $false,
    inference(subsumption_resolution,[],[f456,f17]) ).

fof(f17,plain,
    ~ theorem(sF6),
    inference(definition_folding,[],[f9,f16,f15,f14,f13,f12,f11,f10]) ).

fof(f10,plain,
    or(p,q) = sF0,
    introduced(function_definition,[]) ).

fof(f11,plain,
    not(sF0) = sF1,
    introduced(function_definition,[]) ).

fof(f12,plain,
    not(q) = sF2,
    introduced(function_definition,[]) ).

fof(f13,plain,
    sF3 = or(p,sF2),
    introduced(function_definition,[]) ).

fof(f14,plain,
    sF4 = not(sF3),
    introduced(function_definition,[]) ).

fof(f15,plain,
    sF5 = or(sF4,p),
    introduced(function_definition,[]) ).

fof(f16,plain,
    or(sF1,sF5) = sF6,
    introduced(function_definition,[]) ).

fof(f9,axiom,
    ~ theorem(or(not(or(p,q)),or(not(or(p,not(q))),p))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f456,plain,
    theorem(sF6),
    inference(resolution,[],[f454,f59]) ).

fof(f59,plain,
    ! [X2] :
      ( ~ theorem(or(X2,X2))
      | theorem(X2) ),
    inference(resolution,[],[f7,f1]) ).

fof(f1,axiom,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f7,axiom,
    ! [X3,X4] :
      ( ~ axiom(or(not(X4),X3))
      | theorem(X3)
      | ~ theorem(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f454,plain,
    theorem(or(sF6,sF6)),
    inference(resolution,[],[f452,f362]) ).

fof(f362,plain,
    ! [X2] :
      ( ~ theorem(or(X2,sF5))
      | theorem(or(X2,sF6)) ),
    inference(resolution,[],[f357,f58]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(X1) ),
    inference(resolution,[],[f7,f2]) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f357,plain,
    ! [X0] :
      ( ~ theorem(or(sF1,or(X0,sF5)))
      | theorem(or(X0,sF6)) ),
    inference(resolution,[],[f221,f7]) ).

fof(f221,plain,
    ! [X3] : axiom(or(not(or(sF1,or(X3,sF5))),or(X3,sF6))),
    inference(superposition,[],[f4,f16]) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f452,plain,
    theorem(or(sF6,sF5)),
    inference(resolution,[],[f451,f323]) ).

fof(f323,plain,
    ! [X2] :
      ( ~ theorem(or(X2,p))
      | theorem(or(X2,sF5)) ),
    inference(resolution,[],[f305,f58]) ).

fof(f305,plain,
    ! [X0] :
      ( ~ theorem(or(sF4,or(X0,p)))
      | theorem(or(X0,sF5)) ),
    inference(resolution,[],[f220,f7]) ).

fof(f220,plain,
    ! [X2] : axiom(or(not(or(sF4,or(X2,p))),or(X2,sF5))),
    inference(superposition,[],[f4,f15]) ).

fof(f451,plain,
    theorem(or(sF6,p)),
    inference(resolution,[],[f450,f60]) ).

fof(f60,plain,
    ! [X3,X4] :
      ( ~ theorem(or(X4,X3))
      | theorem(or(X3,X4)) ),
    inference(resolution,[],[f7,f3]) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f450,plain,
    theorem(or(p,sF6)),
    inference(subsumption_resolution,[],[f446,f321]) ).

fof(f321,plain,
    theorem(or(sF2,sF5)),
    inference(resolution,[],[f305,f56]) ).

fof(f56,plain,
    theorem(or(sF4,or(sF2,p))),
    inference(resolution,[],[f54,f6]) ).

fof(f6,axiom,
    ! [X3] :
      ( ~ axiom(X3)
      | theorem(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f54,plain,
    axiom(or(sF4,or(sF2,p))),
    inference(forward_demodulation,[],[f47,f14]) ).

fof(f47,plain,
    axiom(or(not(sF3),or(sF2,p))),
    inference(superposition,[],[f3,f13]) ).

fof(f446,plain,
    ( ~ theorem(or(sF2,sF5))
    | theorem(or(p,sF6)) ),
    inference(resolution,[],[f412,f357]) ).

fof(f412,plain,
    ! [X0] :
      ( theorem(or(sF1,or(p,X0)))
      | ~ theorem(or(sF2,X0)) ),
    inference(resolution,[],[f394,f7]) ).

fof(f394,plain,
    ! [X0] : axiom(or(not(or(sF2,X0)),or(sF1,or(p,X0)))),
    inference(forward_demodulation,[],[f393,f12]) ).

fof(f393,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(sF1,or(p,X0)))),
    inference(forward_demodulation,[],[f384,f11]) ).

fof(f384,plain,
    ! [X0] : axiom(or(not(or(not(q),X0)),or(not(sF0),or(p,X0)))),
    inference(superposition,[],[f5,f10]) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : LCL216-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/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.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 01:30:00 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.21/0.47  % (16911)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.48  % (16935)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.48  % (16922)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 (2999ds/75Mi)
% 0.21/0.48  % (16919)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.48  % (16930)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.21/0.49  % (16914)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.50  % (16914)Instruction limit reached!
% 0.21/0.50  % (16914)------------------------------
% 0.21/0.50  % (16914)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50  % (16914)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50  % (16914)Termination reason: Unknown
% 0.21/0.50  % (16914)Termination phase: Saturation
% 0.21/0.50  
% 0.21/0.50  % (16914)Memory used [KB]: 5373
% 0.21/0.50  % (16914)Time elapsed: 0.064 s
% 0.21/0.50  % (16914)Instructions burned: 7 (million)
% 0.21/0.50  % (16914)------------------------------
% 0.21/0.50  % (16914)------------------------------
% 0.21/0.50  % (16909)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.51  % (16936)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.21/0.51  % (16910)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51  % (16907)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.51  % (16919)First to succeed.
% 0.21/0.51  % (16919)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (16919)------------------------------
% 0.21/0.51  % (16919)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (16919)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (16919)Termination reason: Refutation
% 0.21/0.51  
% 0.21/0.51  % (16919)Memory used [KB]: 5756
% 0.21/0.51  % (16919)Time elapsed: 0.111 s
% 0.21/0.51  % (16919)Instructions burned: 17 (million)
% 0.21/0.51  % (16919)------------------------------
% 0.21/0.51  % (16919)------------------------------
% 0.21/0.51  % (16906)Success in time 0.156 s
%------------------------------------------------------------------------------