↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n003.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:49 EDT 2022

% Result   : Unsatisfiable 0.18s 0.47s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   30 (  17 unt;   0 nHn;  30 RR)
%            Number of literals    :   45 (   0 equ;  19 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   16 (  15 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,
    ~ k5(b),
    file('SYN116-1.p',unknown),
    [] ).

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

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

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

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

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

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

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

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

cnf(96,axiom,
    ( ~ r0(u)
    | n1(u,u,u) ),
    file('SYN116-1.p',unknown),
    [] ).

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

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

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

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

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

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

cnf(340,axiom,
    ( ~ s4(e)
    | ~ n1(b,b,b)
    | k5(b) ),
    file('SYN116-1.p',unknown),
    [] ).

cnf(378,plain,
    ( ~ s4(e)
    | ~ n1(b,b,b) ),
    inference(mrr,[status(thm)],[340,1]),
    [iquote('0:MRR:340.2,1.0')] ).

cnf(454,plain,
    s1(b),
    inference(res,[status(thm),theory(equality)],[15,164]),
    [iquote('0:Res:15.0,164.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(474,plain,
    l1(e,e),
    inference(res,[status(thm),theory(equality)],[4,41]),
    [iquote('0:Res:4.0,41.0')] ).

cnf(492,plain,
    ( ~ r0(b)
    | ~ s4(e) ),
    inference(res,[status(thm),theory(equality)],[96,378]),
    [iquote('0:Res:96.1,378.1')] ).

cnf(494,plain,
    ~ s4(e),
    inference(ssi,[status(thm)],[492,6,33,10,454,468,460]),
    [iquote('0:SSi:492.0,6.0,33.0,10.0,454.0,468.0,460.0')] ).

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

cnf(548,plain,
    n2(u),
    inference(res,[status(thm),theory(equality)],[544,176]),
    [iquote('0:Res:544.0,176.0')] ).

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

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

cnf(737,plain,
    s4(e),
    inference(res,[status(thm),theory(equality)],[474,733]),
    [iquote('0:Res:474.0,733.0')] ).

cnf(739,plain,
    $false,
    inference(mrr,[status(thm)],[737,494]),
    [iquote('0:MRR:737.0,494.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYN116-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n003.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 17:21:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.47  
% 0.18/0.47  SPASS V 3.9 
% 0.18/0.47  SPASS beiseite: Proof found.
% 0.18/0.47  % SZS status Theorem
% 0.18/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.47  SPASS derived 277 clauses, backtracked 0 clauses, performed 0 splits and kept 493 clauses.
% 0.18/0.47  SPASS allocated 76219 KBytes.
% 0.18/0.47  SPASS spent	0:00:00.13 on the problem.
% 0.18/0.47  		0:00:00.05 for the input.
% 0.18/0.47  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.47  		0:00:00.00 for inferences.
% 0.18/0.47  		0:00:00.00 for the backtracking.
% 0.18/0.47  		0:00:00.04 for the reduction.
% 0.18/0.47  
% 0.18/0.47  
% 0.18/0.47  Here is a proof with depth 2, length 30 :
% 0.18/0.47  % SZS output start Refutation
% See solution above
% 0.18/0.47  Formulae used in the proof : prove_this axiom_3 axiom_5 axiom_9 axiom_14 axiom_15 axiom_32 rule_001 rule_002 rule_057 rule_085 rule_125 rule_136 rule_137 rule_244 rule_299 rule_301
% 0.18/0.47  
%------------------------------------------------------------------------------