%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO091_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 : n012.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:45:32 PM UTC 2026
% Result : Theorem 0.06s 0.33s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYO091_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.29 % Computer : n012.cluster.edu
% 0.04/0.29 % Model : x86_64 x86_64
% 0.04/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.29 % Memory : 8046.5625MB
% 0.04/0.29 % OS : Linux 6.8.0-71-generic
% 0.04/0.29 % CPULimit : 300
% 0.04/0.29 % WCLimit : 300
% 0.04/0.29 % DateTime : Mon Sep 21 11:38:22 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 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.06/0.33 % Version: 3.5.1
% 0.06/0.33 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.33 % Starting sh5l with 300s (1) cores
% 0.06/0.33 % new_bool_3 with pid 2268433 completed with status 0
% 0.06/0.33 % Result found by new_bool_3
% 0.06/0.33 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.33 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.06/0.33 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.33 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.33 % SubtermCWHack with pid 2268438 completed with status 0
% 0.06/0.33 % Result found by SubtermCWHack
% 0.06/0.33 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.33 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.06/0.33 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.33 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.33 % Preprocessing time : 0.001 s
% 0.06/0.33
% 0.06/0.33 % Proof found!
% 0.06/0.33 % SZS status Theorem
% 0.06/0.33 % SZS output start CNFRefutation
% 0.06/0.33 tff(decl_23, type, epred1_0: $o).
% 0.06/0.33 tff(decl_24, type, epred2_0: $o).
% 0.06/0.33 tff(decl_25, type, epred3_0: $o).
% 0.06/0.33 fof(cTHM50Q, conjecture, ![X1:$o, X2:$o, X3:$o]:((((X1<=>X2)<=>X3)<=>(X1<=>(X2<=>X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM50Q)).
% 0.06/0.33 fof(c_0_1, negated_conjecture, ~(![X1:$o, X2:$o, X3:$o]:((((X1<=>X2)<=>X3)<=>(X1<=>(X2<=>X3))))), inference(assume_negation,[status(cth)],[cTHM50Q])).
% 0.06/0.33 fof(c_0_2, negated_conjecture, ((((((~epred2_0|~epred3_0|~epred1_0|(~epred1_0|~epred2_0|~epred3_0))&(epred2_0|epred3_0|~epred1_0|(~epred1_0|~epred2_0|~epred3_0)))&((~epred2_0|epred3_0|epred1_0|(~epred1_0|~epred2_0|~epred3_0))&(~epred3_0|epred2_0|epred1_0|(~epred1_0|~epred2_0|~epred3_0))))&(((~epred2_0|~epred3_0|~epred1_0|(epred1_0|epred2_0|~epred3_0))&(epred2_0|epred3_0|~epred1_0|(epred1_0|epred2_0|~epred3_0)))&((~epred2_0|epred3_0|epred1_0|(epred1_0|epred2_0|~epred3_0))&(~epred3_0|epred2_0|epred1_0|(epred1_0|epred2_0|~epred3_0)))))&((((~epred2_0|~epred3_0|~epred1_0|(~epred1_0|epred2_0|epred3_0))&(epred2_0|epred3_0|~epred1_0|(~epred1_0|epred2_0|epred3_0)))&((~epred2_0|epred3_0|epred1_0|(~epred1_0|epred2_0|epred3_0))&(~epred3_0|epred2_0|epred1_0|(~epred1_0|epred2_0|epred3_0))))&(((~epred2_0|~epred3_0|~epred1_0|(~epred2_0|epred1_0|epred3_0))&(epred2_0|epred3_0|~epred1_0|(~epred2_0|epred1_0|epred3_0)))&((~epred2_0|epred3_0|epred1_0|(~epred2_0|epred1_0|epred3_0))&(~epred3_0|epred2_0|epred1_0|(~epred2_0|epred1_0|epred3_0))))))&(((((~epred2_0|epred3_0|~epred1_0|(~epred1_0|~epred2_0|epred3_0))&(~epred3_0|epred2_0|~epred1_0|(~epred1_0|~epred2_0|epred3_0)))&((~epred2_0|~epred3_0|epred1_0|(~epred1_0|~epred2_0|epred3_0))&(epred2_0|epred3_0|epred1_0|(~epred1_0|~epred2_0|epred3_0))))&(((~epred2_0|epred3_0|~epred1_0|(epred1_0|epred2_0|epred3_0))&(~epred3_0|epred2_0|~epred1_0|(epred1_0|epred2_0|epred3_0)))&((~epred2_0|~epred3_0|epred1_0|(epred1_0|epred2_0|epred3_0))&(epred2_0|epred3_0|epred1_0|(epred1_0|epred2_0|epred3_0)))))&((((~epred2_0|epred3_0|~epred1_0|(~epred1_0|epred2_0|~epred3_0))&(~epred3_0|epred2_0|~epred1_0|(~epred1_0|epred2_0|~epred3_0)))&((~epred2_0|~epred3_0|epred1_0|(~epred1_0|epred2_0|~epred3_0))&(epred2_0|epred3_0|epred1_0|(~epred1_0|epred2_0|~epred3_0))))&(((~epred2_0|epred3_0|~epred1_0|(~epred2_0|epred1_0|~epred3_0))&(~epred3_0|epred2_0|~epred1_0|(~epred2_0|epred1_0|~epred3_0)))&((~epred2_0|~epred3_0|epred1_0|(~epred2_0|epred1_0|~epred3_0))&(epred2_0|epred3_0|epred1_0|(~epred2_0|epred1_0|~epred3_0))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
% 0.06/0.33 cnf(c_0_3, negated_conjecture, (epred2_0|epred1_0|epred1_0|epred2_0|~epred3_0|~epred3_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.06/0.33 cnf(c_0_4, negated_conjecture, (epred2_0|epred3_0|epred1_0|epred1_0|epred2_0|epred3_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.06/0.33 cnf(c_0_5, negated_conjecture, (epred3_0|epred1_0|epred1_0|epred3_0|~epred2_0|~epred2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.06/0.33 cnf(c_0_6, negated_conjecture, (epred1_0|epred2_0|~epred3_0), inference(cn,[status(thm)],[c_0_3])).
% 0.06/0.33 cnf(c_0_7, negated_conjecture, (epred1_0|epred2_0|epred3_0), inference(cn,[status(thm)],[c_0_4])).
% 0.06/0.33 cnf(c_0_8, negated_conjecture, (epred1_0|epred1_0|~epred2_0|~epred3_0|~epred2_0|~epred3_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.06/0.33 cnf(c_0_9, negated_conjecture, (epred1_0|epred3_0|~epred2_0), inference(cn,[status(thm)],[c_0_5])).
% 0.06/0.33 cnf(c_0_10, negated_conjecture, (epred2_0|epred1_0), inference(csr,[status(thm)],[c_0_6, c_0_7])).
% 0.06/0.33 cnf(c_0_11, negated_conjecture, (epred2_0|epred3_0|epred2_0|epred3_0|~epred1_0|~epred1_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.06/0.33 cnf(c_0_12, negated_conjecture, (epred2_0|epred2_0|~epred3_0|~epred1_0|~epred1_0|~epred3_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.06/0.33 cnf(c_0_13, negated_conjecture, (epred1_0|~epred2_0|~epred3_0), inference(cn,[status(thm)],[c_0_8])).
% 0.06/0.33 cnf(c_0_14, negated_conjecture, (epred3_0|epred1_0), inference(csr,[status(thm)],[c_0_9, c_0_10])).
% 0.06/0.33 cnf(c_0_15, negated_conjecture, (epred2_0|epred3_0|~epred1_0), inference(cn,[status(thm)],[c_0_11])).
% 0.06/0.33 cnf(c_0_16, negated_conjecture, (epred3_0|epred3_0|~epred2_0|~epred1_0|~epred1_0|~epred2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.06/0.33 cnf(c_0_17, negated_conjecture, (epred2_0|~epred1_0|~epred3_0), inference(cn,[status(thm)],[c_0_12])).
% 0.06/0.33 cnf(c_0_18, negated_conjecture, (epred1_0), inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_13, c_0_10]), c_0_14])).
% 0.06/0.33 cnf(c_0_19, negated_conjecture, (epred3_0|epred2_0), inference(csr,[status(thm)],[c_0_15, c_0_10])).
% 0.06/0.33 cnf(c_0_20, negated_conjecture, (~epred2_0|~epred3_0|~epred1_0|~epred1_0|~epred2_0|~epred3_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.06/0.33 cnf(c_0_21, negated_conjecture, (epred3_0|~epred1_0|~epred2_0), inference(cn,[status(thm)],[c_0_16])).
% 0.06/0.33 cnf(c_0_22, negated_conjecture, (epred2_0), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])]), c_0_19])).
% 0.06/0.33 cnf(c_0_23, negated_conjecture, (~epred1_0|~epred2_0|~epred3_0), inference(cn,[status(thm)],[c_0_20])).
% 0.06/0.33 cnf(c_0_24, negated_conjecture, (epred3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_18]), c_0_22])])).
% 0.06/0.33 cnf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_18]), c_0_22]), c_0_24])]), ['proof']).
% 0.06/0.33 % SZS output end CNFRefutation
% 0.06/0.33 % Parsed axioms : 1
% 0.06/0.33 % Removed by relevancy pruning/SinE : 0
% 0.06/0.33 % Initial clauses : 32
% 0.06/0.33 % Removed in clause preprocessing : 24
% 0.06/0.33 % Initial clauses in saturation : 8
% 0.06/0.33 % Processed clauses : 8
% 0.06/0.33 % ...of these trivial : 0
% 0.06/0.33 % ...subsumed : 0
% 0.06/0.33 % ...remaining for further processing : 7
% 0.06/0.33 % Other redundant clauses eliminated : 0
% 0.06/0.33 % Clauses deleted for lack of memory : 0
% 0.06/0.33 % Backward-subsumed : 3
% 0.06/0.33 % Backward-rewritten : 1
% 0.06/0.33 % Generated clauses : 0
% 0.06/0.33 % ...of the previous two non-redundant : 0
% 0.06/0.33 % ...aggressively subsumed : 0
% 0.06/0.33 % Contextual simplify-reflections : 6
% 0.06/0.33 % Paramodulations : 0
% 0.06/0.33 % Factorizations : 0
% 0.06/0.33 % NegExts : 0
% 0.06/0.33 % Equation resolutions : 0
% 0.06/0.33 % Disequality decompositions : 0
% 0.06/0.33 % Total rewrite steps : 7
% 0.06/0.33 % ...of those cached : 4
% 0.06/0.33 % Propositional unsat checks : 0
% 0.06/0.33 % Propositional check models : 0
% 0.06/0.33 % Propositional check unsatisfiable : 0
% 0.06/0.33 % Propositional clauses : 0
% 0.06/0.33 % Propositional clauses after purity: 0
% 0.06/0.33 % Propositional unsat core size : 0
% 0.06/0.33 % Propositional preprocessing time : 0.000
% 0.06/0.33 % Propositional encoding time : 0.000
% 0.06/0.33 % Propositional solver time : 0.000
% 0.06/0.33 % Success case prop preproc time : 0.000
% 0.06/0.33 % Success case prop encoding time : 0.000
% 0.06/0.33 % Success case prop solver time : 0.000
% 0.06/0.33 % Current number of processed clauses : 3
% 0.06/0.33 % Positive orientable unit clauses : 3
% 0.06/0.33 % Positive unorientable unit clauses: 0
% 0.06/0.33 % Negative unit clauses : 0
% 0.06/0.33 % Non-unit-clauses : 0
% 0.06/0.33 % Current number of unprocessed clauses: 0
% 0.06/0.33 % ...number of literals in the above : 0
% 0.06/0.33 % Current number of archived formulas : 0
% 0.06/0.33 % Current number of archived clauses : 4
% 0.06/0.33 % Clause-clause subsumption calls (NU) : 7
% 0.06/0.33 % Rec. Clause-clause subsumption calls : 7
% 0.06/0.33 % Non-unit clause-clause subsumptions : 7
% 0.06/0.33 % Unit Clause-clause subsumption calls : 2
% 0.06/0.33 % Rewrite failures with RHS unbound : 0
% 0.06/0.33 % BW rewrite match attempts : 2
% 0.06/0.33 % BW rewrite match successes : 2
% 0.06/0.33 % Condensation attempts : 0
% 0.06/0.33 % Condensation successes : 0
% 0.06/0.33 % Termbank termtop insertions : 1522
% 0.06/0.33 % Search garbage collected termcells : 336
% 0.06/0.33
% 0.06/0.33 % -------------------------------------------------
% 0.06/0.33 % User time : 0.002 s
% 0.06/0.33 % System time : 0.001 s
% 0.06/0.33 % Total time : 0.003 s
% 0.06/0.33 % Maximum resident set size: 3600 pages
% 0.06/0.33
% 0.06/0.33 % -------------------------------------------------
% 0.06/0.33 % User time : 0.003 s
% 0.06/0.33 % System time : 0.003 s
% 0.06/0.33 % Total time : 0.006 s
% 0.06/0.33 % Maximum resident set size: 4608 pages
% 0.06/0.33 % E exiting
%------------------------------------------------------------------------------