%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n018.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 : Fri Sep 25 01:03:17 PM UTC 2026
% Result : Unsatisfiable 0.16s 6.02s
% Output : Proof 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 11 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 61 ( 33 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 88 ( 30 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f24,axiom,
( program_not_halts2(Y,Z)
| ~ program_not_halts2_halts3_outputs(X,Y,Z,W) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts2_halts3_outputs1) ).
fof(f24_nnf,plain,
! [X,Y,Z,W] :
( program_not_halts2(Y,Z)
| ~ program_not_halts2_halts3_outputs(X,Y,Z,W) ),
inference(nnf_transformation,[status(thm)],[f24]) ).
fof(f24_sk,plain,
! [X,Y,Z,W] :
( program_not_halts2(Y,Z)
| ~ program_not_halts2_halts3_outputs(X,Y,Z,W) ),
inference(skolemisation,[status(esa)],[f24_nnf]) ).
cnf(c24,plain,
( program_not_halts2(X1,X2)
| ~ program_not_halts2_halts3_outputs(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f24_sk]) ).
cnf(f35,hypothesis,
( program_not_halts2_halts3_outputs(W,Y,Z,bad)
| ~ program_program_decides(W) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2_2) ).
fof(f35_nnf,plain,
! [W,Y,Z] :
( program_not_halts2_halts3_outputs(W,Y,Z,bad)
| ~ program_program_decides(W) ),
inference(nnf_transformation,[status(thm)],[f35]) ).
fof(f35_sk,plain,
! [W,Y,Z] :
( program_not_halts2_halts3_outputs(W,Y,Z,bad)
| ~ program_program_decides(W) ),
inference(skolemisation,[status(esa)],[f35_nnf]) ).
cnf(c35,plain,
( program_not_halts2_halts3_outputs(X0,X1,X2,bad)
| ~ program_program_decides(X0) ),
inference(cnf_transformation,[status(esa)],[f35_sk]) ).
cnf(f33,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom1_1) ).
fof(f33_nnf,plain,
! [X] :
( program_program_decides(c1)
| ~ algorithm_program_decides(X) ),
inference(nnf_transformation,[status(thm)],[f33]) ).
fof(f33_sk,plain,
! [X] :
( program_program_decides(c1)
| ~ algorithm_program_decides(X) ),
inference(skolemisation,[status(esa)],[f33_nnf]) ).
cnf(c33,plain,
( program_program_decides(c1)
| ~ algorithm_program_decides(X0) ),
inference(cnf_transformation,[status(esa)],[f33_sk]) ).
cnf(f42,negated_conjecture,
algorithm_program_decides(c4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).
fof(f42_nnf,plain,
algorithm_program_decides(c4),
inference(nnf_transformation,[status(thm)],[f42]) ).
cnf(c42,plain,
algorithm_program_decides(c4),
inference(cnf_transformation,[status(esa)],[f42_nnf]) ).
cnf(p47,plain,
program_program_decides(c1),
inference(resolution,[status(thm)],[c33,c42]) ).
cnf(p58,plain,
program_not_halts2_halts3_outputs(c1,X0,X1,bad),
inference(resolution,[status(thm)],[c35,p47]) ).
cnf(p80,plain,
program_not_halts2(X0,X1),
inference(resolution,[status(thm)],[c24,p58]) ).
cnf(f16,axiom,
( ~ halts2(X,Y)
| ~ program_not_halts2(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts3a) ).
fof(f16_nnf,plain,
! [X,Y] :
( ~ halts2(X,Y)
| ~ program_not_halts2(X,Y) ),
inference(nnf_transformation,[status(thm)],[f16]) ).
fof(f16_sk,plain,
! [X,Y] :
( ~ halts2(X,Y)
| ~ program_not_halts2(X,Y) ),
inference(skolemisation,[status(esa)],[f16_nnf]) ).
cnf(c16,plain,
( ~ halts2(X0,X1)
| ~ program_not_halts2(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f16_sk]) ).
cnf(p81,plain,
~ halts2(X0,X1),
inference(resolution,[status(thm)],[p80,c16]) ).
cnf(f21,axiom,
( program_halts2(Y,Z)
| ~ program_halts2_halts3_outputs(X,Y,Z,W) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).
fof(f21_nnf,plain,
! [X,Y,Z,W] :
( program_halts2(Y,Z)
| ~ program_halts2_halts3_outputs(X,Y,Z,W) ),
inference(nnf_transformation,[status(thm)],[f21]) ).
fof(f21_sk,plain,
! [X,Y,Z,W] :
( program_halts2(Y,Z)
| ~ program_halts2_halts3_outputs(X,Y,Z,W) ),
inference(skolemisation,[status(esa)],[f21_nnf]) ).
cnf(c21,plain,
( program_halts2(X1,X2)
| ~ program_halts2_halts3_outputs(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f21_sk]) ).
cnf(f34,hypothesis,
( program_halts2_halts3_outputs(W,Y,Z,good)
| ~ program_program_decides(W) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2_1) ).
fof(f34_nnf,plain,
! [W,Y,Z] :
( program_halts2_halts3_outputs(W,Y,Z,good)
| ~ program_program_decides(W) ),
inference(nnf_transformation,[status(thm)],[f34]) ).
fof(f34_sk,plain,
! [W,Y,Z] :
( program_halts2_halts3_outputs(W,Y,Z,good)
| ~ program_program_decides(W) ),
inference(skolemisation,[status(esa)],[f34_nnf]) ).
cnf(c34,plain,
( program_halts2_halts3_outputs(X0,X1,X2,good)
| ~ program_program_decides(X0) ),
inference(cnf_transformation,[status(esa)],[f34_sk]) ).
cnf(p57,plain,
program_halts2_halts3_outputs(c1,X0,X1,good),
inference(resolution,[status(thm)],[c34,p47]) ).
cnf(p59,plain,
program_halts2(X0,X1),
inference(resolution,[status(thm)],[c21,p57]) ).
cnf(f10,axiom,
( halts2(X,Y)
| ~ program_halts2(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts3a) ).
fof(f10_nnf,plain,
! [X,Y] :
( halts2(X,Y)
| ~ program_halts2(X,Y) ),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
! [X,Y] :
( halts2(X,Y)
| ~ program_halts2(X,Y) ),
inference(skolemisation,[status(esa)],[f10_nnf]) ).
cnf(c10,plain,
( halts2(X0,X1)
| ~ program_halts2(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(p61,plain,
halts2(X0,X1),
inference(resolution,[status(thm)],[p59,c10]) ).
cnf(p82,plain,
$false,
inference(resolution,[status(thm)],[p81,p61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/5.38 % Computer : n018.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Fri Sep 25 07:46:11 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/6.02 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/6.02 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------