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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL173-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 : n019.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:07 EDT 2022

% Result   : Unsatisfiable 0.20s 0.49s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   23 (  22 unt;   0 def)
%            Number of atoms       :   24 (   9 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    4 (   3   ~;   1   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  12 con; 0-2 aty)
%            Number of variables   :    7 (   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f293,plain,
    $false,
    inference(subsumption_resolution,[],[f292,f19]) ).

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

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

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

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

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

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

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

fof(f16,plain,
    or(sF3,r) = sF6,
    introduced(function_definition,[]) ).

fof(f17,plain,
    sF7 = or(sF5,sF6),
    introduced(function_definition,[]) ).

fof(f18,plain,
    sF8 = or(sF2,sF7),
    introduced(function_definition,[]) ).

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

fof(f292,plain,
    theorem(sF8),
    inference(resolution,[],[f287,f6]) ).

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

fof(f287,plain,
    axiom(sF8),
    inference(forward_demodulation,[],[f286,f18]) ).

fof(f286,plain,
    axiom(or(sF2,sF7)),
    inference(forward_demodulation,[],[f285,f12]) ).

fof(f285,plain,
    axiom(or(not(sF1),sF7)),
    inference(forward_demodulation,[],[f284,f11]) ).

fof(f284,plain,
    axiom(or(not(or(sF0,r)),sF7)),
    inference(forward_demodulation,[],[f283,f17]) ).

fof(f283,plain,
    axiom(or(not(or(sF0,r)),or(sF5,sF6))),
    inference(superposition,[],[f115,f16]) ).

fof(f115,plain,
    ! [X2] : axiom(or(not(or(sF0,X2)),or(sF5,or(sF3,X2)))),
    inference(forward_demodulation,[],[f114,f10]) ).

fof(f114,plain,
    ! [X2] : axiom(or(not(or(not(q),X2)),or(sF5,or(sF3,X2)))),
    inference(forward_demodulation,[],[f105,f15]) ).

fof(f105,plain,
    ! [X2] : axiom(or(not(or(not(q),X2)),or(not(sF4),or(sF3,X2)))),
    inference(superposition,[],[f5,f14]) ).

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.07/0.12  % Problem    : LCL173-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/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 : n019.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:43:35 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.48  % (7909)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.48  % (7901)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.49  % (7909)First to succeed.
% 0.20/0.49  % (7901)Also succeeded, but the first one will report.
% 0.20/0.49  % (7909)Refutation found. Thanks to Tanya!
% 0.20/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49  % (7909)------------------------------
% 0.20/0.49  % (7909)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49  % (7909)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49  % (7909)Termination reason: Refutation
% 0.20/0.49  
% 0.20/0.49  % (7909)Memory used [KB]: 5756
% 0.20/0.49  % (7909)Time elapsed: 0.080 s
% 0.20/0.49  % (7909)Instructions burned: 12 (million)
% 0.20/0.49  % (7909)------------------------------
% 0.20/0.49  % (7909)------------------------------
% 0.20/0.49  % (7887)Success in time 0.14 s
%------------------------------------------------------------------------------