TSTP Solution File: SYN286-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN286-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n022.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 : Thu Jul 21 12:19:59 EDT 2022

% Result   : Unsatisfiable 0.20s 0.48s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   19 (  12 unt;   0 nHn;  19 RR)
%            Number of literals    :   31 (   0 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ q1(a,e,u),
    file('SYN286-1.p',unknown),
    [] ).

cnf(4,axiom,
    n0(d,e),
    file('SYN286-1.p',unknown),
    [] ).

cnf(14,axiom,
    r0(e),
    file('SYN286-1.p',unknown),
    [] ).

cnf(20,axiom,
    m0(u,d,v),
    file('SYN286-1.p',unknown),
    [] ).

cnf(21,axiom,
    l0(a),
    file('SYN286-1.p',unknown),
    [] ).

cnf(29,axiom,
    k0(e),
    file('SYN286-1.p',unknown),
    [] ).

cnf(40,axiom,
    ( ~ n0(u,v)
    | k1(v) ),
    file('SYN286-1.p',unknown),
    [] ).

cnf(129,axiom,
    ( ~ r0(e)
    | ~ k0(e)
    | p1(e,e,e) ),
    file('SYN286-1.p',unknown),
    [] ).

cnf(138,axiom,
    ( ~ l0(u)
    | ~ k0(v)
    | ~ q1(w,w,v)
    | q1(u,w,w) ),
    file('SYN286-1.p',unknown),
    [] ).

cnf(146,axiom,
    ( ~ m0(u,d,u)
    | ~ m0(e,d,u)
    | q1(e,u,u) ),
    file('SYN286-1.p',unknown),
    [] ).

cnf(176,axiom,
    ( ~ p1(u,v,w)
    | n2(w) ),
    file('SYN286-1.p',unknown),
    [] ).

cnf(382,plain,
    p1(e,e,e),
    inference(mrr,[status(thm)],[129,14,29]),
    [iquote('0:MRR:129.0,129.1,14.0,29.0')] ).

cnf(403,plain,
    q1(e,u,u),
    inference(mrr,[status(thm)],[146,20]),
    [iquote('0:MRR:146.0,146.1,20.0,20.0')] ).

cnf(421,plain,
    ( ~ k0(u)
    | ~ l0(a)
    | ~ q1(e,e,u) ),
    inference(res,[status(thm),theory(equality)],[138,1]),
    [iquote('0:Res:138.3,1.0')] ).

cnf(423,plain,
    ( ~ k0(u)
    | ~ q1(e,e,u) ),
    inference(mrr,[status(thm)],[421,21]),
    [iquote('0:MRR:421.1,21.0')] ).

cnf(464,plain,
    k1(e),
    inference(res,[status(thm),theory(equality)],[4,40]),
    [iquote('0:Res:4.0,40.0')] ).

cnf(491,plain,
    n2(e),
    inference(res,[status(thm),theory(equality)],[382,176]),
    [iquote('0:Res:382.0,176.0')] ).

cnf(497,plain,
    ~ k0(e),
    inference(res,[status(thm),theory(equality)],[403,423]),
    [iquote('0:Res:403.0,423.1')] ).

cnf(501,plain,
    $false,
    inference(ssi,[status(thm)],[497,29,14,464,491]),
    [iquote('0:SSi:497.0,29.0,14.0,464.0,491.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SYN286-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n022.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 14:00:25 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  
% 0.20/0.48  SPASS V 3.9 
% 0.20/0.48  SPASS beiseite: Proof found.
% 0.20/0.48  % SZS status Theorem
% 0.20/0.48  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.48  SPASS derived 47 clauses, backtracked 0 clauses, performed 0 splits and kept 372 clauses.
% 0.20/0.48  SPASS allocated 76130 KBytes.
% 0.20/0.48  SPASS spent	0:00:00.11 on the problem.
% 0.20/0.48  		0:00:00.04 for the input.
% 0.20/0.48  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.48  		0:00:00.00 for inferences.
% 0.20/0.48  		0:00:00.00 for the backtracking.
% 0.20/0.48  		0:00:00.03 for the reduction.
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Here is a proof with depth 2, length 19 :
% 0.20/0.48  % SZS output start Refutation
% See solution above
% 0.20/0.48  Formulae used in the proof : prove_this axiom_3 axiom_13 axiom_19 axiom_20 axiom_28 rule_001 rule_090 rule_099 rule_107 rule_137
% 0.20/0.48  
%------------------------------------------------------------------------------