↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN009-3 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n007.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:17:14 EDT 2022

% Result   : Unsatisfiable 0.19s 0.41s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   17 (   8 unt;   5 nHn;  17 RR)
%            Number of literals    :   35 (   0 equ;  19 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ t(u,v,w)
    | ~ p(u,v,w) ),
    file('SYN009-3.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ t(u,v,w)
    | ~ q(u,v,w) ),
    file('SYN009-3.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ t(u,v,w)
    | ~ r(u,v,w) ),
    file('SYN009-3.p',unknown),
    [] ).

cnf(6,axiom,
    s(c),
    file('SYN009-3.p',unknown),
    [] ).

cnf(7,axiom,
    ~ v__dfg(u,v,w),
    file('SYN009-3.p',unknown),
    [] ).

cnf(8,axiom,
    u__dfg(c,c,c),
    file('SYN009-3.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ s(u)
    | ~ s(v)
    | ~ s(w)
    | r(w,v,u)
    | q(w,v,u)
    | p(w,v,u) ),
    file('SYN009-3.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ u__dfg(u,v,w)
    | t(u,v,w)
    | v__dfg(u,v,w) ),
    file('SYN009-3.p',unknown),
    [] ).

cnf(11,plain,
    ( ~ u__dfg(u,v,w)
    | t(u,v,w) ),
    inference(mrr,[status(thm)],[10,7]),
    [iquote('0:MRR:10.2,7.0')] ).

cnf(15,plain,
    t(c,c,c),
    inference(res,[status(thm),theory(equality)],[8,11]),
    [iquote('0:Res:8.0,11.0')] ).

cnf(16,plain,
    ~ r(c,c,c),
    inference(res,[status(thm),theory(equality)],[15,3]),
    [iquote('0:Res:15.0,3.0')] ).

cnf(17,plain,
    ~ q(c,c,c),
    inference(res,[status(thm),theory(equality)],[15,2]),
    [iquote('0:Res:15.0,2.0')] ).

cnf(18,plain,
    ~ p(c,c,c),
    inference(res,[status(thm),theory(equality)],[15,1]),
    [iquote('0:Res:15.0,1.0')] ).

cnf(19,plain,
    ( ~ s(c)
    | ~ s(c)
    | ~ s(c)
    | r(c,c,c)
    | q(c,c,c) ),
    inference(res,[status(thm),theory(equality)],[9,18]),
    [iquote('0:Res:9.5,18.0')] ).

cnf(20,plain,
    ( ~ s(c)
    | r(c,c,c)
    | q(c,c,c) ),
    inference(obv,[status(thm),theory(equality)],[19]),
    [iquote('0:Obv:19.1')] ).

cnf(21,plain,
    ( r(c,c,c)
    | q(c,c,c) ),
    inference(ssi,[status(thm)],[20,6]),
    [iquote('0:SSi:20.0,6.0')] ).

cnf(22,plain,
    $false,
    inference(mrr,[status(thm)],[21,16,17]),
    [iquote('0:MRR:21.0,21.1,16.0,17.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN009-3 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n007.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 19:57:33 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.41  
% 0.19/0.41  SPASS V 3.9 
% 0.19/0.41  SPASS beiseite: Proof found.
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.41  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 15 clauses.
% 0.19/0.41  SPASS allocated 75594 KBytes.
% 0.19/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.19/0.41  		0:00:00.04 for the input.
% 0.19/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41  		0:00:00.00 for inferences.
% 0.19/0.41  		0:00:00.00 for the backtracking.
% 0.19/0.41  		0:00:00.00 for the reduction.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Here is a proof with depth 3, length 17 :
% 0.19/0.41  % SZS output start Refutation
% See solution above
% 0.19/0.41  Formulae used in the proof : clause_1 clause_2 clause_3 clause_6 clause_7 clause_8 clause_9 clause_10
% 0.19/0.41  
%------------------------------------------------------------------------------