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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : COM004-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 : n006.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 15:53:33 EDT 2022

% Result   : Unsatisfiable 0.21s 0.55s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   15 (  11 unt;   0 def)
%            Number of atoms       :   25 (   2 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   25 (  15   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   16 (  16   !;   0   ?)

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

fof(f3,axiom,
    ! [X0] : contradictory(X0,negate(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_contradicts_not_x) ).

fof(f18,plain,
    ~ contradictory(atom,negate(atom)),
    inference(resolution,[],[f17,f5]) ).

fof(f5,axiom,
    failure_node(n_left,or(empty,atom)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_left_is_atom) ).

fof(f17,plain,
    ! [X0] :
      ( ~ failure_node(n_left,or(empty,X0))
      | ~ contradictory(X0,negate(atom)) ),
    inference(resolution,[],[f16,f6]) ).

fof(f6,axiom,
    failure_node(n_right,or(empty,negate(atom))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_right_is_not_atom) ).

fof(f16,plain,
    ! [X3,X4] :
      ( ~ failure_node(n_right,or(empty,X4))
      | ~ contradictory(X3,X4)
      | ~ failure_node(n_left,or(empty,X3)) ),
    inference(resolution,[],[f14,f12]) ).

fof(f12,plain,
    siblings(n_left,n_right),
    inference(forward_demodulation,[],[f11,f7]) ).

fof(f7,axiom,
    n_left = left_child_of(n),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_left_equals_left_child_of_n) ).

fof(f11,plain,
    siblings(left_child_of(n),n_right),
    inference(superposition,[],[f4,f8]) ).

fof(f8,axiom,
    n_right = right_child_of(n),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_right_equals_right_child_of_n) ).

fof(f4,axiom,
    ! [X0] : siblings(left_child_of(X0),right_child_of(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_left_and_n_right_are_siblings) ).

fof(f14,plain,
    ! [X2,X3,X0,X1] :
      ( ~ siblings(X2,X0)
      | ~ contradictory(X3,X1)
      | ~ failure_node(X2,or(empty,X3))
      | ~ failure_node(X0,or(empty,X1)) ),
    inference(resolution,[],[f1,f9]) ).

fof(f9,axiom,
    ! [X6] : ~ failure_node(X6,or(empty,empty)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_is_there_an_empty_node) ).

fof(f1,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( failure_node(parent_of(X0,X1),or(X2,X3))
      | ~ failure_node(X1,or(X3,X5))
      | ~ siblings(X0,X1)
      | ~ contradictory(X4,X5)
      | ~ failure_node(X0,or(X2,X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',make_node) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : COM004-1 : TPTP v8.1.0. Released v1.1.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 : n006.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   : Mon Aug 29 17:01:10 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.21/0.54  % (11037)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.55  % (11045)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.55  % (11029)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.55  % (11045)First to succeed.
% 0.21/0.55  % (11037)Also succeeded, but the first one will report.
% 0.21/0.55  % (11045)Refutation found. Thanks to Tanya!
% 0.21/0.55  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55  % (11045)------------------------------
% 0.21/0.55  % (11045)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55  % (11045)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55  % (11045)Termination reason: Refutation
% 0.21/0.55  
% 0.21/0.55  % (11045)Memory used [KB]: 5373
% 0.21/0.55  % (11045)Time elapsed: 0.096 s
% 0.21/0.55  % (11045)Instructions burned: 2 (million)
% 0.21/0.55  % (11045)------------------------------
% 0.21/0.55  % (11045)------------------------------
% 0.21/0.55  % (11021)Success in time 0.201 s
%------------------------------------------------------------------------------