↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Computer : n015.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:14:42 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(program_decides1,axiom,
    ( decides(X,Y,Z)
    | ~ program(Y)
    | ~ program_decides(X) ),
    file('theBenchmark.p',program_decides1) ).

cnf(program_decides2,axiom,
    ( program(f2(X))
    | program_decides(X) ),
    file('theBenchmark.p',program_decides2) ).

cnf(program_decides3,axiom,
    ( ~ decides(X,f2(X),f1(X))
    | program_decides(X) ),
    file('theBenchmark.p',program_decides3) ).

cnf(program_program_decides1,axiom,
    ( program(X)
    | ~ program_program_decides(X) ),
    file('theBenchmark.p',program_program_decides1) ).

cnf(program_program_decides2,axiom,
    ( program_decides(X)
    | ~ program_program_decides(X) ),
    file('theBenchmark.p',program_program_decides2) ).

cnf(program_program_decides3,axiom,
    ( ~ program_decides(X)
    | ~ program(X)
    | program_program_decides(X) ),
    file('theBenchmark.p',program_program_decides3) ).

cnf(algorithm_program_decides1,axiom,
    ( algorithm(X)
    | ~ algorithm_program_decides(X) ),
    file('theBenchmark.p',algorithm_program_decides1) ).

cnf(algorithm_program_decides2,axiom,
    ( program_decides(X)
    | ~ algorithm_program_decides(X) ),
    file('theBenchmark.p',algorithm_program_decides2) ).

cnf(algorithm_program_decides3,axiom,
    ( ~ program_decides(X)
    | ~ algorithm(X)
    | algorithm_program_decides(X) ),
    file('theBenchmark.p',algorithm_program_decides3) ).

cnf(program_halts1,axiom,
    ( program(X)
    | ~ program_halts2(X,Y) ),
    file('theBenchmark.p',program_halts1) ).

cnf(program_halts3a,axiom,
    ( halts2(X,Y)
    | ~ program_halts2(X,Y) ),
    file('theBenchmark.p',program_halts3a) ).

cnf(program_halts3b,axiom,
    ( ~ halts2(X,Y)
    | ~ program(X)
    | program_halts2(X,Y) ),
    file('theBenchmark.p',program_halts3b) ).

