↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n015.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:25:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    ~ less(nn2,n2),
    file('NUM296+1.p',unknown),
    [] ).

cnf(13,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('NUM296+1.p',unknown),
    [] ).

cnf(22,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('NUM296+1.p',unknown),
    [] ).

cnf(389,axiom,
    ( ~ rdn_translate(u,rdn_neg(v))
    | ~ rdn_translate(w,rdn_pos(x))
    | less(u,w) ),
    file('NUM296+1.p',unknown),
    [] ).

cnf(411,plain,
    ( ~ rdn_translate(nn2,rdn_neg(u))
    | ~ rdn_translate(n2,rdn_pos(v)) ),
    inference(res,[status(thm),theory(equality)],[389,10]),
    [iquote('0:Res:389.2,10.0')] ).

cnf(526,plain,
    ~ rdn_translate(n2,rdn_pos(u)),
    inference(res,[status(thm),theory(equality)],[22,411]),
    [iquote('0:Res:22.0,411.0')] ).

cnf(527,plain,
    $false,
    inference(unc,[status(thm)],[526,13]),
    [iquote('0:UnC:526.0,13.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM296+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n015.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul  5 09:33:02 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.53/0.77  
% 0.53/0.77  SPASS V 3.9 
% 0.53/0.77  SPASS beiseite: Proof found.
% 0.53/0.77  % SZS status Theorem
% 0.53/0.77  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.53/0.77  SPASS derived 114 clauses, backtracked 96 clauses, performed 1 splits and kept 605 clauses.
% 0.53/0.77  SPASS allocated 98720 KBytes.
% 0.53/0.77  SPASS spent	0:00:00.41 on the problem.
% 0.53/0.77  		0:00:00.04 for the input.
% 0.53/0.77  		0:00:00.11 for the FLOTTER CNF translation.
% 0.53/0.77  		0:00:00.04 for inferences.
% 0.53/0.77  		0:00:00.00 for the backtracking.
% 0.53/0.77  		0:00:00.11 for the reduction.
% 0.53/0.77  
% 0.53/0.77  
% 0.53/0.77  Here is a proof with depth 2, length 7 :
% 0.53/0.77  % SZS output start Refutation
% See solution above
% 0.53/0.77  Formulae used in the proof : nn2_less_n2 rdn2 rdnn2 less_entry_point_neg_pos
% 0.61/0.77  
%------------------------------------------------------------------------------