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

View Problem - Process Solution

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

% Computer : n005.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:18:51 EDT 2022

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : Refutation 0.19s
% 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    :   18 (   0 equ;  11 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 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,
    ~ l2(d,d),
    file('SYN123-1.p',unknown),
    [] ).

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

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

cnf(37,axiom,
    q0(a,b),
    file('SYN123-1.p',unknown),
    [] ).

cnf(52,axiom,
    ( ~ q0(u,v)
    | m1(v,v,v) ),
    file('SYN123-1.p',unknown),
    [] ).

cnf(173,axiom,
    ( ~ p0(u,v)
    | ~ m1(w,u,u)
    | ~ m0(u,v,w)
    | l2(v,v) ),
    file('SYN123-1.p',unknown),
    [] ).

cnf(420,plain,
    ( ~ m0(u,d,v)
    | ~ m1(v,u,u)
    | ~ p0(u,d) ),
    inference(res,[status(thm),theory(equality)],[173,1]),
    [iquote('0:Res:173.3,1.0')] ).

cnf(422,plain,
    ( ~ p0(u,d)
    | ~ m1(v,u,u) ),
    inference(mrr,[status(thm)],[420,20]),
    [iquote('0:MRR:420.0,20.0')] ).

cnf(572,plain,
    m1(b,b,b),
    inference(res,[status(thm),theory(equality)],[37,52]),
    [iquote('0:Res:37.0,52.0')] ).

cnf(629,plain,
    ~ p0(b,d),
    inference(res,[status(thm),theory(equality)],[572,422]),
    [iquote('0:Res:572.0,422.1')] ).

cnf(631,plain,
    $false,
    inference(mrr,[status(thm)],[629,15]),
    [iquote('0:MRR:629.0,15.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN123-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n005.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul 12 06:14:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.48  
% 0.19/0.48  SPASS V 3.9 
% 0.19/0.48  SPASS beiseite: Proof found.
% 0.19/0.48  % SZS status Theorem
% 0.19/0.48  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.48  SPASS derived 176 clauses, backtracked 0 clauses, performed 0 splits and kept 443 clauses.
% 0.19/0.48  SPASS allocated 76174 KBytes.
% 0.19/0.48  SPASS spent	0:00:00.13 on the problem.
% 0.19/0.48  		0:00:00.04 for the input.
% 0.19/0.48  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.48  		0:00:00.00 for inferences.
% 0.19/0.48  		0:00:00.00 for the backtracking.
% 0.19/0.48  		0:00:00.04 for the reduction.
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  Here is a proof with depth 2, length 11 :
% 0.19/0.48  % SZS output start Refutation
% See solution above
% 0.19/0.48  Formulae used in the proof : prove_this axiom_14 axiom_19 axiom_36 rule_013 rule_134
% 0.19/0.48  
%------------------------------------------------------------------------------