↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : NUM015-1 : TPTP v9.0.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n026.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 : Fri Jul 25 12:27:29 PM UTC 2025

% Result   : Unsatisfiable 0.18s 0.36s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named prove_a_has_prime_divisor)

% Comments : 
%------------------------------------------------------------------------------
cnf(8,plain,
    ( ~ divides(X0,a)
    | ~ prime(X0) ),
    inference(cnf,[status(esa)],[prove_a_has_prime_divisor]) ).

cnf(l0,plain,
    ( ~ divides(factor_of(divisor(a)),a)
    | ~ prime(factor_of(divisor(a))) ),
    inference(instantiation,[status(thm)],[8]) ).

cnf(1,plain,
    ( ~ divides(X0,X1)
    | ~ divides(X1,X2)
    | divides(X0,X2) ),
    inference(cnf,[status(esa)],[transitive_divide]) ).

cnf(l1,plain,
    ( ~ divides(factor_of(divisor(a)),divisor(a))
    | ~ divides(divisor(a),a)
    | divides(factor_of(divisor(a)),a) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(5,plain,
    ( ~ less(X0,a)
    | ~ less(n1,X0)
    | prime(factor_of(X0)) ),
    inference(cnf,[status(esa)],[factor1]) ).

cnf(l2,plain,
    ( ~ less(divisor(a),a)
    | ~ less(n1,divisor(a))
    | prime(factor_of(divisor(a))) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(4,plain,
    ( prime(X0)
    | less(divisor(X0),X0) ),
    inference(cnf,[status(esa)],[divisor2]) ).

cnf(l62,plain,
    ( prime(a)
    | less(divisor(a),a) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(3,plain,
    ( prime(X0)
    | less(n1,divisor(X0)) ),
    inference(cnf,[status(esa)],[divisor1]) ).

cnf(l4,plain,
    ( prime(a)
    | less(n1,divisor(a)) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(2,plain,
    ( divides(divisor(X0),X0)
    | prime(X0) ),
    inference(cnf,[status(esa)],[prime]) ).

cnf(l3,plain,
    ( divides(divisor(a),a)
    | prime(a) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l6,plain,
    ( ~ divides(a,a)
    | ~ prime(a) ),
    inference(instantiation,[status(thm)],[8]) ).

cnf(l63,plain,
    ( ~ divides(a,a)
    | ~ prime(a) ),
    inference(instantiation,[status(thm)],[8]) ).

cnf(0,plain,
    divides(X0,X0),
    inference(cnf,[status(esa)],[divide_self]) ).

cnf(l67,plain,
    divides(a,a),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l5,plain,
    ( ~ divides(a,a)
    | ~ prime(a) ),
    inference(instantiation,[status(thm)],[8]) ).

cnf(6,plain,
    ( ~ less(X0,a)
    | ~ less(n1,X0)
    | divides(factor_of(X0),X0) ),
    inference(cnf,[status(esa)],[factor2]) ).

cnf(l7,plain,
    ( ~ less(divisor(a),a)
    | ~ less(n1,divisor(a))
    | divides(factor_of(divisor(a)),divisor(a)) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(l54,plain,
    divides(a,a),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l11,plain,
    ( prime(a)
    | less(n1,divisor(a)) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(l10,plain,
    ( prime(a)
    | less(divisor(a),a) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(l66,plain,
    divides(a,a),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l17,plain,
    ( ~ divides(a,a)
    | ~ prime(a) ),
    inference(instantiation,[status(thm)],[8]) ).

cnf(l33,plain,
    divides(a,a),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l12,plain,
    ( ~ divides(a,a)
    | ~ prime(a) ),
    inference(instantiation,[status(thm)],[8]) ).

cnf(l26,plain,
    divides(a,a),
    inference(instantiation,[status(thm)],[0]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l62,l4,l3,l6,l63,l67,l5,l7,l54,l11,l10,l66,l17,l33,l12,l26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : NUM015-1 : TPTP v9.0.0. Released v1.0.0.
% 0.04/0.12  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33  % Computer : n026.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 : Mon Jul 21 10:13:19 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.33  % launching worker at depth: 1
% 0.12/0.33  % launching worker at depth: 6
% 0.12/0.33  % launching worker at depth: 5
% 0.12/0.33  % launching worker at depth: 4
% 0.12/0.33  % launching worker at depth: 2
% 0.12/0.33  % launching worker at depth: 3
% 0.12/0.33  % launching worker at depth: 7
% 0.12/0.33  % launching worker at depth: 8
% 0.12/0.33  % launching worker at depth: 9
% 0.12/0.34  % launching worker at depth: 10
% 0.12/0.34  % launching worker at depth: 11
% 0.18/0.35  % launching worker at depth: 12
% 0.18/0.36  % SZS status Theorem for theBenchmark
% 0.18/0.36  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------