cnf(halts3_outputs1,axiom,
    ( halts3(X,Y,Z)
    | ~ halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',halts3_outputs1) ).

cnf(halts3_outputs2,axiom,
    ( outputs(X,W)
    | ~ halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',halts3_outputs2) ).

cnf(halts3_outputs3,axiom,
    ( ~ outputs(X,W)
    | ~ halts3(X,Y,Z)
    | halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',halts3_outputs3) ).

cnf(program_not_halts1,axiom,
    ( program(X)
    | ~ program_not_halts2(X,Y) ),
    file('theBenchmark.p',program_not_halts1) ).

cnf(program_not_halts3a,axiom,
    ( ~ halts2(X,Y)
    | ~ program_not_halts2(X,Y) ),
    file('theBenchmark.p',program_not_halts3a) ).

cnf(program_not_halts3b,axiom,
    ( halts2(X,Y)
    | ~ program(X)
    | program_not_halts2(X,Y) ),
    file('theBenchmark.p',program_not_halts3b) ).

cnf(halts2_outputs1,axiom,
    ( halts2(X,Y)
    | ~ halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',halts2_outputs1) ).

cnf(halts2_outputs2,axiom,
    ( outputs(X,W)
    | ~ halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',halts2_outputs2) ).

cnf(halts2_outputs3,axiom,
    ( ~ outputs(X,W)
    | ~ halts2(X,Y)
    | halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',halts2_outputs3) ).

cnf(program_halts2_halts3_outputs1,axiom,
    ( program_halts2(Y,Z)
    | ~ program_halts2_halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',program_halts2_halts3_outputs1) ).

cnf(program_halts2_halts3_outputs2,axiom,
    ( halts3_outputs(X,Y,Z,W)
    | ~ program_halts2_halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',program_halts2_halts3_outputs2) ).

cnf(program_halts2_halts3_outputs3,axiom,
    ( ~ halts3_outputs(X,Y,Z,W)
    | ~ program_halts2(Y,Z)
    | program_halts2_halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',program_halts2_halts3_outputs3) ).

cnf(program_not_halts2_halts3_outputs1,axiom,
    ( program_not_halts2(Y,Z)
    | ~ program_not_halts2_halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',program_not_halts2_halts3_outputs1) ).

cnf(program_not_halts2_halts3_outputs2,axiom,
    ( halts3_outputs(X,Y,Z,W)
    | ~ program_not_halts2_halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',program_not_halts2_halts3_outputs2) ).

cnf(program_not_halts2_halts3_outputs3,axiom,
    ( ~ halts3_outputs(X,Y,Z,W)
    | ~ program_not_halts2(Y,Z)
    | program_not_halts2_halts3_outputs(X,Y,Z,W) ),
    file('theBenchmark.p',program_not_halts2_halts3_outputs3) ).

cnf(program_halts2_halts2_outputs1,axiom,
    ( program_halts2(Y,Y)
    | ~ program_halts2_halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',program_halts2_halts2_outputs1) ).

cnf(program_halts2_halts2_outputs2,axiom,
    ( halts2_outputs(X,Y,W)
    | ~ program_halts2_halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',program_halts2_halts2_outputs2) ).

cnf(program_halts2_halts2_outputs3,axiom,
    ( ~ halts2_outputs(X,Y,W)
    | ~ program_halts2(Y,Y)
    | program_halts2_halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',program_halts2_halts2_outputs3) ).

cnf(program_not_halts2_halts2_outputs1,axiom,
    ( program_not_halts2(Y,Y)
    | ~ program_not_halts2_halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',program_not_halts2_halts2_outputs1) ).

cnf(program_not_halts2_halts2_outputs2,axiom,
    ( halts2_outputs(X,Y,W)
    | ~ program_not_halts2_halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',program_not_halts2_halts2_outputs2) ).

cnf(program_not_halts2_halts2_outputs3,axiom,
    ( ~ halts2_outputs(X,Y,W)
    | ~ program_not_halts2(Y,Y)
    | program_not_halts2_halts2_outputs(X,Y,W) ),
    file('theBenchmark.p',program_not_halts2_halts2_outputs3) ).

cnf(axiom1_1,hypothesis,
    ( program_program_decides(c1)
    | ~ algorithm_program_decides(X) ),
    file('theBenchmark.p',axiom1_1) ).

cnf(axiom2_1,hypothesis,
    ( program_halts2_halts3_outputs(W,Y,Z,good)
    | ~ program_program_decides(W) ),
    file('theBenchmark.p',axiom2_1) ).

cnf(axiom2_2,hypothesis,
    ( program_not_halts2_halts3_outputs(W,Y,Z,bad)
    | ~ program_program_decides(W) ),
    file('theBenchmark.p',axiom2_2) ).

cnf(axiom3_1,hypothesis,
    ( program(c2)
    | ~ program_not_halts2_halts3_outputs(W,f3(W),f3(W),bad)
    | ~ program_halts2_halts3_outputs(W,f3(W),f3(W),good)
    | ~ program(W) ),
    file('theBenchmark.p',axiom3_1) ).

cnf(axiom3_2,hypothesis,
    ( program_halts2_halts2_outputs(c2,Y,good)
    | ~ program_not_halts2_halts3_outputs(W,f3(W),f3(W),bad)
    | ~ program_halts2_halts3_outputs(W,f3(W),f3(W),good)
    | ~ program(W) ),
    file('theBenchmark.p',axiom3_2) ).

cnf(axiom3_3,hypothesis,
    ( program_not_halts2_halts2_outputs(c2,Y,bad)
    | ~ program_not_halts2_halts3_outputs(W,f3(W),f3(W),bad)
    | ~ program_halts2_halts3_outputs(W,f3(W),f3(W),good)
    | ~ program(W) ),
    file('theBenchmark.p',axiom3_3) ).

cnf(axiom4_1,hypothesis,
    ( program(c3)
    | ~ program_not_halts2_halts2_outputs(V,f4(V),bad)
    | ~ program_halts2_halts2_outputs(V,f4(V),good)
    | ~ program(V) ),
    file('theBenchmark.p',axiom4_1) ).

cnf(axiom4_2,hypothesis,
    ( halts2(c3,Y)
    | ~ program_halts2(Y,Y)
    | ~ program_not_halts2_halts2_outputs(V,f4(V),bad)
    | ~ program_halts2_halts2_outputs(V,f4(V),good)
    | ~ program(V) ),
    file('theBenchmark.p',axiom4_2) ).

cnf(axiom4_3,hypothesis,
    ( program_not_halts2_halts2_outputs(c3,Y,bad)
    | ~ program_not_halts2_halts2_outputs(V,f4(V),bad)
    | ~ program_halts2_halts2_outputs(V,f4(V),good)
    | ~ program(V) ),
    file('theBenchmark.p',axiom4_3) ).

cnf(prove_algorithm_does_not_exist,negated_conjecture,
    algorithm_program_decides(c4),
    file('theBenchmark.p',prove_algorithm_does_not_exist) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n015.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 : Sun Sep 20 15:19:05 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.40  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.40  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------