↑ Up

PyRes---1.5.UNS-Ref.s

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

% Computer : n018.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:00 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(divide_self,axiom,
    divides(X2,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_self) ).

cnf(prove_a_has_prime_divisor,negated_conjecture,
    ( ~ prime(X3)
    | ~ divides(X3,a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_prime_divisor) ).

cnf(c0,plain,
    ~ prime(a),
    inference(resolution,[status(thm)],[prove_a_has_prime_divisor,divide_self]) ).

cnf(divisor1,axiom,
    ( prime(X12)
    | less(n1,divisor(X12)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor1) ).

cnf(c12,plain,
    less(n1,divisor(a)),
    inference(resolution,[status(thm)],[divisor1,c0]) ).

cnf(divisor2,axiom,
    ( prime(X11)
    | less(divisor(X11),X11) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor2) ).

cnf(c10,plain,
    less(divisor(a),a),
    inference(resolution,[status(thm)],[divisor2,c0]) ).

cnf(factor1,axiom,
    ( ~ less(n1,X14)
    | ~ less(X14,a)
    | prime(factor_of(X14)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor1) ).

cnf(c17,plain,
    ( ~ less(n1,divisor(a))
    | prime(factor_of(divisor(a))) ),
    inference(resolution,[status(thm)],[factor1,c10]) ).

cnf(c33,plain,
    prime(factor_of(divisor(a))),
    inference(resolution,[status(thm)],[c17,c12]) ).

cnf(transitive_divide,axiom,
    ( ~ divides(X5,X6)
    | ~ divides(X6,X7)
    | divides(X5,X7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_divide) ).

cnf(prime,axiom,
    ( prime(X4)
    | divides(divisor(X4),X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime) ).

cnf(c1,plain,
    divides(divisor(a),a),
    inference(resolution,[status(thm)],[prime,c0]) ).

cnf(c6,plain,
    ( ~ divides(X13,divisor(a))
    | divides(X13,a) ),
    inference(resolution,[status(thm)],[c1,transitive_divide]) ).

cnf(factor2,axiom,
    ( ~ less(n1,X15)
    | ~ less(X15,a)
    | divides(factor_of(X15),X15) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor2) ).

cnf(c27,plain,
    ( ~ less(n1,divisor(a))
    | divides(factor_of(divisor(a)),divisor(a)) ),
    inference(resolution,[status(thm)],[factor2,c10]) ).

cnf(c51,plain,
    divides(factor_of(divisor(a)),divisor(a)),
    inference(resolution,[status(thm)],[c27,c12]) ).

cnf(c53,plain,
    divides(factor_of(divisor(a)),a),
    inference(resolution,[status(thm)],[c51,c6]) ).

cnf(c56,plain,
    ~ prime(factor_of(divisor(a))),
    inference(resolution,[status(thm)],[c53,prove_a_has_prime_divisor]) ).

cnf(c61,plain,
    $false,
    inference(resolution,[status(thm)],[c56,c33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : NUM015-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35  % Computer : n018.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 16:29:53 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.20/0.55  % Version:  1.5
% 0.20/0.55  % SZS status Unsatisfiable
% 0.20/0.55  % SZS output start CNFRefutation
% See solution above
% 0.20/0.55  
% 0.20/0.55  % Initial clauses    : 9
% 0.20/0.55  % Processed clauses  : 39
% 0.20/0.55  % Factors computed   : 1
% 0.20/0.55  % Resolvents computed: 61
% 0.20/0.55  % Tautologies deleted: 2
% 0.20/0.55  % Forward subsumed   : 10
% 0.20/0.55  % Backward subsumed  : 3
% 0.20/0.55  % -------- CPU Time ---------
% 0.20/0.55  % User time          : 0.175 s
% 0.20/0.55  % System time        : 0.015 s
% 0.20/0.55  % Total time         : 0.190 s
%------------------------------------------------------------------------------