%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO039_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 03:49:14 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO039_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 11:34:06 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3952970 completed with status 0
% 0.11/0.43 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FUUPF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 3952974 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FUUPF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Theorem
% 0.11/0.43 % SZS output start CNFRefutation
% 0.11/0.43 tff(decl_23, type, h: $o > $i).
% 0.11/0.43 fof(1, conjecture, h(h($false)=h(~(~$true)))=h($false), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 1)).
% 0.11/0.43 fof(c_0_1, negated_conjecture, ~(h(h($false)=h(~(~$true)))=h($false)), inference(assume_negation,[status(cth)],[1])).
% 0.11/0.43 fof(c_0_2, negated_conjecture, ~(((((~(~(~($true)))|h($false)!=h($true))&(~(~($true))|h($false)!=h($false)))|h($true)=h($false))&(((~(~(~($true)))|h($false)=h($true))&(~(~($true))|h($false)=h($false)))|h($false)=h($false)))), inference(fool_unroll,[status(thm)],[c_0_1])).
% 0.11/0.43 fof(c_0_3, negated_conjecture, (((((((~$true|$true|(~$true|$true))&(h($false)!=h($false)|$true|(~$true|$true)))&((~$true|h($false)!=h($true)|(~$true|$true))&(h($false)!=h($false)|h($false)!=h($true)|(~$true|$true))))&(h($false)!=h($false)|(~$true|$true)))&((((~$true|$true|(h($false)=h($false)|$true))&(h($false)!=h($false)|$true|(h($false)=h($false)|$true)))&((~$true|h($false)!=h($true)|(h($false)=h($false)|$true))&(h($false)!=h($false)|h($false)!=h($true)|(h($false)=h($false)|$true))))&(h($false)!=h($false)|(h($false)=h($false)|$true))))&(((((~$true|$true|(~$true|h($false)=h($true)))&(h($false)!=h($false)|$true|(~$true|h($false)=h($true))))&((~$true|h($false)!=h($true)|(~$true|h($false)=h($true)))&(h($false)!=h($false)|h($false)!=h($true)|(~$true|h($false)=h($true)))))&(h($false)!=h($false)|(~$true|h($false)=h($true))))&((((~$true|$true|(h($false)=h($false)|h($false)=h($true)))&(h($false)!=h($false)|$true|(h($false)=h($false)|h($false)=h($true))))&((~$true|h($false)!=h($true)|(h($false)=h($false)|h($false)=h($true)))&(h($false)!=h($false)|h($false)!=h($true)|(h($false)=h($false)|h($false)=h($true)))))&(h($false)!=h($false)|(h($false)=h($false)|h($false)=h($true))))))&((((~$true|$true|h($true)!=h($false))&(h($false)!=h($false)|$true|h($true)!=h($false)))&((~$true|h($false)!=h($true)|h($true)!=h($false))&(h($false)!=h($false)|h($false)!=h($true)|h($true)!=h($false))))&(h($false)!=h($false)|h($true)!=h($false)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
% 0.11/0.43 cnf(c_0_4, negated_conjecture, ($false|h($true)!=h($false)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.11/0.43 cnf(c_0_5, negated_conjecture, (h($false)=h($true)|$false|$false), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.11/0.43 cnf(c_0_6, negated_conjecture, (h($true)!=h($false)), inference(cn,[status(thm)],[c_0_4])).
% 0.11/0.43 cnf(c_0_7, negated_conjecture, (h($false)=h($true)), inference(cn,[status(thm)],[c_0_5])).
% 0.11/0.43 cnf(c_0_8, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7])]), ['proof']).
% 0.11/0.43 % SZS output end CNFRefutation
% 0.11/0.43 % Parsed axioms : 2
% 0.11/0.43 % Removed by relevancy pruning/SinE : 0
% 0.11/0.43 % Initial clauses : 26
% 0.11/0.43 % Removed in clause preprocessing : 22
% 0.11/0.43 % Initial clauses in saturation : 4
% 0.11/0.43 % Processed clauses : 2
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 1
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 0
% 0.11/0.43 % Backward-rewritten : 0
% 0.11/0.43 % Generated clauses : 0
% 0.11/0.43 % ...of the previous two non-redundant : 0
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 0
% 0.11/0.43 % Paramodulations : 0
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 1
% 0.11/0.43 % ...of those cached : 0
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 1
% 0.11/0.43 % Positive orientable unit clauses : 1
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 0
% 0.11/0.43 % Non-unit-clauses : 0
% 0.11/0.43 % Current number of unprocessed clauses: 2
% 0.11/0.43 % ...number of literals in the above : 2
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 0
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 0
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.11/0.43 % Non-unit clause-clause subsumptions : 0
% 0.11/0.43 % Unit Clause-clause subsumption calls : 0
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 0
% 0.11/0.43 % BW rewrite match successes : 0
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 652
% 0.11/0.43 % Search garbage collected termcells : 103
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.003 s
% 0.11/0.43 % System time : 0.001 s
% 0.11/0.43 % Total time : 0.004 s
% 0.11/0.43 % Maximum resident set size: 3624 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.007 s
% 0.11/0.43 % System time : 0.010 s
% 0.11/0.43 % Total time : 0.017 s
% 0.11/0.43 % Maximum resident set size: 4608 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------