%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO021_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 : n020.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:18 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO021_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n020.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 11:34:47 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % new_bool_3 with pid 2811934 completed with status 0
% 0.12/0.44 % Result found by new_bool_3
% 0.12/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 2811938 completed with status 0
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Theorem
% 0.12/0.44 % SZS output start CNFRefutation
% 0.12/0.44 tff(decl_23, type, epred1_0: $o).
% 0.12/0.44 tff(decl_24, type, epred2_0: $o).
% 0.12/0.44 fof(conj, conjecture, ![X1:$o, X2:$o]:(((X1&X2)<=>~((~(X1)|~(X2))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj)).
% 0.12/0.44 fof(c_0_1, negated_conjecture, ~(![X1:$o, X2:$o]:(((X1&X2)<=>~((~(X1)|~(X2)))))), inference(assume_negation,[status(cth)],[conj])).
% 0.12/0.44 fof(c_0_2, negated_conjecture, ~(![X1:$o, X2:$o]:(((X1&X2)<=>~((~X1|~X2))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.12/0.44 fof(c_0_3, negated_conjecture, ((~epred1_0|~epred2_0|(~epred1_0|~epred2_0))&(((epred1_0|epred1_0)&(epred2_0|epred1_0))&((epred1_0|epred2_0)&(epred2_0|epred2_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_2])])])])])).
% 0.12/0.44 cnf(c_0_4, negated_conjecture, (~epred1_0|~epred2_0|~epred1_0|~epred2_0), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.12/0.44 cnf(c_0_5, negated_conjecture, (epred1_0|epred1_0), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.12/0.44 cnf(c_0_6, negated_conjecture, (epred2_0|epred2_0), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.12/0.44 cnf(c_0_7, negated_conjecture, (~epred1_0|~epred2_0), inference(cn,[status(thm)],[c_0_4])).
% 0.12/0.44 cnf(c_0_8, negated_conjecture, (epred1_0), inference(cn,[status(thm)],[c_0_5])).
% 0.12/0.44 cnf(c_0_9, negated_conjecture, (epred2_0), inference(cn,[status(thm)],[c_0_6])).
% 0.12/0.44 cnf(c_0_10, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8]), c_0_9])]), ['proof']).
% 0.12/0.44 % SZS output end CNFRefutation
% 0.12/0.44 % Parsed axioms : 1
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 5
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 5
% 0.12/0.44 % Processed clauses : 5
% 0.12/0.44 % ...of these trivial : 2
% 0.12/0.44 % ...subsumed : 0
% 0.12/0.44 % ...remaining for further processing : 2
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 0
% 0.12/0.44 % Backward-rewritten : 0
% 0.12/0.44 % Generated clauses : 0
% 0.12/0.44 % ...of the previous two non-redundant : 0
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 0
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 6
% 0.12/0.44 % ...of those cached : 4
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 2
% 0.12/0.44 % Positive orientable unit clauses : 2
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 0
% 0.12/0.44 % Non-unit-clauses : 0
% 0.12/0.44 % Current number of unprocessed clauses: 0
% 0.12/0.44 % ...number of literals in the above : 0
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 0
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.12/0.44 % Non-unit clause-clause subsumptions : 0
% 0.12/0.44 % Unit Clause-clause subsumption calls : 0
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 0
% 0.12/0.44 % BW rewrite match successes : 0
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 235
% 0.12/0.44 % Search garbage collected termcells : 48
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.002 s
% 0.12/0.44 % System time : 0.001 s
% 0.12/0.44 % Total time : 0.003 s
% 0.12/0.44 % Maximum resident set size: 3624 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.004 s
% 0.12/0.44 % System time : 0.005 s
% 0.12/0.44 % Total time : 0.009 s
% 0.12/0.44 % Maximum resident set size: 4608 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------