%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM003_10 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:04 PM UTC 2026
% Result : Satisfiable 0.16s 0.48s
% Output : Saturation 0.16s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_9ERROR: Could not build tree for root c_0_21ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_21,plain,
! [X2: program,X4: program] :
( ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ outputs(X4,good)
| ~ outputs(X4,bad)
| halts2(esk6_0,as_input(X2)) ),
inference(csr,[status(thm)],[c_0_9,c_0_10]),
[final] ).
tcf(c_0_22,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ outputs(X4,bad)
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| ~ halts2(X2,as_input(X2))
| outputs(esk6_0,good) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_23,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ outputs(X4,bad)
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| halts2(X2,as_input(X2))
| outputs(esk6_0,bad) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_24,plain,
! [X2: program,X4: program] :
( ~ halts2(esk5_1(X4),as_input(esk5_1(X4)))
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ outputs(X4,good)
| halts2(esk6_0,as_input(X2)) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]),
[final] ).
tcf(c_0_25,plain,
! [X4: program,X2: program] :
( ~ halts3(X2,esk5_1(X2),as_input(esk5_1(X2)))
| ~ outputs(X2,bad)
| halts2(esk6_0,as_input(X4))
| halts2(esk4_1(X2),as_input(esk4_1(X2))) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]),
[final] ).
tcf(c_0_26,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk8_1(X4)))
| ~ halts2(esk9_0,as_input(X2))
| ~ halts2(X2,as_input(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_27,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ halts2(esk5_1(X4),as_input(esk5_1(X4)))
| ~ halts2(X2,as_input(X2))
| outputs(esk6_0,good) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_28,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ halts2(esk5_1(X4),as_input(esk5_1(X4)))
| halts2(X2,as_input(X2))
| outputs(esk6_0,bad) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_29,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk8_1(X4)))
| halts2(X2,as_input(X2))
| halts2(esk9_0,as_input(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_30,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,bad)
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| ~ halts2(X2,as_input(X2))
| halts2(esk4_1(X4),as_input(esk4_1(X4)))
| outputs(esk6_0,good) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_31,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,bad)
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| halts2(esk4_1(X4),as_input(esk4_1(X4)))
| halts2(X2,as_input(X2))
| outputs(esk6_0,bad) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_32,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk8_1(X4)))
| halts2(X2,as_input(X2))
| outputs(esk9_0,bad) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_33,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| ~ halts2(esk9_0,as_input(X2))
| ~ halts2(X2,as_input(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_34,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk8_1(X4)))
| ~ halts2(esk9_0,as_input(X2))
| ~ halts2(X2,as_input(X2))
| halts2(esk7_1(X4),as_input(esk7_1(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_35,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| halts2(X2,as_input(X2))
| halts2(esk9_0,as_input(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_36,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk8_1(X4)))
| halts2(esk7_1(X4),as_input(esk7_1(X4)))
| halts2(X2,as_input(X2))
| halts2(esk9_0,as_input(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_37,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,good)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| halts2(X2,as_input(X2))
| outputs(esk9_0,bad) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_38,plain,
! [X2: program,X4: program] :
( ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| ~ halts2(esk9_0,as_input(X2))
| ~ halts2(X2,as_input(X2))
| halts2(esk7_1(X4),as_input(esk7_1(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_39,plain,
! [X4: program,X2: program] :
( ~ halts2(esk5_1(X2),as_input(esk5_1(X2)))
| halts2(esk6_0,as_input(X4))
| halts2(esk4_1(X2),as_input(esk4_1(X2))) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]),
[final] ).
tcf(c_0_40,plain,
! [X2: program,X4: program] :
( ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk8_1(X4)))
| halts2(esk7_1(X4),as_input(esk7_1(X4)))
| halts2(X2,as_input(X2))
| outputs(esk9_0,bad) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_41,plain,
! [X2: program,X4: program] :
( ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| halts2(esk7_1(X4),as_input(esk7_1(X4)))
| halts2(X2,as_input(X2))
| halts2(esk9_0,as_input(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_42,plain,
! [X2: program,X4: program] :
( ~ halts2(esk5_1(X4),as_input(esk5_1(X4)))
| ~ halts2(X2,as_input(X2))
| halts2(esk4_1(X4),as_input(esk4_1(X4)))
| outputs(esk6_0,good) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_43,plain,
! [X2: program,X4: program] :
( ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| halts2(esk7_1(X4),as_input(esk7_1(X4)))
| halts2(X2,as_input(X2))
| outputs(esk9_0,bad) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_44,plain,
! [X2: program,X4: program] :
( ~ halts2(esk5_1(X4),as_input(esk5_1(X4)))
| halts2(esk4_1(X4),as_input(esk4_1(X4)))
| halts2(X2,as_input(X2))
| outputs(esk6_0,bad) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_45,plain,
! [X2: program,X3: input,X4: program,X5: program,X9: input] :
( ~ decides(algorithm_of(X2),X5,X9)
| halts3(X2,X4,X3) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]),
[final] ).
tcf(c_0_46,plain,
! [X3: input,X2: program,X1: algorithm] :
( ~ decides(X1,esk1_1(X1),esk2_1(X1))
| decides(algorithm_of(esk3_0),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
tcf(c_0_47,plain,
! [X2: program,X3: input,X4: program,X5: program,X9: input] :
( ~ decides(algorithm_of(X2),X5,X9)
| ~ halts2(X4,X3)
| outputs(X2,good) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
tcf(c_0_48,plain,
! [X2: program,X3: input,X4: program,X5: program,X9: input] :
( ~ decides(algorithm_of(X2),X5,X9)
| halts2(X4,X3)
| outputs(X2,bad) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM003_10 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 14:11:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/0.48 % Version: 3.5.1
% 0.16/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 % Starting sh5l with 300s (1) cores
% 0.16/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1300970 completed with status 1
% 0.16/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.48 % No SInE strategy applied
% 0.16/0.48 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.16/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.48 % Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.16/0.48 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.48 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.16/0.48 % SubtermCWHack with pid 1300982 completed with status 1
% 0.16/0.48 % Result found by SubtermCWHack
% 0.16/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.48 % No SInE strategy applied
% 0.16/0.48 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.16/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.48 % Preprocessing time : 0.002 s
% 0.16/0.48
% 0.16/0.48 % No proof found!
% 0.16/0.48 % SZS status Satisfiable
% 0.16/0.48 % SZS output start Saturation
% See solution above
% 0.16/0.48 % Parsed axioms : 16
% 0.16/0.48 % Removed by relevancy pruning/SinE : 0
% 0.16/0.48 % Initial clauses : 45
% 0.16/0.48 % Removed in clause preprocessing : 12
% 0.16/0.48 % Initial clauses in saturation : 33
% 0.16/0.48 % Processed clauses : 33
% 0.16/0.48 % ...of these trivial : 0
% 0.16/0.48 % ...subsumed : 0
% 0.16/0.48 % ...remaining for further processing : 33
% 0.16/0.48 % Other redundant clauses eliminated : 0
% 0.16/0.48 % Clauses deleted for lack of memory : 0
% 0.16/0.48 % Backward-subsumed : 5
% 0.16/0.48 % Backward-rewritten : 0
% 0.16/0.48 % Generated clauses : 0
% 0.16/0.48 % ...of the previous two non-redundant : 0
% 0.16/0.48 % ...aggressively subsumed : 0
% 0.16/0.48 % Contextual simplify-reflections : 5
% 0.16/0.48 % Paramodulations : 0
% 0.16/0.48 % Factorizations : 0
% 0.16/0.48 % NegExts : 0
% 0.16/0.48 % Equation resolutions : 0
% 0.16/0.48 % Disequality decompositions : 0
% 0.16/0.48 % Total rewrite steps : 0
% 0.16/0.48 % ...of those cached : 0
% 0.16/0.48 % Propositional unsat checks : 0
% 0.16/0.48 % Propositional check models : 0
% 0.16/0.48 % Propositional check unsatisfiable : 0
% 0.16/0.48 % Propositional clauses : 0
% 0.16/0.48 % Propositional clauses after purity: 0
% 0.16/0.48 % Propositional unsat core size : 0
% 0.16/0.48 % Propositional preprocessing time : 0.000
% 0.16/0.48 % Propositional encoding time : 0.000
% 0.16/0.48 % Propositional solver time : 0.000
% 0.16/0.48 % Success case prop preproc time : 0.000
% 0.16/0.48 % Success case prop encoding time : 0.000
% 0.16/0.48 % Success case prop solver time : 0.000
% 0.16/0.48 % Current number of processed clauses : 28
% 0.16/0.48 % Positive orientable unit clauses : 0
% 0.16/0.48 % Positive unorientable unit clauses: 0
% 0.16/0.48 % Negative unit clauses : 0
% 0.16/0.48 % Non-unit-clauses : 28
% 0.16/0.48 % Current number of unprocessed clauses: 0
% 0.16/0.48 % ...number of literals in the above : 0
% 0.16/0.48 % Current number of archived formulas : 0
% 0.16/0.48 % Current number of archived clauses : 5
% 0.16/0.48 % Clause-clause subsumption calls (NU) : 454
% 0.16/0.48 % Rec. Clause-clause subsumption calls : 79
% 0.16/0.48 % Non-unit clause-clause subsumptions : 10
% 0.16/0.48 % Unit Clause-clause subsumption calls : 0
% 0.16/0.48 % Rewrite failures with RHS unbound : 0
% 0.16/0.48 % BW rewrite match attempts : 0
% 0.16/0.48 % BW rewrite match successes : 0
% 0.16/0.48 % Condensation attempts : 0
% 0.16/0.48 % Condensation successes : 0
% 0.16/0.48 % Termbank termtop insertions : 3695
% 0.16/0.48 % Search garbage collected termcells : 369
% 0.16/0.48
% 0.16/0.48 % -------------------------------------------------
% 0.16/0.48 % User time : 0.014 s
% 0.16/0.48 % System time : 0.005 s
% 0.16/0.48 % Total time : 0.019 s
% 0.16/0.48 % Maximum resident set size: 3644 pages
% 0.16/0.48
% 0.16/0.48 % -------------------------------------------------
% 0.16/0.48 % User time : 0.051 s
% 0.16/0.48 % System time : 0.021 s
% 0.16/0.48 % Total time : 0.072 s
% 0.16/0.48 % Maximum resident set size: 4864 pages
% 0.16/0.48 % E exiting
%------------------------------------------------------------------------------