↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : NUM015-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 08:51:38 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.38s
% Output   : Proof 0.10s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(divide_self,axiom,
    divides(X,X),
    file('theBenchmark.p',divide_self) ).

cnf(transitive_divide,axiom,
    ( divides(X,Z)
    | ~ divides(Y,Z)
    | ~ divides(X,Y) ),
    file('theBenchmark.p',transitive_divide) ).

cnf(prime,axiom,
    ( divides(divisor(X),X)
    | prime(X) ),
    file('theBenchmark.p',prime) ).

cnf(divisor1,axiom,
    ( less(n1,divisor(X))
    | prime(X) ),
    file('theBenchmark.p',divisor1) ).

cnf(divisor2,axiom,
    ( less(divisor(X),X)
    | prime(X) ),
    file('theBenchmark.p',divisor2) ).

cnf(factor1,axiom,
    ( prime(factor_of(X))
    | ~ less(X,a)
    | ~ less(n1,X) ),
    file('theBenchmark.p',factor1) ).

cnf(factor2,axiom,
    ( divides(factor_of(X),X)
    | ~ less(X,a)
    | ~ less(n1,X) ),
    file('theBenchmark.p',factor2) ).

cnf(a_is_greater_than_1,hypothesis,
    less(n1,a),
    file('theBenchmark.p',a_is_greater_than_1) ).

cnf(prove_a_has_prime_divisor,negated_conjecture,
    ( ~ divides(X,a)
    | ~ prime(X) ),
    file('theBenchmark.p',prove_a_has_prime_divisor) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM015-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 19 17:35:11 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------