TSTP Solution File: COL102-2 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : COL102-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n009.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 : Sun May  5 04:45:54 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f20,plain,
    $false,
    inference(resolution,[],[f17,f1]) ).

fof(f1,axiom,
    c_in(c_Pair(v_y,v_za,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f17,plain,
    ~ c_in(c_Pair(v_y,v_za,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
    inference(resolution,[],[f16,f4]) ).

fof(f4,axiom,
    ! [X2,X0,X1] :
      ( c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X0,X2),c_Comb_Ocomb_Oop_A_D_D(X1,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
      | ~ c_in(c_Pair(X0,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Comb_Ocontract_OAp1_0) ).

fof(f16,plain,
    ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
    inference(resolution,[],[f10,f5]) ).

fof(f5,axiom,
    ! [X3,X4,X5] :
      ( c_in(X3,c_Transitive__Closure_Ortrancl(X4,X5),tc_prod(X5,X5))
      | ~ c_in(X3,X4,tc_prod(X5,X5)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Transitive__Closure_Or__into__rtrancl_0) ).

fof(f10,plain,
    ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
    inference(resolution,[],[f9,f2]) ).

fof(f2,axiom,
    c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f9,plain,
    ! [X0] :
      ( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),X0,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
      | ~ c_in(c_Pair(X0,c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
    inference(resolution,[],[f6,f3]) ).

fof(f3,axiom,
    ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f6,axiom,
    ! [X8,X6,X7,X4,X5] :
      ( c_in(c_Pair(X8,X7,X5,X5),c_Transitive__Closure_Ortrancl(X4,X5),tc_prod(X5,X5))
      | ~ c_in(c_Pair(X8,X6,X5,X5),c_Transitive__Closure_Ortrancl(X4,X5),tc_prod(X5,X5))
      | ~ c_in(c_Pair(X6,X7,X5,X5),c_Transitive__Closure_Ortrancl(X4,X5),tc_prod(X5,X5)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Transitive__Closure_Ortrancl__trans_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : COL102-2 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n009.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 18:30:08 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.36  % (30071)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37  % (30074)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.37  % (30074)First to succeed.
% 0.15/0.37  % (30074)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30071"
% 0.15/0.37  % (30074)Refutation found. Thanks to Tanya!
% 0.15/0.37  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.37  % (30074)------------------------------
% 0.15/0.37  % (30074)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.37  % (30074)Termination reason: Refutation
% 0.15/0.37  
% 0.15/0.37  % (30074)Memory used [KB]: 753
% 0.15/0.37  % (30074)Time elapsed: 0.002 s
% 0.15/0.37  % (30074)Instructions burned: 3 (million)
% 0.15/0.37  % (30071)Success in time 0.011 s
%------------------------------------------------------------------------------