↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN194-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.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:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ r5(c,c),
    file('SYN194-1.p',unknown),
    [] ).

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

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

cnf(27,axiom,
    n0(d,c),
    file('SYN194-1.p',unknown),
    [] ).

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

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

cnf(41,axiom,
    ( ~ n0(u,v)
    | l1(v,v) ),
    file('SYN194-1.p',unknown),
    [] ).

cnf(124,axiom,
    ( ~ p0(u,v)
    | p1(v,v,v) ),
    file('SYN194-1.p',unknown),
    [] ).

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

cnf(213,axiom,
    ( ~ n2(u)
    | ~ k1(e)
    | p2(u,u,u) ),
    file('SYN194-1.p',unknown),
    [] ).

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

cnf(283,axiom,
    ( ~ n2(u)
    | p3(u,u,u) ),
    file('SYN194-1.p',unknown),
    [] ).

cnf(338,axiom,
    ( ~ l1(u,v)
    | ~ p3(w,v,x)
    | s4(u) ),
    file('SYN194-1.p',unknown),
    [] ).

cnf(366,axiom,
    ( ~ s4(u)
    | ~ n3(v)
    | ~ k0(b)
    | r5(u,v) ),
    file('SYN194-1.p',unknown),
    [] ).

cnf(386,plain,
    ( ~ n3(u)
    | ~ s4(v)
    | r5(v,u) ),
    inference(mrr,[status(thm)],[366,33]),
    [iquote('0:MRR:366.2,33.0')] ).

cnf(420,plain,
    ( ~ n3(c)
    | ~ s4(c) ),
    inference(res,[status(thm),theory(equality)],[386,1]),
    [iquote('0:Res:386.2,1.0')] ).

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

cnf(469,plain,
    ( ~ n2(u)
    | p2(u,u,u) ),
    inference(mrr,[status(thm)],[213,461]),
    [iquote('0:MRR:213.1,461.0')] ).

cnf(475,plain,
    l1(c,c),
    inference(res,[status(thm),theory(equality)],[27,41]),
    [iquote('0:Res:27.0,41.0')] ).

cnf(493,plain,
    ( ~ n2(u)
    | n3(u) ),
    inference(res,[status(thm),theory(equality)],[469,279]),
    [iquote('0:Res:469.1,279.0')] ).

cnf(543,plain,
    p1(u,u,u),
    inference(res,[status(thm),theory(equality)],[15,124]),
    [iquote('0:Res:15.0,124.0')] ).

cnf(547,plain,
    n2(u),
    inference(res,[status(thm),theory(equality)],[543,176]),
    [iquote('0:Res:543.0,176.0')] ).

cnf(549,plain,
    p3(u,u,u),
    inference(mrr,[status(thm)],[283,547]),
    [iquote('0:MRR:283.0,547.0')] ).

cnf(554,plain,
    n3(u),
    inference(mrr,[status(thm)],[493,547]),
    [iquote('0:MRR:493.0,547.0')] ).

cnf(561,plain,
    ~ s4(c),
    inference(mrr,[status(thm)],[420,554]),
    [iquote('0:MRR:420.0,554.0')] ).

cnf(737,plain,
    ( ~ l1(u,v)
    | s4(u) ),
    inference(res,[status(thm),theory(equality)],[549,338]),
    [iquote('0:Res:549.0,338.1')] ).

cnf(738,plain,
    s4(c),
    inference(res,[status(thm),theory(equality)],[475,737]),
    [iquote('0:Res:475.0,737.0')] ).

cnf(743,plain,
    $false,
    inference(mrr,[status(thm)],[738,561]),
    [iquote('0:MRR:738.0,561.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN194-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n023.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul 11 23:03:24 EDT 2022
% 0.14/0.34  % 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 284 clauses, backtracked 0 clauses, performed 0 splits and kept 499 clauses.
% 0.20/0.48  SPASS allocated 76222 KBytes.
% 0.20/0.48  SPASS spent	0:00:00.12 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.04 for the reduction.
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Here is a proof with depth 2, length 28 :
% 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_14 axiom_26 axiom_32 rule_001 rule_002 rule_085 rule_137 rule_174 rule_240 rule_244 rule_299 rule_327
% 0.20/0.48  
%------------------------------------------------------------------------------