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

View Problem - Process Solution

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

% Computer : n016.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.46s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   7 unt;   0 nHn;  11 RR)
%            Number of literals    :   17 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 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,d,v),
    file('SYN169-1.p',unknown),
    [] ).

cnf(18,axiom,
    q0(u,d),
    file('SYN169-1.p',unknown),
    [] ).

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

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

cnf(168,axiom,
    ( ~ q1(u,v,v)
    | k2(v,v) ),
    file('SYN169-1.p',unknown),
    [] ).

cnf(291,axiom,
    ( ~ q0(u,v)
    | ~ k2(w,w)
    | p3(v,v,v) ),
    file('SYN169-1.p',unknown),
    [] ).

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(425,plain,
    ( ~ q0(u,d)
    | ~ k2(v,v) ),
    inference(res,[status(thm),theory(equality)],[291,1]),
    [iquote('0:Res:291.2,1.0')] ).

cnf(430,plain,
    ~ k2(u,u),
    inference(mrr,[status(thm)],[425,18]),
    [iquote('0:MRR:425.0,18.0')] ).

cnf(432,plain,
    ~ q1(u,v,v),
    inference(mrr,[status(thm)],[168,430]),
    [iquote('0:MRR:168.1,430.0')] ).

cnf(434,plain,
    $false,
    inference(unc,[status(thm)],[432,403]),
    [iquote('0:UnC:432.0,403.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SYN169-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n016.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 : Tue Jul 12 09:08:59 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.46  
% 0.18/0.46  SPASS V 3.9 
% 0.18/0.46  SPASS beiseite: Proof found.
% 0.18/0.46  % SZS status Theorem
% 0.18/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.46  SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 342 clauses.
% 0.18/0.46  SPASS allocated 76105 KBytes.
% 0.18/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.18/0.46  		0:00:00.04 for the input.
% 0.18/0.46  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.46  		0:00:00.00 for inferences.
% 0.18/0.46  		0:00:00.00 for the backtracking.
% 0.18/0.46  		0:00:00.02 for the reduction.
% 0.18/0.46  
% 0.18/0.46  
% 0.18/0.46  Here is a proof with depth 1, length 11 :
% 0.18/0.46  % SZS output start Refutation
% See solution above
% 0.18/0.46  Formulae used in the proof : prove_this axiom_17 axiom_19 rule_107 rule_129 rule_252
% 0.18/0.46  
%------------------------------------------------------------------------------