↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n026.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 : Mon Jul 18 14:28:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(65,axiom,
    equal(sdtlpdtrp0(xd,xn),szDzizrdt0(xd)),
    file('NUM632+1.p',unknown),
    [] ).

cnf(67,axiom,
    ~ equal(sdtlpdtrp0(xc,xQ),szDzizrdt0(xd)),
    file('NUM632+1.p',unknown),
    [] ).

cnf(73,axiom,
    equal(sdtlpdtrp0(xd,xn),sdtlpdtrp0(xc,xQ)),
    file('NUM632+1.p',unknown),
    [] ).

cnf(217,plain,
    equal(sdtlpdtrp0(xc,xQ),szDzizrdt0(xd)),
    inference(rew,[status(thm),theory(equality)],[65,73]),
    [iquote('0:Rew:65.0,73.0')] ).

cnf(218,plain,
    ~ equal(szDzizrdt0(xd),szDzizrdt0(xd)),
    inference(rew,[status(thm),theory(equality)],[217,67]),
    [iquote('0:Rew:217.0,67.0')] ).

cnf(219,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[218]),
    [iquote('0:Obv:218.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM632+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n026.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 : Thu Jul  7 17:03:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.56/0.74  
% 0.56/0.74  SPASS V 3.9 
% 0.56/0.74  SPASS beiseite: Proof found.
% 0.56/0.74  % SZS status Theorem
% 0.56/0.74  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.56/0.74  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 71 clauses.
% 0.56/0.74  SPASS allocated 101156 KBytes.
% 0.56/0.74  SPASS spent	0:00:00.39 on the problem.
% 0.56/0.74  		0:00:00.04 for the input.
% 0.56/0.74  		0:00:00.32 for the FLOTTER CNF translation.
% 0.56/0.74  		0:00:00.00 for inferences.
% 0.56/0.74  		0:00:00.00 for the backtracking.
% 0.56/0.74  		0:00:00.00 for the reduction.
% 0.56/0.74  
% 0.56/0.74  
% 0.56/0.74  Here is a proof with depth 0, length 6 :
% 0.56/0.74  % SZS output start Refutation
% See solution above
% 0.56/0.74  Formulae used in the proof : m__5321 m__ m__5568
% 0.56/0.74  
%------------------------------------------------------------------------------