↑ Up

PyRes---1.5.UNS-Ref.s

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

% Computer : n022.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:39:14 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_unique_1st_in_pair_of_non_sets,negated_conjecture,
    first(x) != x,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_in_pair_of_non_sets) ).

cnf(existence_of_1st_and_2nd_4,axiom,
    ( ordered_pair(first(X672),second(X672)) = X672
    | first(X672) = X672 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_4) ).

cnf(prove_unique_1st_and_2nd_in_pair_of_non_sets3_1,negated_conjecture,
    ordered_pair(first(x),second(x)) != x,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets3_1) ).

cnf(c4634,plain,
    first(x) = x,
    inference(resolution,[status(thm)],[prove_unique_1st_and_2nd_in_pair_of_non_sets3_1,existence_of_1st_and_2nd_4]) ).

cnf(c4679,plain,
    $false,
    inference(resolution,[status(thm)],[c4634,prove_unique_1st_in_pair_of_non_sets]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : SET115-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.09/0.15  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36  % Computer : n022.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Wed May  8 18:45:53 EDT 2024
% 0.15/0.37  % CPUTime  : 
% 1.89/2.06  % Version:  1.5
% 1.89/2.06  % SZS status Unsatisfiable
% 1.89/2.06  % SZS output start CNFRefutation
% See solution above
% 1.89/2.06  
% 1.89/2.06  % Initial clauses    : 205
% 1.89/2.06  % Processed clauses  : 413
% 1.89/2.06  % Factors computed   : 12
% 1.89/2.06  % Resolvents computed: 4635
% 1.89/2.06  % Tautologies deleted: 12
% 1.89/2.06  % Forward subsumed   : 237
% 1.89/2.06  % Backward subsumed  : 5
% 1.89/2.06  % -------- CPU Time ---------
% 1.89/2.06  % User time          : 1.668 s
% 1.89/2.06  % System time        : 0.023 s
% 1.89/2.06  % Total time         : 1.691 s
%------------------------------------------------------------------------------