↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : RNG061+2 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 20:41:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(17,axiom,
    aScalar0(xS),
    file('RNG061+2.p',unknown),
    [] ).

cnf(18,axiom,
    aScalar0(xN),
    file('RNG061+2.p',unknown),
    [] ).

cnf(37,axiom,
    ( ~ aScalar0(u)
    | aScalar0(smndt0(u)) ),
    file('RNG061+2.p',unknown),
    [] ).

cnf(61,axiom,
    ( ~ aScalar0(u)
    | ~ aScalar0(v)
    | aScalar0(sdtasdt0(v,u)) ),
    file('RNG061+2.p',unknown),
    [] ).

cnf(67,axiom,
    ( ~ aScalar0(u)
    | ~ aScalar0(v)
    | equal(sdtpldt0(v,u),sdtpldt0(u,v)) ),
    file('RNG061+2.p',unknown),
    [] ).

cnf(86,axiom,
    equal(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),
    file('RNG061+2.p',unknown),
    [] ).

cnf(88,axiom,
    ~ equal(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))),
    file('RNG061+2.p',unknown),
    [] ).

cnf(98,plain,
    ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),
    inference(rew,[status(thm),theory(equality)],[86,88]),
    [iquote('0:Rew:86.0,88.0')] ).

cnf(1651,plain,
    ( ~ aScalar0(sdtasdt0(xS,xS))
    | ~ aScalar0(smndt0(xN))
    | ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))) ),
    inference(spl,[status(thm),theory(equality)],[67,98]),
    [iquote('0:SpL:67.2,98.0')] ).

cnf(1662,plain,
    ( ~ aScalar0(sdtasdt0(xS,xS))
    | ~ aScalar0(smndt0(xN)) ),
    inference(obv,[status(thm),theory(equality)],[1651]),
    [iquote('0:Obv:1651.2')] ).

cnf(1663,plain,
    $false,
    inference(ssi,[status(thm)],[1662,37,18,61,17]),
    [iquote('0:SSi:1662.1,1662.0,37.0,18.0,61.2,17.0,17.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : RNG061+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/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 May 30 16:38:10 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.46/0.64  
% 0.46/0.64  SPASS V 3.9 
% 0.46/0.64  SPASS beiseite: Proof found.
% 0.46/0.64  % SZS status Theorem
% 0.46/0.64  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.46/0.64  SPASS derived 886 clauses, backtracked 0 clauses, performed 0 splits and kept 438 clauses.
% 0.46/0.64  SPASS allocated 99372 KBytes.
% 0.46/0.64  SPASS spent	0:00:00.27 on the problem.
% 0.46/0.64  		0:00:00.04 for the input.
% 0.46/0.64  		0:00:00.04 for the FLOTTER CNF translation.
% 0.46/0.64  		0:00:00.01 for inferences.
% 0.46/0.64  		0:00:00.00 for the backtracking.
% 0.46/0.64  		0:00:00.16 for the reduction.
% 0.46/0.64  
% 0.46/0.64  
% 0.46/0.64  Here is a proof with depth 1, length 11 :
% 0.46/0.64  % SZS output start Refutation
% See solution above
% 0.46/0.64  Formulae used in the proof : m__1930 m__1949 mNegSc mMulSc mArith m__2180 m__
% 0.46/0.64  
%------------------------------------------------------------------------------