↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n019.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:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ m2(d),
    file('SYN134-1.p',unknown),
    [] ).

cnf(2,axiom,
    s0(d),
    file('SYN134-1.p',unknown),
    [] ).

cnf(8,axiom,
    n0(d,b),
    file('SYN134-1.p',unknown),
    [] ).

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

cnf(174,axiom,
    ( ~ s0(u)
    | ~ l1(v,w)
    | m2(u) ),
    file('SYN134-1.p',unknown),
    [] ).

cnf(419,plain,
    ( ~ s0(d)
    | ~ l1(u,v) ),
    inference(res,[status(thm),theory(equality)],[174,1]),
    [iquote('0:Res:174.2,1.0')] ).

cnf(420,plain,
    ~ l1(u,v),
    inference(mrr,[status(thm)],[419,2]),
    [iquote('0:MRR:419.0,2.0')] ).

cnf(421,plain,
    ~ n0(u,v),
    inference(mrr,[status(thm)],[41,420]),
    [iquote('0:MRR:41.1,420.0')] ).

cnf(423,plain,
    $false,
    inference(unc,[status(thm)],[421,8]),
    [iquote('0:UnC:421.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN134-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 21:55:38 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.19/0.47  
% 0.19/0.47  SPASS V 3.9 
% 0.19/0.47  SPASS beiseite: Proof found.
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.47  SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 335 clauses.
% 0.19/0.47  SPASS allocated 76098 KBytes.
% 0.19/0.47  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.47  		0:00:00.05 for the input.
% 0.19/0.47  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.47  		0:00:00.00 for inferences.
% 0.19/0.47  		0:00:00.00 for the backtracking.
% 0.19/0.47  		0:00:00.03 for the reduction.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Here is a proof with depth 1, length 9 :
% 0.19/0.47  % SZS output start Refutation
% See solution above
% 0.19/0.47  Formulae used in the proof : prove_this axiom_1 axiom_7 rule_002 rule_135
% 0.19/0.47  
%------------------------------------------------------------------------------