↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV083^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n011.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 : Wed Sep 30 08:34:50 AM UTC 2026

% Result   : Theorem 0.09s 0.27s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV083^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n011.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 15:09:48 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.20  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running higher-order theorem proving
% 0.09/0.24  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ZBeqSffGrs/E---3.1_198113.p
% 0.09/0.27  % Version: 3.5.1-ho
% 0.09/0.27  % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.09/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27  % Starting post_as_ho5 with 1500s (5) cores
% 0.09/0.27  % Starting sh2lt with 300s (1) cores
% 0.09/0.27  % Starting ehoh_best8_lambda with 300s (1) cores
% 0.09/0.27  % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.27  % sh2lt with pid 198137 completed with status 0
% 0.09/0.27  % Result found by sh2lt
% 0.09/0.27  % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.09/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27  % Starting post_as_ho5 with 1500s (5) cores
% 0.09/0.27  % Starting sh2lt with 300s (1) cores
% 0.09/0.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.09/0.27  % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.09/0.27  % Search class: HGUNF-FFSF00-SHHFFMBN
% 0.09/0.27  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.27  % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.27  % SubtermCWHack with pid 198145 completed with status 10
% 0.09/0.27  % Starting ehoh_best6_lambda with 181s (1) cores
% 0.09/0.27  % ehoh_best6_lambda with pid 198149 completed with status 0
% 0.09/0.27  % Result found by ehoh_best6_lambda
% 0.09/0.27  % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.09/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27  % Starting post_as_ho5 with 1500s (5) cores
% 0.09/0.27  % Starting sh2lt with 300s (1) cores
% 0.09/0.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.09/0.27  % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.09/0.27  % Search class: HGUNF-FFSF00-SHHFFMBN
% 0.09/0.27  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.27  % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.27  % SubtermCWHack with pid 198145 completed with status 10
% 0.09/0.27  % Starting ehoh_best6_lambda with 181s (1) cores
% 0.09/0.27  % Preprocessing time       : 0.001 s
% 0.09/0.27  % Presaturation interreduction done
% 0.09/0.27  
% 0.09/0.27  % Proof found!
% 0.09/0.27  % SZS status Theorem
% 0.09/0.27  % SZS output start CNFRefutation
% 0.09/0.27  thf(decl_23, type, epred1_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.09/0.27  thf(decl_24, type, epred2_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.09/0.27  thf(decl_25, type, epred3_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.09/0.27  thf(decl_26, type, epred4_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.09/0.27  thf(decl_27, type, epred5_0: $i > $o).
% 0.09/0.27  thf(decl_28, type, epred6_0: $i > $o).
% 0.09/0.27  thf(cTHM120_3_pme, conjecture, (?[X1:($i > $o) > ($i > $o) > $o]:(((~((X1 @ (^[X2:$i]:(($true))) @ (^[X2:$i]:(~($true)))))&![X3:$i > $o]:((X1 @ X3 @ X3)))&![X4:$i > $o, X5:$i > $o, X6:$i > $o]:((((X1 @ X4 @ X5)&(X1 @ X5 @ X6))=>(X1 @ X4 @ X6)))))&($true)), file('/export/starexec/sandbox2/tmp/tmp.ZBeqSffGrs/E---3.1_198113.p', cTHM120_3_pme)).
% 0.09/0.27  thf(c_0_1, negated_conjecture, ~((?[X1:($i > $o) > ($i > $o) > $o]:(((~((X1 @ (^[X2:$i]:(($true))) @ (^[X2:$i]:(~($true)))))&![X3:$i > $o]:((X1 @ X3 @ X3)))&![X4:$i > $o, X5:$i > $o, X6:$i > $o]:((((X1 @ X4 @ X5)&(X1 @ X5 @ X6))=>(X1 @ X4 @ X6)))))&($true))), inference(assume_negation,[status(cth)],[cTHM120_3_pme])).
% 0.09/0.27  thf(c_0_2, negated_conjecture, ~((?[X1:($i > $o) > ($i > $o) > $o]:(((~((X1 @ (^[Z0:$i]:($true)) @ (^[Z0:$i]:(~($true)))))&![X3:$i > $o]:((X1 @ X3 @ X3)))&![X4:$i > $o, X5:$i > $o, X6:$i > $o]:((((X1 @ X4 @ X5)&(X1 @ X5 @ X6))=>(X1 @ X4 @ X6)))))&$true)), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.09/0.27  thf(c_0_3, negated_conjecture, ![X12:($i > $o) > ($i > $o) > $o]:(((((X12 @ (epred2_1 @ X12) @ (epred3_1 @ X12))|((X12 @ (^[Z0:$i]:($true)) @ (^[Z0:$i]:(~($true))))|~(X12 @ (epred1_1 @ X12) @ (epred1_1 @ X12)))|~($true))&((X12 @ (epred3_1 @ X12) @ (epred4_1 @ X12))|((X12 @ (^[Z0:$i]:($true)) @ (^[Z0:$i]:(~($true))))|~(X12 @ (epred1_1 @ X12) @ (epred1_1 @ X12)))|~($true)))&(~(X12 @ (epred2_1 @ X12) @ (epred4_1 @ X12))|((X12 @ (^[Z0:$i]:($true)) @ (^[Z0:$i]:(~($true))))|~(X12 @ (epred1_1 @ X12) @ (epred1_1 @ X12)))|~($true)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])).
% 0.09/0.27  thf(c_0_4, plain, ![X18:$i]:(((epred6_0 @ X18)<=>~(($true)))), introduced(definition)).
% 0.09/0.27  thf(c_0_5, plain, ![X17:$i]:(((epred5_0 @ X17)<=>($true))), introduced(definition)).
% 0.09/0.27  thf(c_0_6, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((((X1 @ epred5_0 @ epred6_0))=(($true)))|~((X1 @ (epred2_1 @ X1) @ (epred4_1 @ X1)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1)))|~(($true)))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4]), c_0_5])).
% 0.09/0.27  thf(c_0_7, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|(((X1 @ epred5_0 @ epred6_0))=(($true)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1)))|~(($true)))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4]), c_0_5])).
% 0.09/0.27  thf(c_0_8, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((((X1 @ epred5_0 @ epred6_0))=(($true)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1)))|~((X1 @ (epred2_1 @ X1) @ (epred4_1 @ X1))))), inference(cn,[status(thm)],[c_0_6])).
% 0.09/0.27  thf(c_0_9, plain, ![X24:$i]:(((~(epred5_0 @ X24)|($true))&(~($true)|(epred5_0 @ X24)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.09/0.27  thf(c_0_10, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|(((X1 @ epred5_0 @ epred6_0))=(($true)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(cn,[status(thm)],[c_0_7])).
% 0.09/0.27  thf(c_0_11, plain, ![X23:$i]:(((~(epred6_0 @ X23)|~($true))&(($true)|(epred6_0 @ X23)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.09/0.27  thf(c_0_12, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ epred5_0 @ epred6_0)|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1)))|~((X1 @ (epred2_1 @ X1) @ (epred4_1 @ X1))))), inference(cn,[status(thm)],[c_0_8])).
% 0.09/0.27  thf(c_0_13, plain, ![X2:$i]:(((epred5_0 @ X2)|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.09/0.27  thf(c_0_14, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|(X1 @ epred5_0 @ epred6_0)|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(cn,[status(thm)],[c_0_10])).
% 0.09/0.27  thf(c_0_15, plain, ![X2:$i]:((~((epred6_0 @ X2))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.09/0.27  thf(c_0_16, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred3_1 @ X1) @ (epred4_1 @ X1))|(((X1 @ epred5_0 @ epred6_0))=(($true)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1)))|~(($true)))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4]), c_0_5])).
% 0.09/0.27  thf(c_0_17, negated_conjecture, (((epred6_0)=(epred5_0))|((epred2_1 @ $eq)!=(epred4_1 @ $eq))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_12])).
% 0.09/0.27  thf(c_0_18, plain, ![X2:$i]:((epred5_0 @ X2)), inference(cn,[status(thm)],[c_0_13])).
% 0.09/0.27  thf(c_0_19, negated_conjecture, (((epred2_1 @ $eq)=(epred3_1 @ $eq))|((epred6_0)=(epred5_0))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_14])).
% 0.09/0.27  thf(c_0_20, plain, ![X2:$i]:(~((epred6_0 @ X2))), inference(cn,[status(thm)],[c_0_15])).
% 0.09/0.27  thf(c_0_21, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred3_1 @ X1) @ (epred4_1 @ X1))|(((X1 @ epred5_0 @ epred6_0))=(($true)))|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(cn,[status(thm)],[c_0_16])).
% 0.09/0.27  thf(c_0_22, negated_conjecture, ![X2:$i]:(((epred6_0 @ X2)|((epred2_1 @ $eq)!=(epred4_1 @ $eq)))), inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_17]), c_0_18])).
% 0.09/0.27  thf(c_0_23, negated_conjecture, ((epred2_1 @ $eq)=(epred3_1 @ $eq)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_19]), c_0_18]), c_0_20])).
% 0.09/0.27  thf(c_0_24, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred3_1 @ X1) @ (epred4_1 @ X1))|(X1 @ epred5_0 @ epred6_0)|~((X1 @ (epred1_1 @ X1) @ (epred1_1 @ X1))))), inference(cn,[status(thm)],[c_0_21])).
% 0.09/0.27  thf(c_0_25, negated_conjecture, ((epred3_1 @ $eq)!=(epred4_1 @ $eq)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23]), c_0_20])).
% 0.09/0.27  thf(c_0_26, negated_conjecture, ((epred6_0)=(epred5_0)), inference(sr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_24]), c_0_25])).
% 0.09/0.27  thf(c_0_27, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_26]), c_0_18]), c_0_20]), ['proof']).
% 0.09/0.27  % SZS output end CNFRefutation
% 0.09/0.27  % Parsed axioms                        : 1
% 0.09/0.27  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.27  % Initial clauses                      : 7
% 0.09/0.27  % Removed in clause preprocessing      : 2
% 0.09/0.27  % Initial clauses in saturation        : 5
% 0.09/0.27  % Processed clauses                    : 73
% 0.09/0.27  % ...of these trivial                  : 1
% 0.09/0.27  % ...subsumed                          : 9
% 0.09/0.27  % ...remaining for further processing  : 63
% 0.09/0.27  % Other redundant clauses eliminated   : 14
% 0.09/0.27  % Clauses deleted for lack of memory   : 0
% 0.09/0.27  % Backward-subsumed                    : 3
% 0.09/0.27  % Backward-rewritten                   : 8
% 0.09/0.27  % Generated clauses                    : 158
% 0.09/0.27  % ...of the previous two non-redundant : 113
% 0.09/0.27  % ...aggressively subsumed             : 0
% 0.09/0.27  % Contextual simplify-reflections      : 0
% 0.09/0.27  % Paramodulations                      : 28
% 0.09/0.27  % Factorizations                       : 0
% 0.09/0.27  % NegExts                              : 15
% 0.09/0.27  % Equation resolutions                 : 14
% 0.09/0.27  % Disequality decompositions           : 0
% 0.09/0.27  % Total rewrite steps                  : 26
% 0.09/0.27  % ...of those cached                   : 11
% 0.09/0.27  % Propositional unsat checks           : 0
% 0.09/0.27  %    Propositional check models        : 0
% 0.09/0.27  %    Propositional check unsatisfiable : 0
% 0.09/0.27  %    Propositional clauses             : 0
% 0.09/0.27  %    Propositional clauses after purity: 0
% 0.09/0.27  %    Propositional unsat core size     : 0
% 0.09/0.27  %    Propositional preprocessing time  : 0.000
% 0.09/0.27  %    Propositional encoding time       : 0.000
% 0.09/0.27  %    Propositional solver time         : 0.000
% 0.09/0.27  %    Success case prop preproc time    : 0.000
% 0.09/0.27  %    Success case prop encoding time   : 0.000
% 0.09/0.27  %    Success case prop solver time     : 0.000
% 0.09/0.27  % Current number of processed clauses  : 31
% 0.09/0.27  %    Positive orientable unit clauses  : 3
% 0.09/0.27  %    Positive unorientable unit clauses: 0
% 0.09/0.27  %    Negative unit clauses             : 2
% 0.09/0.27  %    Non-unit-clauses                  : 26
% 0.09/0.27  % Current number of unprocessed clauses: 42
% 0.09/0.27  % ...number of literals in the above   : 117
% 0.09/0.27  % Current number of archived formulas  : 0
% 0.09/0.27  % Current number of archived clauses   : 32
% 0.09/0.27  % Clause-clause subsumption calls (NU) : 101
% 0.09/0.27  % Rec. Clause-clause subsumption calls : 91
% 0.09/0.27  % Non-unit clause-clause subsumptions  : 10
% 0.09/0.27  % Unit Clause-clause subsumption calls : 6
% 0.09/0.27  % Rewrite failures with RHS unbound    : 0
% 0.09/0.27  % BW rewrite match attempts            : 2
% 0.09/0.27  % BW rewrite match successes           : 2
% 0.09/0.27  % Condensation attempts                : 0
% 0.09/0.27  % Condensation successes               : 0
% 0.09/0.27  % Termbank termtop insertions          : 11425
% 0.09/0.27  % Search garbage collected termcells   : 173
% 0.09/0.27  
% 0.09/0.27  % -------------------------------------------------
% 0.09/0.27  % User time                : 0.013 s
% 0.09/0.27  % System time              : 0.003 s
% 0.09/0.27  % Total time               : 0.016 s
% 0.09/0.27  % Maximum resident set size: 3888 pages
% 0.09/0.27  
% 0.09/0.27  % -------------------------------------------------
% 0.09/0.27  % User time                : 0.013 s
% 0.09/0.27  % System time              : 0.006 s
% 0.09/0.27  % Total time               : 0.019 s
% 0.09/0.27  % Maximum resident set size: 4864 pages
% 0.09/0.27  % E exiting
%------------------------------------------------------------------------------