↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n006.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:46 EDT 2022

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   23
% Syntax   : Number of clauses     :   45 (  26 unt;   0 nHn;  45 RR)
%            Number of literals    :   71 (   0 equ;  30 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   21 (  20 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   9 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ k2(b,c),
    file('SYN109-1.p',unknown),
    [] ).

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

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

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

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

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

cnf(25,axiom,
    l0(c),
    file('SYN109-1.p',unknown),
    [] ).

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

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

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

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

cnf(68,axiom,
    ( ~ s0(u)
    | ~ p0(u,v)
    | m1(u,v,u) ),
    file('SYN109-1.p',unknown),
    [] ).

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

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

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

cnf(166,axiom,
    ( ~ k1(u)
    | ~ k2(u,v)
    | ~ m1(w,v,x)
    | k2(x,v) ),
    file('SYN109-1.p',unknown),
    [] ).

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

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

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

cnf(225,axiom,
    ( ~ l1(u,v)
    | q2(v,v,u) ),
    file('SYN109-1.p',unknown),
    [] ).

cnf(228,axiom,
    ( ~ s1(b)
    | ~ q2(b,u,b)
    | s2(u) ),
    file('SYN109-1.p',unknown),
    [] ).

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

cnf(338,axiom,
    ( ~ l1(u,v)
    | ~ p3(w,v,x)
    | s4(u) ),
    file('SYN109-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(419,plain,
    ( ~ k1(u)
    | ~ k2(u,c)
    | ~ m1(v,c,b) ),
    inference(res,[status(thm),theory(equality)],[166,1]),
    [iquote('0:Res:166.3,1.0')] ).

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

cnf(455,plain,
    ( ~ q2(b,u,b)
    | s2(u) ),
    inference(mrr,[status(thm)],[228,454]),
    [iquote('0:MRR:228.0,454.0')] ).

cnf(458,plain,
    k1(c),
    inference(res,[status(thm),theory(equality)],[27,40]),
    [iquote('0:Res:27.0,40.0')] ).

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

cnf(468,plain,
    m2(b),
    inference(mrr,[status(thm)],[175,460]),
    [iquote('0:MRR:175.0,460.0')] ).

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

cnf(475,plain,
    l1(b,b),
    inference(res,[status(thm),theory(equality)],[16,41]),
    [iquote('0:Res:16.0,41.0')] ).

cnf(501,plain,
    q2(b,b,b),
    inference(res,[status(thm),theory(equality)],[475,225]),
    [iquote('0:Res:475.0,225.0')] ).

cnf(503,plain,
    s2(b),
    inference(res,[status(thm),theory(equality)],[501,455]),
    [iquote('0:Res:501.0,455.0')] ).

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

cnf(546,plain,
    n2(u),
    inference(res,[status(thm),theory(equality)],[541,176]),
    [iquote('0:Res:541.0,176.0')] ).

cnf(548,plain,
    p3(u,u,u),
    inference(mrr,[status(thm)],[283,546]),
    [iquote('0:MRR:283.0,546.0')] ).

cnf(577,plain,
    k2(u,u),
    inference(res,[status(thm),theory(equality)],[403,168]),
    [iquote('0:Res:403.0,168.0')] ).

cnf(707,plain,
    ( ~ s0(b)
    | m1(b,u,b) ),
    inference(res,[status(thm),theory(equality)],[15,68]),
    [iquote('0:Res:15.0,68.1')] ).

cnf(708,plain,
    m1(b,u,b),
    inference(ssi,[status(thm)],[707,6,33,10,468,460,503]),
    [iquote('0:SSi:707.0,6.0,33.0,10.0,468.0,460.0,503.0')] ).

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

cnf(734,plain,
    s4(c),
    inference(res,[status(thm),theory(equality)],[473,733]),
    [iquote('0:Res:473.0,733.0')] ).

cnf(761,plain,
    ( ~ k1(u)
    | ~ k2(u,c) ),
    inference(res,[status(thm),theory(equality)],[708,419]),
    [iquote('0:Res:708.0,419.2')] ).

cnf(771,plain,
    ~ k1(c),
    inference(res,[status(thm),theory(equality)],[577,761]),
    [iquote('0:Res:577.0,761.1')] ).

cnf(772,plain,
    $false,
    inference(ssi,[status(thm)],[771,25,458,734]),
    [iquote('0:SSi:771.0,25.0,458.0,734.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SYN109-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n006.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.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 23:17:35 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.49  
% 0.19/0.49  SPASS V 3.9 
% 0.19/0.49  SPASS beiseite: Proof found.
% 0.19/0.49  % SZS status Theorem
% 0.19/0.49  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.49  SPASS derived 306 clauses, backtracked 0 clauses, performed 0 splits and kept 511 clauses.
% 0.19/0.49  SPASS allocated 76240 KBytes.
% 0.19/0.49  SPASS spent	0:00:00.14 on the problem.
% 0.19/0.49  		0:00:00.04 for the input.
% 0.19/0.49  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.49  		0:00:00.00 for inferences.
% 0.19/0.49  		0:00:00.00 for the backtracking.
% 0.19/0.49  		0:00:00.05 for the reduction.
% 0.19/0.49  
% 0.19/0.49  
% 0.19/0.49  Here is a proof with depth 3, length 45 :
% 0.19/0.49  % SZS output start Refutation
% See solution above
% 0.19/0.49  Formulae used in the proof : prove_this axiom_5 axiom_9 axiom_14 axiom_15 axiom_19 axiom_24 axiom_26 axiom_32 rule_001 rule_002 rule_029 rule_085 rule_107 rule_125 rule_127 rule_129 rule_136 rule_137 rule_186 rule_189 rule_244 rule_299
% 0.19/0.49  
%------------------------------------------------------------------------------