↑ Up

PyRes---1.5.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : NUM228-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n024.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  : 300s
% DateTime : Thu May  9 17:35:21 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_corollary_1,negated_conjecture,
    ~ function(z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1) ).

cnf(prove_corollary_2,negated_conjecture,
    recursion_equation_functions(z) != null_class,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2) ).

cnf(recursion_equation_functions1,axiom,
    ( ~ member(X56,recursion_equation_functions(X55))
    | function(X55) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',recursion_equation_functions1) ).

cnf(regularity1,axiom,
    ( X138 = null_class
    | member(regular(X138),X138) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).

cnf(c208,plain,
    ( recursion_equation_functions(X139) = null_class
    | function(X139) ),
    inference(resolution,[status(thm)],[regularity1,recursion_equation_functions1]) ).

cnf(c222,plain,
    function(z),
    inference(resolution,[status(thm)],[c208,prove_corollary_2]) ).

cnf(c230,plain,
    $false,
    inference(resolution,[status(thm)],[c222,prove_corollary_1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM228-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n024.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.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Wed May  8 16:52:23 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.50/0.71  % Version:  1.5
% 0.50/0.71  % SZS status Unsatisfiable
% 0.50/0.71  % SZS output start CNFRefutation
% See solution above
% 0.50/0.71  
% 0.50/0.71  % Initial clauses    : 223
% 0.50/0.71  % Processed clauses  : 81
% 0.50/0.71  % Factors computed   : 3
% 0.50/0.71  % Resolvents computed: 168
% 0.50/0.71  % Tautologies deleted: 5
% 0.50/0.71  % Forward subsumed   : 19
% 0.50/0.71  % Backward subsumed  : 0
% 0.50/0.71  % -------- CPU Time ---------
% 0.50/0.71  % User time          : 0.363 s
% 0.50/0.71  % System time        : 0.011 s
% 0.50/0.71  % Total time         : 0.374 s
%------------------------------------------------------------------------------