%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 12:11:15 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 8 unt; 0 nHn; 23 RR)
% Number of literals : 54 ( 0 equ; 30 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 : 71 ( 39 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(program_halts2_halts3_outputs1,axiom,
( ~ program_halts2_halts3_outputs(X1,X2,X3,X4)
| program_halts2(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).
cnf(axiom2_1,hypothesis,
( ~ program_program_decides(X1)
| program_halts2_halts3_outputs(X1,X2,X3,good) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_1) ).
cnf(axiom1_1,hypothesis,
( ~ algorithm_program_decides(X1)
| program_program_decides(c1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1_1) ).
cnf(program_not_halts3a,axiom,
( ~ halts2(X1,X2)
| ~ program_not_halts2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts3a) ).
cnf(program_halts3a,axiom,
( ~ program_halts2(X1,X2)
| halts2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts3a) ).
cnf(prove_algorithm_does_not_exist,negated_conjecture,
algorithm_program_decides(c4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).
cnf(program_not_halts2_halts3_outputs1,axiom,
( ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4)
| program_not_halts2(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts2_halts3_outputs1) ).
cnf(axiom2_2,hypothesis,
( ~ program_program_decides(X1)
| program_not_halts2_halts3_outputs(X1,X2,X3,bad) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_2) ).
cnf(c_0_8,plain,
( ~ program_halts2_halts3_outputs(X1,X2,X3,X4)
| program_halts2(X2,X3) ),
inference(fof_simplification,[status(thm)],[program_halts2_halts3_outputs1]) ).
cnf(c_0_9,hypothesis,
( ~ program_program_decides(X1)
| program_halts2_halts3_outputs(X1,X2,X3,good) ),
inference(fof_simplification,[status(thm)],[axiom2_1]) ).
cnf(c_0_10,hypothesis,
( ~ algorithm_program_decides(X1)
| program_program_decides(c1) ),
inference(fof_simplification,[status(thm)],[axiom1_1]) ).
cnf(c_0_11,plain,
( ~ halts2(X1,X2)
| ~ program_not_halts2(X1,X2) ),
inference(fof_simplification,[status(thm)],[program_not_halts3a]) ).
cnf(c_0_12,plain,
( ~ program_halts2(X1,X2)
| halts2(X1,X2) ),
inference(fof_simplification,[status(thm)],[program_halts3a]) ).
cnf(c_0_13,plain,
( ~ program_halts2_halts3_outputs(X1,X2,X3,X4)
| program_halts2(X2,X3) ),
c_0_8 ).
cnf(c_0_14,hypothesis,
( ~ program_program_decides(X1)
| program_halts2_halts3_outputs(X1,X2,X3,good) ),
c_0_9 ).
cnf(c_0_15,hypothesis,
( ~ algorithm_program_decides(X1)
| program_program_decides(c1) ),
c_0_10 ).
cnf(c_0_16,negated_conjecture,
algorithm_program_decides(c4),
prove_algorithm_does_not_exist ).
cnf(c_0_17,plain,
( ~ halts2(X1,X2)
| ~ program_not_halts2(X1,X2) ),
c_0_11 ).
cnf(c_0_18,plain,
( ~ program_halts2(X1,X2)
| halts2(X1,X2) ),
c_0_12 ).
cnf(c_0_19,hypothesis,
( ~ program_program_decides(X3)
| program_halts2(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
program_program_decides(c1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4)
| program_not_halts2(X2,X3) ),
inference(fof_simplification,[status(thm)],[program_not_halts2_halts3_outputs1]) ).
cnf(c_0_22,plain,
( ~ program_halts2(X1,X2)
| ~ program_not_halts2(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
program_halts2(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4)
| program_not_halts2(X2,X3) ),
c_0_21 ).
cnf(c_0_25,plain,
~ program_not_halts2(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,hypothesis,
( ~ program_program_decides(X1)
| program_not_halts2_halts3_outputs(X1,X2,X3,bad) ),
inference(fof_simplification,[status(thm)],[axiom2_2]) ).
cnf(c_0_27,plain,
~ program_not_halts2_halts3_outputs(X1,X2,X3,X4),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,hypothesis,
( ~ program_program_decides(X1)
| program_not_halts2_halts3_outputs(X1,X2,X3,bad) ),
c_0_26 ).
cnf(c_0_29,hypothesis,
~ program_program_decides(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n019.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 14:14:04 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_3 with pid 2785526 completed with status 0
% 0.13/0.42 % Result found by new_bool_3
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 2785532 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Unsatisfiable
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 43
% 0.13/0.42 % Removed by relevancy pruning/SinE : 10
% 0.13/0.42 % Initial clauses : 33
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 33
% 0.13/0.42 % Processed clauses : 40
% 0.13/0.42 % ...of these trivial : 1
% 0.13/0.42 % ...subsumed : 1
% 0.13/0.42 % ...remaining for further processing : 38
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 4
% 0.13/0.42 % Backward-rewritten : 18
% 0.13/0.42 % Generated clauses : 23
% 0.13/0.42 % ...of the previous two non-redundant : 21
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 21
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 21
% 0.13/0.42 % ...of those cached : 12
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 14
% 0.13/0.42 % Positive orientable unit clauses : 4
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 3
% 0.13/0.42 % Non-unit-clauses : 7
% 0.13/0.42 % Current number of unprocessed clauses: 13
% 0.13/0.42 % ...number of literals in the above : 43
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 24
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 84
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 60
% 0.13/0.42 % Non-unit clause-clause subsumptions : 1
% 0.13/0.42 % Unit Clause-clause subsumption calls : 18
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 7
% 0.13/0.42 % BW rewrite match successes : 7
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 1300
% 0.13/0.42 % Search garbage collected termcells : 113
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.004 s
% 0.13/0.42 % System time : 0.001 s
% 0.13/0.42 % Total time : 0.005 s
% 0.13/0.42 % Maximum resident set size: 3664 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.007 s
% 0.13/0.42 % System time : 0.004 s
% 0.13/0.42 % Total time : 0.011 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------