↑ Up

PyRes---1.5.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : COL052-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n029.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:17:22 EDT 2024

% Result   : Unsatisfiable 133.53s 133.76s
% Output   : Refutation 133.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   21 (  13 unt;   0 nHn;  11 RR)
%            Number of literals    :   31 (  25 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_a_is_agreeable,negated_conjecture,
    ~ agreeable(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_is_agreeable) ).

cnf(agreeable2,axiom,
    ( response(X24,X23) != response(compatible(X24),X23)
    | agreeable(X24) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable2) ).

cnf(composer_exists,axiom,
    response(compose(X8,X6),X7) = response(X8,response(X6,X7)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).

cnf(transitivity,axiom,
    ( X16 != X14
    | X14 != X15
    | X16 = X15 ),
    theory(equality) ).

cnf(c16,plain,
    ( X66 != response(compose(X65,X64),X63)
    | X66 = response(X65,response(X64,X63)) ),
    inference(resolution,[status(thm)],[transitivity,composer_exists]) ).

cnf(symmetry,axiom,
    ( X4 != X3
    | X3 = X4 ),
    theory(equality) ).

cnf(c_composes_a_with_b,plain,
    c = compose(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_composes_a_with_b) ).

cnf(reflexivity,axiom,
    X2 = X2,
    theory(equality) ).

cnf(c0,axiom,
    ( X30 != X28
    | X29 != X31
    | response(X30,X29) = response(X28,X31) ),
    theory(equality) ).

cnf(c30,plain,
    ( X46 != X44
    | response(X46,X45) = response(X44,X45) ),
    inference(resolution,[status(thm)],[c0,reflexivity]) ).

cnf(c87,plain,
    response(c,X73) = response(compose(a,b),X73),
    inference(resolution,[status(thm)],[c30,c_composes_a_with_b]) ).

cnf(c155,plain,
    response(c,X86) = response(a,response(b,X86)),
    inference(resolution,[status(thm)],[c87,c16]) ).

cnf(c213,plain,
    response(a,response(b,X92)) = response(c,X92),
    inference(resolution,[status(thm)],[c155,symmetry]) ).

cnf(c_is_agreeable,plain,
    agreeable(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_agreeable) ).

cnf(agreeable1,axiom,
    ( ~ agreeable(X13)
    | response(X13,common_bird(X12)) = response(X12,common_bird(X12)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable1) ).

cnf(c13,plain,
    response(c,common_bird(X60)) = response(X60,common_bird(X60)),
    inference(resolution,[status(thm)],[agreeable1,c_is_agreeable]) ).

cnf(c122,plain,
    ( X149 != response(c,common_bird(X148))
    | X149 = response(X148,common_bird(X148)) ),
    inference(resolution,[status(thm)],[c13,transitivity]) ).

cnf(c726,plain,
    response(a,response(b,common_bird(X167))) = response(X167,common_bird(X167)),
    inference(resolution,[status(thm)],[c122,c213]) ).

cnf(c946,plain,
    response(a,response(b,common_bird(compose(X5667,X5668)))) = response(X5667,response(X5668,common_bird(compose(X5667,X5668)))),
    inference(resolution,[status(thm)],[c726,c16]) ).

cnf(c127128,plain,
    agreeable(a),
    inference(resolution,[status(thm)],[c946,agreeable2]) ).

cnf(c127214,plain,
    $false,
    inference(resolution,[status(thm)],[c127128,prove_a_is_agreeable]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : COL052-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed May  8 21:50:53 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 133.53/133.76  % Version:  1.5
% 133.53/133.76  % SZS status Unsatisfiable
% 133.53/133.76  % SZS output start CNFRefutation
% See solution above
% 133.53/133.76  
% 133.53/133.76  % Initial clauses    : 14
% 133.53/133.76  % Processed clauses  : 1984
% 133.53/133.76  % Factors computed   : 3
% 133.53/133.76  % Resolvents computed: 127207
% 133.53/133.76  % Tautologies deleted: 3
% 133.53/133.76  % Forward subsumed   : 1842
% 133.53/133.76  % Backward subsumed  : 3
% 133.53/133.76  % -------- CPU Time ---------
% 133.53/133.76  % User time          : 132.978 s
% 133.53/133.76  % System time        : 0.384 s
% 133.53/133.76  % Total time         : 133.362 s
%------------------------------------------------------------------------------