%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COM003-2 : TPTP v9.2.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n020.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 : Tue May 5 04:12:56 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 7 unt; 0 nHn; 17 RR)
% Number of literals : 39 ( 0 equ; 21 neg)
% Maximal clause size : 2 ( 1 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 : 48 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(program_halts2_halts3_outputs1,axiom,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).
cnf(axiom2_1,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2_1) ).
cnf(axiom1_1,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom1_1) ).
cnf(prove_algorithm_does_not_exist,negated_conjecture,
algorithm_program_decides(c4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).
cnf(program_not_halts3a,axiom,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts3a) ).
cnf(program_halts3a,axiom,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts3a) ).
cnf(program_not_halts2_halts3_outputs1,axiom,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts2_halts3_outputs1) ).
cnf(axiom2_2,hypothesis,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2_2) ).
cnf(c_0_8,axiom,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
program_halts2_halts3_outputs1 ).
cnf(c_0_9,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
axiom2_1 ).
cnf(c_0_10,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
axiom1_1 ).
cnf(c_0_11,negated_conjecture,
algorithm_program_decides(c4),
prove_algorithm_does_not_exist ).
cnf(c_0_12,axiom,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
program_not_halts3a ).
cnf(c_0_13,axiom,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
program_halts3a ).
cnf(c_0_14,hypothesis,
( program_halts2(X1,X2)
| ~ program_program_decides(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
program_program_decides(c1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ program_not_halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
program_halts2(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
program_not_halts2_halts3_outputs1 ).
cnf(c_0_19,hypothesis,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
axiom2_2 ).
cnf(c_0_20,plain,
~ program_not_halts2(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,hypothesis,
~ program_program_decides(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM003-2 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n020.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 16:19:05 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------