TSTP Solution File: COL123-2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : COL123-2 : TPTP v8.1.0. Released v3.2.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 : n023.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:52:57 EDT 2022

% Result   : Unsatisfiable 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   24 (   6 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   47 (  25   ~;  21   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-4 aty)
%            Number of variables   :   24 (  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f193,plain,
    $false,
    inference(avatar_sat_refutation,[],[f184,f192]) ).

fof(f192,plain,
    spl0_16,
    inference(avatar_contradiction_clause,[],[f191]) ).

fof(f191,plain,
    ( $false
    | spl0_16 ),
    inference(subsumption_resolution,[],[f190,f4]) ).

fof(f4,axiom,
    c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f190,plain,
    ( ~ c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a))
    | spl0_16 ),
    inference(resolution,[],[f181,f6]) ).

fof(f6,axiom,
    ! [X6] :
      ( c_in(c_Pair(v_y,v_xaa(X6),t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_x,X6,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f181,plain,
    ( ~ c_in(c_Pair(v_y,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a))
    | spl0_16 ),
    inference(avatar_component_clause,[],[f179]) ).

fof(f179,plain,
    ( spl0_16
  <=> c_in(c_Pair(v_y,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_16])]) ).

fof(f184,plain,
    ~ spl0_16,
    inference(avatar_split_clause,[],[f183,f179]) ).

fof(f183,plain,
    ~ c_in(c_Pair(v_y,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a)),
    inference(subsumption_resolution,[],[f171,f16]) ).

fof(f16,plain,
    ! [X0] :
      ( c_in(c_Pair(v_z,v_xa(v_y,X0,v_z),t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_y,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(resolution,[],[f9,f3]) ).

fof(f3,axiom,
    c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f9,axiom,
    ! [X8,X6,X7] :
      ( ~ c_in(c_Pair(X6,X8,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | c_in(c_Pair(X8,v_xa(X6,X7,X8),t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(X6,X7,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7) ).

fof(f171,plain,
    ( ~ c_in(c_Pair(v_y,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_z,v_xa(v_y,v_xaa(v_xb),v_z),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(resolution,[],[f90,f13]) ).

fof(f13,plain,
    ! [X0] :
      ( c_in(c_Pair(X0,v_xa(v_y,X0,v_z),t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_y,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(resolution,[],[f8,f3]) ).

fof(f8,axiom,
    ! [X8,X6,X7] :
      ( ~ c_in(c_Pair(X6,X8,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(X6,X7,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | c_in(c_Pair(X7,v_xa(X6,X7,X8),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).

fof(f90,plain,
    ! [X0] :
      ( ~ c_in(c_Pair(v_xaa(v_xb),X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_z,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(resolution,[],[f80,f7]) ).

fof(f7,axiom,
    ! [X6] :
      ( ~ c_in(c_Pair(v_xb,X6,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_z,X6,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

fof(f80,plain,
    ! [X0] :
      ( c_in(c_Pair(v_xb,X0,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_xaa(v_xb),X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(resolution,[],[f67,f1]) ).

fof(f1,axiom,
    ! [X2,X0,X1] :
      ( c_in(X0,c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
      | ~ c_in(X0,X1,tc_prod(X2,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Transitive__Closure_Or__into__rtrancl_0) ).

fof(f67,plain,
    ! [X0] :
      ( ~ c_in(c_Pair(v_xaa(v_xb),X0,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
      | c_in(c_Pair(v_xb,X0,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    inference(resolution,[],[f23,f4]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ c_in(c_Pair(v_x,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | c_in(c_Pair(X0,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_xaa(X0),X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    inference(resolution,[],[f2,f5]) ).

fof(f5,axiom,
    ! [X6] :
      ( c_in(c_Pair(X6,v_xaa(X6),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_x,X6,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f2,axiom,
    ! [X2,X3,X1,X4,X5] :
      ( ~ c_in(c_Pair(X5,X3,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
      | c_in(c_Pair(X5,X4,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
      | ~ c_in(c_Pair(X3,X4,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Transitive__Closure_Ortrancl__trans_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : COL123-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/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.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Aug 29 17:19:35 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.48  % (31093)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.49  % (31101)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.49  % (31101)First to succeed.
% 0.19/0.51  % (31101)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (31101)------------------------------
% 0.19/0.51  % (31101)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (31101)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (31101)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (31101)Memory used [KB]: 5500
% 0.19/0.51  % (31101)Time elapsed: 0.082 s
% 0.19/0.51  % (31101)Instructions burned: 8 (million)
% 0.19/0.51  % (31101)------------------------------
% 0.19/0.51  % (31101)------------------------------
% 0.19/0.51  % (31079)Success in time 0.157 s
%------------------------------------------------------------------------------