TSTP Solution File: KRS187+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : KRS187+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n029.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  : 600s
% DateTime : Sun Jul 17 03:30:50 EDT 2022

% Result   : Theorem 0.46s 0.69s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   10 (   6 unt;   1 nHn;  10 RR)
%            Number of literals    :   14 (   0 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(9,axiom,
    ~ isa(tac,thm),
    file('KRS187+1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ status__dfg(u,v,tac)
    | model(w,v) ),
    file('KRS187+1.p',unknown),
    [] ).

cnf(50,axiom,
    ( ~ model(skf61(u,v),u)
    | status__dfg(w,u,thm) ),
    file('KRS187+1.p',unknown),
    [] ).

cnf(65,axiom,
    ( isa(u,v)
    | status__dfg(skf97(v,u),skf96(v,u),u) ),
    file('KRS187+1.p',unknown),
    [] ).

cnf(81,axiom,
    ( ~ status__dfg(skf97(u,v),skf96(u,v),u)
    | isa(w,u) ),
    file('KRS187+1.p',unknown),
    [] ).

cnf(112,plain,
    status__dfg(skf97(thm,tac),skf96(thm,tac),tac),
    inference(res,[status(thm),theory(equality)],[65,9]),
    [iquote('0:Res:65.1,9.0')] ).

cnf(113,plain,
    ~ status__dfg(skf97(thm,u),skf96(thm,u),thm),
    inference(res,[status(thm),theory(equality)],[81,9]),
    [iquote('0:Res:81.1,9.0')] ).

cnf(144,plain,
    model(u,skf96(thm,tac)),
    inference(res,[status(thm),theory(equality)],[112,24]),
    [iquote('0:Res:112.0,24.0')] ).

cnf(351,plain,
    status__dfg(u,skf96(thm,tac),thm),
    inference(res,[status(thm),theory(equality)],[144,50]),
    [iquote('0:Res:144.0,50.0')] ).

cnf(354,plain,
    $false,
    inference(unc,[status(thm)],[351,113]),
    [iquote('0:UnC:351.0,113.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS187+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n029.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  : 600
% 0.13/0.34  % DateTime : Tue Jun  7 14:11:50 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.46/0.69  
% 0.46/0.69  SPASS V 3.9 
% 0.46/0.69  SPASS beiseite: Proof found.
% 0.46/0.69  % SZS status Theorem
% 0.46/0.69  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.46/0.69  SPASS derived 242 clauses, backtracked 0 clauses, performed 0 splits and kept 274 clauses.
% 0.46/0.69  SPASS allocated 87718 KBytes.
% 0.46/0.69  SPASS spent	0:00:00.33 on the problem.
% 0.46/0.69  		0:00:00.04 for the input.
% 0.46/0.69  		0:00:00.22 for the FLOTTER CNF translation.
% 0.46/0.69  		0:00:00.00 for inferences.
% 0.46/0.69  		0:00:00.00 for the backtracking.
% 0.46/0.69  		0:00:00.04 for the reduction.
% 0.46/0.69  
% 0.46/0.69  
% 0.46/0.69  Here is a proof with depth 3, length 10 :
% 0.46/0.69  % SZS output start Refutation
% See solution above
% 0.46/0.69  Formulae used in the proof : isa_tac_thm tac thm isa
% 0.46/0.69  
%------------------------------------------------------------------------------