0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.12/0.37 % Computer : n014.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.37 % CPULimit : 1440 0.12/0.37 % WCLimit : 180 0.12/0.37 % DateTime : Mon Jul 27 10:05:24 UTC 2026 0.12/0.37 % CPUTime : 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.12/0.42 Running first-order theorem proving 0.12/0.42 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=180 /export/starexec/sandbox/benchmark/theBenchmark.p 0.12/0.45 % Version: 3.5.1 0.12/0.45 % Preprocessing class: FSSSSMSSSSSNFFN. 0.12/0.45 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 900s (5) cores 0.12/0.45 % Starting new_bool_3 with 180s (1) cores 0.12/0.45 % Starting new_bool_1 with 180s (1) cores 0.12/0.45 % Starting sh5l with 180s (1) cores 0.12/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3507234 completed with status 0 0.12/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN 0.12/0.45 % Preprocessing class: FSSSSMSSSSSNFFN. 0.12/0.45 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 900s (5) cores 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 0.12/0.45 % No SInE strategy applied 0.12/0.45 % Search class: FHUNF-FFSF21-DFFFFFNN 0.12/0.45 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 0.12/0.45 % Starting SubtermCWHack with 82s (1) cores 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 91s (1) cores 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 82s (1) cores 0.12/0.45 % Starting new_bool_3 with 82s (1) cores 0.12/0.45 % Starting new_bool_1 with 82s (1) cores 0.12/0.45 % SubtermCWHack with pid 3507240 completed with status 0 0.12/0.45 % Result found by SubtermCWHack 0.12/0.45 % Preprocessing class: FSSSSMSSSSSNFFN. 0.12/0.45 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 900s (5) cores 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 0.12/0.45 % No SInE strategy applied 0.12/0.45 % Search class: FHUNF-FFSF21-DFFFFFNN 0.12/0.45 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 0.12/0.45 % Starting SubtermCWHack with 82s (1) cores 0.12/0.45 % Preprocessing time : 0.001 s 0.12/0.45 0.12/0.45 % Proof found! 0.12/0.45 % SZS status Theorem 0.12/0.45 % SZS output start CNFRefutation 0.12/0.45 fof(condensed_detachment, axiom, ![X4, X5]:((is_a_theorem(X5)|~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', condensed_detachment)). 0.12/0.45 fof(a5, axiom, ![X1, X2, X3, X6, X7]:(is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,implies(X6,X7)),implies(X2,implies(not(X6),not(X1)))),implies(X1,X6))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', a5)). 0.12/0.45 fof(prove_cn_1, conjecture, ![X1, X2, X3]:(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_cn_1)). 0.12/0.45 fof(c_0_3, plain, ![X4, X5]:((is_a_theorem(X5)|~is_a_theorem(X4)|~is_a_theorem(implies(X4,X5)))), inference(fof_simplification,[status(thm)],[condensed_detachment])). 0.12/0.45 fof(c_0_4, plain, ![X11, X12]:((is_a_theorem(X12)|~is_a_theorem(X11)|~is_a_theorem(implies(X11,X12)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_3])])). 0.12/0.45 fof(c_0_5, plain, ![X13, X14, X15, X16, X17]:(is_a_theorem(implies(implies(X13,X14),implies(implies(implies(X15,implies(X16,X17)),implies(X14,implies(not(X16),not(X13)))),implies(X13,X16))))), inference(variable_rename,[status(thm)],[a5])). 0.12/0.45 cnf(c_0_6, plain, (is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.12/0.45 cnf(c_0_7, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,implies(X4,X5)),implies(X2,implies(not(X4),not(X1)))),implies(X1,X4))))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.12/0.45 cnf(c_0_8, plain, (is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,implies(not(X2),not(X5)))),implies(X5,X2)))|~is_a_theorem(implies(X5,X4))), inference(spm,[status(thm)],[c_0_6, c_0_7])). 0.12/0.45 cnf(c_0_9, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(X3,implies(X2,X4)),implies(X5,implies(not(X2),not(X1)))))|~is_a_theorem(implies(X1,X5))), inference(spm,[status(thm)],[c_0_6, c_0_8])). 0.12/0.45 cnf(c_0_10, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,X3))|~is_a_theorem(implies(X3,X2))), inference(spm,[status(thm)],[c_0_9, c_0_8])). 0.12/0.45 cnf(c_0_11, plain, (is_a_theorem(implies(implies(X1,X2),X3))|~is_a_theorem(implies(implies(implies(implies(X4,implies(X5,X6)),implies(X2,implies(not(X5),not(X1)))),implies(X1,X5)),X3))), inference(spm,[status(thm)],[c_0_10, c_0_7])). 0.12/0.45 fof(c_0_12, negated_conjecture, ~(![X1, X2, X3]:(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))), inference(assume_negation,[status(cth)],[prove_cn_1])). 0.12/0.45 cnf(c_0_13, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(X3,X1))), inference(spm,[status(thm)],[c_0_11, c_0_8])). 0.12/0.45 fof(c_0_14, negated_conjecture, ~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])). 0.12/0.45 cnf(c_0_15, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))|~is_a_theorem(implies(X3,implies(implies(X5,implies(X4,X6)),implies(X2,implies(not(X4),not(X1))))))), inference(spm,[status(thm)],[c_0_11, c_0_13])). 0.12/0.45 cnf(c_0_16, negated_conjecture, (~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0))))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.12/0.45 cnf(c_0_17, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))), inference(spm,[status(thm)],[c_0_15, c_0_7])). 0.12/0.45 cnf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])]), ['proof']). 0.12/0.45 % SZS output end CNFRefutation 0.12/0.45 % Parsed axioms : 3 0.12/0.45 % Removed by relevancy pruning/SinE : 0 0.12/0.45 % Initial clauses : 3 0.12/0.45 % Removed in clause preprocessing : 0 0.12/0.45 % Initial clauses in saturation : 3 0.12/0.45 % Processed clauses : 31 0.12/0.45 % ...of these trivial : 0 0.12/0.45 % ...subsumed : 2 0.12/0.45 % ...remaining for further processing : 29 0.12/0.45 % Other redundant clauses eliminated : 0 0.12/0.45 % Clauses deleted for lack of memory : 0 0.12/0.45 % Backward-subsumed : 0 0.12/0.45 % Backward-rewritten : 1 0.12/0.45 % Generated clauses : 115 0.12/0.45 % ...of the previous two non-redundant : 97 0.12/0.45 % ...aggressively subsumed : 0 0.12/0.45 % Contextual simplify-reflections : 0 0.12/0.45 % Paramodulations : 115 0.12/0.45 % Factorizations : 0 0.12/0.45 % NegExts : 0 0.12/0.45 % Equation resolutions : 0 0.12/0.45 % Disequality decompositions : 0 0.12/0.45 % Total rewrite steps : 1 0.12/0.45 % ...of those cached : 0 0.12/0.45 % Propositional unsat checks : 0 0.12/0.45 % Propositional check models : 0 0.12/0.45 % Propositional check unsatisfiable : 0 0.12/0.45 % Propositional clauses : 0 0.12/0.45 % Propositional clauses after purity: 0 0.12/0.45 % Propositional unsat core size : 0 0.12/0.45 % Propositional preprocessing time : 0.000 0.12/0.45 % Propositional encoding time : 0.000 0.12/0.45 % Propositional solver time : 0.000 0.12/0.45 % Success case prop preproc time : 0.000 0.12/0.45 % Success case prop encoding time : 0.000 0.12/0.45 % Success case prop solver time : 0.000 0.12/0.45 % Current number of processed clauses : 28 0.12/0.45 % Positive orientable unit clauses : 3 0.12/0.45 % Positive unorientable unit clauses: 0 0.12/0.45 % Negative unit clauses : 0 0.12/0.45 % Non-unit-clauses : 25 0.12/0.45 % Current number of unprocessed clauses: 69 0.12/0.45 % ...number of literals in the above : 224 0.12/0.45 % Current number of archived formulas : 0 0.12/0.45 % Current number of archived clauses : 1 0.12/0.45 % Clause-clause subsumption calls (NU) : 262 0.12/0.45 % Rec. Clause-clause subsumption calls : 246 0.12/0.45 % Non-unit clause-clause subsumptions : 2 0.12/0.45 % Unit Clause-clause subsumption calls : 6 0.12/0.45 % Rewrite failures with RHS unbound : 0 0.12/0.45 % BW rewrite match attempts : 21 0.12/0.45 % BW rewrite match successes : 1 0.12/0.45 % Condensation attempts : 0 0.12/0.45 % Condensation successes : 0 0.12/0.45 % Termbank termtop insertions : 3487 0.12/0.45 % Search garbage collected termcells : 30 0.12/0.45 0.12/0.45 % ------------------------------------------------- 0.12/0.45 % User time : 0.005 s 0.12/0.45 % System time : 0.003 s 0.12/0.45 % Total time : 0.008 s 0.12/0.45 % Maximum resident set size: 3380 pages 0.12/0.45 0.12/0.45 % ------------------------------------------------- 0.12/0.45 % User time : 0.020 s 0.12/0.45 % System time : 0.015 s 0.12/0.45 % Total time : 0.036 s 0.12/0.45 % Maximum resident set size: 4608 pages 0.12/0.45 % E exiting 0.12/0.45 EOF