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

View Problem - Process Solution

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

% Computer : n019.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:10 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ p3(u,v,b),
    file('SYN168-1.p',unknown),
    [] ).

cnf(6,axiom,
    s0(b),
    file('SYN168-1.p',unknown),
    [] ).

cnf(10,axiom,
    r0(b),
    file('SYN168-1.p',unknown),
    [] ).

cnf(15,axiom,
    p0(b,u),
    file('SYN168-1.p',unknown),
    [] ).

cnf(16,axiom,
    n0(a,b),
    file('SYN168-1.p',unknown),
    [] ).

cnf(33,axiom,
    k0(b),
    file('SYN168-1.p',unknown),
    [] ).

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

cnf(164,axiom,
    ( ~ p0(u,u)
    | s1(u) ),
    file('SYN168-1.p',unknown),
    [] ).

cnf(175,axiom,
    ( ~ k1(b)
    | m2(b) ),
    file('SYN168-1.p',unknown),
    [] ).

cnf(198,axiom,
    ( ~ k1(u)
    | p2(u,u,u) ),
    file('SYN168-1.p',unknown),
    [] ).

cnf(279,axiom,
    ( ~ p2(u,v,w)
    | n3(w) ),
    file('SYN168-1.p',unknown),
    [] ).

cnf(287,axiom,
    ( ~ n3(u)
    | ~ p2(v,u,u)
    | p3(u,u,u) ),
    file('SYN168-1.p',unknown),
    [] ).

cnf(388,plain,
    ( ~ p2(u,v,v)
    | p3(v,v,v) ),
    inference(mrr,[status(thm)],[287,279]),
    [iquote('0:MRR:287.0,279.1')] ).

cnf(425,plain,
    ~ p2(u,b,b),
    inference(res,[status(thm),theory(equality)],[388,1]),
    [iquote('0:Res:388.1,1.0')] ).

cnf(465,plain,
    s1(b),
    inference(res,[status(thm),theory(equality)],[15,164]),
    [iquote('0:Res:15.0,164.0')] ).

cnf(471,plain,
    k1(b),
    inference(res,[status(thm),theory(equality)],[16,40]),
    [iquote('0:Res:16.0,40.0')] ).

cnf(479,plain,
    m2(b),
    inference(mrr,[status(thm)],[175,471]),
    [iquote('0:MRR:175.0,471.0')] ).

cnf(484,plain,
    ~ k1(b),
    inference(res,[status(thm),theory(equality)],[198,425]),
    [iquote('0:Res:198.1,425.0')] ).

cnf(485,plain,
    $false,
    inference(ssi,[status(thm)],[484,6,33,10,465,479,471]),
    [iquote('0:SSi:484.0,6.0,33.0,10.0,465.0,479.0,471.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN168-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n019.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 21:56:23 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  
% 0.18/0.45  SPASS V 3.9 
% 0.18/0.45  SPASS beiseite: Proof found.
% 0.18/0.45  % SZS status Theorem
% 0.18/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.45  SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 361 clauses.
% 0.18/0.45  SPASS allocated 76119 KBytes.
% 0.18/0.45  SPASS spent	0:00:00.11 on the problem.
% 0.18/0.45  		0:00:00.04 for the input.
% 0.18/0.45  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.45  		0:00:00.00 for inferences.
% 0.18/0.45  		0:00:00.00 for the backtracking.
% 0.18/0.45  		0:00:00.03 for the reduction.
% 0.18/0.45  
% 0.18/0.45  
% 0.18/0.45  Here is a proof with depth 2, length 19 :
% 0.18/0.45  % SZS output start Refutation
% See solution above
% 0.18/0.45  Formulae used in the proof : prove_this axiom_5 axiom_9 axiom_14 axiom_15 axiom_32 rule_001 rule_125 rule_136 rule_159 rule_240 rule_248
% 0.18/0.45  
%------------------------------------------------------------------------------