↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n015.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:35:30 AM UTC 2026

% Result   : Theorem 0.07s 0.26s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV417^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n015.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 15:49:03 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22  Running higher-order theorem proving
% 0.07/0.24  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Hzx2ExNAso/E---3.1_3695453.p
% 0.07/0.26  % Version: 3.5.1-ho
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSMNSSA.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting sh3 with 1500s (5) cores
% 0.07/0.26  % Starting lpo8_s with 300s (1) cores
% 0.07/0.26  % Starting sh2lt with 300s (1) cores
% 0.07/0.26  % Starting sh2l with 300s (1) cores
% 0.07/0.26  % sh3 with pid 3695466 completed with status 0
% 0.07/0.26  % Result found by sh3
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSMNSSA.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting sh3 with 1500s (5) cores
% 0.07/0.26  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26  % No SInE strategy applied
% 0.07/0.26  % Search class: HHHNF-FFSF00-SSSFFFNN
% 0.07/0.26  % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.26  % Starting SubtermCWHack with 151s (1) cores
% 0.07/0.26  % Starting sh3 with 901s (1) cores
% 0.07/0.26  % Starting sh5l with 151s (1) cores
% 0.07/0.26  % Starting new_bool_3 with 151s (1) cores
% 0.07/0.26  % Starting new_bool_1 with 146s (1) cores
% 0.07/0.26  % SubtermCWHack with pid 3695471 completed with status 10
% 0.07/0.26  % sh3 with pid 3695474 completed with status 0
% 0.07/0.26  % Result found by sh3
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSMNSSA.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting sh3 with 1500s (5) cores
% 0.07/0.26  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26  % No SInE strategy applied
% 0.07/0.26  % Search class: HHHNF-FFSF00-SSSFFFNN
% 0.07/0.26  % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.26  % Starting SubtermCWHack with 151s (1) cores
% 0.07/0.26  % Starting sh3 with 901s (1) cores
% 0.07/0.26  % Preprocessing time       : 0.001 s
% 0.07/0.26  % Presaturation interreduction done
% 0.07/0.26  
% 0.07/0.26  % Proof found!
% 0.07/0.26  % SZS status Theorem
% 0.07/0.26  % SZS output start CNFRefutation
% 0.07/0.26  thf(decl_sort1, type, a: $tType).
% 0.07/0.26  thf(decl_23, type, cP: (a > $o) > $o).
% 0.07/0.26  thf(decl_24, type, epred1_0: a > $o).
% 0.07/0.26  thf(decl_25, type, epred2_0: a > $o).
% 0.07/0.26  thf(decl_26, type, epred3_0: a > $o).
% 0.07/0.26  thf(decl_27, type, esk1_0: a).
% 0.07/0.26  thf(decl_28, type, epred4_0: a > $o).
% 0.07/0.26  thf(decl_29, type, epred5_0: a > $o).
% 0.07/0.26  thf(decl_30, type, esk6_0: a).
% 0.07/0.26  thf(cTHM502_pme, conjecture, ![X1:a > $o, X2:a > $o, X3:a > $o]:(((((![X4:a]:(((X1 @ X4)=>(X2 @ X4)))&![X4:a]:(((X1 @ X4)=>(X3 @ X4))))&((^[X4:a]:((((X2 @ X4))&((X3 @ X4)))))=(^[X4:a]:(~($true)))))&(cP @ (^[X4:a]:((((X2 @ X4))&((X3 @ X4)))))))=>(((X1)=(^[X4:a]:(~($true))))&(cP @ (^[X4:a]:(~($true))))))), file('/export/starexec/sandbox/tmp/tmp.Hzx2ExNAso/E---3.1_3695453.p', cTHM502_pme)).
% 0.07/0.26  thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o, X3:a > $o]:(((((![X4:a]:(((X1 @ X4)=>(X2 @ X4)))&![X4:a]:(((X1 @ X4)=>(X3 @ X4))))&((^[X4:a]:((((X2 @ X4))&((X3 @ X4)))))=(^[X4:a]:(~($true)))))&(cP @ (^[X4:a]:((((X2 @ X4))&((X3 @ X4)))))))=>(((X1)=(^[X4:a]:(~($true))))&(cP @ (^[X4:a]:(~($true)))))))), inference(assume_negation,[status(cth)],[cTHM502_pme])).
% 0.07/0.26  thf(c_0_2, negated_conjecture, ~(![X1:a > $o, X2:a > $o, X3:a > $o]:(((((![X4:a]:(((X1 @ X4)=>(X2 @ X4)))&![X4:a]:(((X1 @ X4)=>(X3 @ X4))))&![X10:a]:((((X2 @ X10)&(X3 @ X10))<=>~($true))))&(cP @ (^[Z0:a]:(((X2 @ Z0)&(X3 @ Z0))))))=>(![X11:a]:(((X1 @ X11)<=>~($true)))&(cP @ (^[Z0:a]:(~($true)))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])).
% 0.07/0.26  thf(c_0_3, negated_conjecture, ![X15:a, X16:a, X17:a]:((((((~(epred1_0 @ X15)|(epred2_0 @ X15))&(~(epred1_0 @ X16)|(epred3_0 @ X16)))&((~(epred2_0 @ X17)|~(epred3_0 @ X17)|~($true))&(((epred2_0 @ X17)|($true))&((epred3_0 @ X17)|($true)))))&(cP @ (^[Z0:a]:(((epred2_0 @ Z0)&(epred3_0 @ Z0))))))&((~(epred1_0 @ esk1_0)|($true)|~(cP @ (^[Z0:a]:(~($true)))))&((epred1_0 @ esk1_0)|~($true)|~(cP @ (^[Z0:a]:(~($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.07/0.26  thf(c_0_4, plain, ![X19:a]:(((epred4_0 @ X19)<=>~(($true)))), introduced(definition)).
% 0.07/0.26  thf(c_0_5, negated_conjecture, ((epred1_0 @ esk1_0)|~(($true))|~((((cP @ epred4_0))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.07/0.26  thf(c_0_6, plain, ![X21:a]:(((epred5_0 @ X21)<=>((epred2_0 @ X21)&(epred3_0 @ X21)))), introduced(definition)).
% 0.07/0.26  thf(c_0_7, negated_conjecture, ((epred1_0 @ esk1_0)|~((((cP @ epred4_0))=(($true))))), inference(cn,[status(thm)],[c_0_5])).
% 0.07/0.26  thf(c_0_8, negated_conjecture, (((cP @ epred5_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_6])).
% 0.07/0.26  thf(c_0_9, negated_conjecture, ((epred1_0 @ esk1_0)|~((cP @ epred4_0))), inference(cn,[status(thm)],[c_0_7])).
% 0.07/0.26  thf(c_0_10, negated_conjecture, (cP @ epred5_0), inference(cn,[status(thm)],[c_0_8])).
% 0.07/0.26  thf(c_0_11, plain, ![X22:a]:(((~(epred4_0 @ X22)|~($true))&(($true)|(epred4_0 @ X22)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.07/0.26  thf(c_0_12, plain, ((epred1_0 @ esk1_0)|((epred4_0)!=(epred5_0))), inference(ext_sup,[status(thm)],[c_0_9, c_0_10])).
% 0.07/0.26  thf(c_0_13, plain, ![X4:a]:((~((epred4_0 @ X4))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.07/0.26  thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred2_0 @ X4))|~((epred3_0 @ X4))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.07/0.26  thf(c_0_15, plain, ![X23:a]:(((((epred2_0 @ X23)|~(epred5_0 @ X23))&((epred3_0 @ X23)|~(epred5_0 @ X23)))&(~(epred2_0 @ X23)|~(epred3_0 @ X23)|(epred5_0 @ X23)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.07/0.26  thf(c_0_16, plain, ((epred1_0 @ esk1_0)|((epred4_0 @ esk6_0)<~>(epred5_0 @ esk6_0))), inference(neg_ext,[status(thm)],[c_0_12])).
% 0.07/0.26  thf(c_0_17, plain, ![X4:a]:(~((epred4_0 @ X4))), inference(cn,[status(thm)],[c_0_13])).
% 0.07/0.26  thf(c_0_18, negated_conjecture, ![X4:a]:((~((epred2_0 @ X4))|~((epred3_0 @ X4)))), inference(cn,[status(thm)],[c_0_14])).
% 0.07/0.26  thf(c_0_19, plain, ![X4:a]:(((epred3_0 @ X4)|~((epred5_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_15])).
% 0.07/0.26  thf(c_0_20, plain, ![X4:a]:(((epred2_0 @ X4)|~((epred5_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_15])).
% 0.07/0.26  thf(c_0_21, plain, ((epred1_0 @ esk1_0)|(epred5_0 @ esk6_0)), inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_16]), c_0_17])).
% 0.07/0.26  thf(c_0_22, negated_conjecture, ![X4:a]:(~((epred5_0 @ X4))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])).
% 0.07/0.26  thf(c_0_23, negated_conjecture, ![X4:a]:(((epred3_0 @ X4)|~((epred1_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.07/0.26  thf(c_0_24, plain, (epred1_0 @ esk1_0), inference(sr,[status(thm)],[c_0_21, c_0_22])).
% 0.07/0.26  thf(c_0_25, negated_conjecture, (epred3_0 @ esk1_0), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 0.07/0.26  thf(c_0_26, negated_conjecture, ![X4:a]:(((epred2_0 @ X4)|~((epred1_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.07/0.26  thf(c_0_27, negated_conjecture, ~((epred2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_18, c_0_25])).
% 0.07/0.26  thf(c_0_28, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_24]), c_0_27]), ['proof']).
% 0.07/0.26  % SZS output end CNFRefutation
% 0.07/0.26  % Parsed axioms                        : 3
% 0.07/0.26  % Removed by relevancy pruning/SinE    : 0
% 0.07/0.26  % Initial clauses                      : 15
% 0.07/0.26  % Removed in clause preprocessing      : 6
% 0.07/0.26  % Initial clauses in saturation        : 9
% 0.07/0.26  % Processed clauses                    : 27
% 0.07/0.26  % ...of these trivial                  : 0
% 0.07/0.26  % ...subsumed                          : 1
% 0.07/0.26  % ...remaining for further processing  : 25
% 0.07/0.26  % Other redundant clauses eliminated   : 0
% 0.07/0.26  % Clauses deleted for lack of memory   : 0
% 0.07/0.26  % Backward-subsumed                    : 4
% 0.07/0.26  % Backward-rewritten                   : 1
% 0.07/0.26  % Generated clauses                    : 16
% 0.07/0.26  % ...of the previous two non-redundant : 16
% 0.07/0.26  % ...aggressively subsumed             : 0
% 0.07/0.26  % Contextual simplify-reflections      : 1
% 0.07/0.26  % Paramodulations                      : 9
% 0.07/0.26  % Factorizations                       : 0
% 0.07/0.26  % NegExts                              : 3
% 0.07/0.26  % Equation resolutions                 : 0
% 0.07/0.26  % Disequality decompositions           : 0
% 0.07/0.26  % Total rewrite steps                  : 1
% 0.07/0.26  % ...of those cached                   : 0
% 0.07/0.26  % Propositional unsat checks           : 0
% 0.07/0.26  %    Propositional check models        : 0
% 0.07/0.26  %    Propositional check unsatisfiable : 0
% 0.07/0.26  %    Propositional clauses             : 0
% 0.07/0.26  %    Propositional clauses after purity: 0
% 0.07/0.26  %    Propositional unsat core size     : 0
% 0.07/0.26  %    Propositional preprocessing time  : 0.000
% 0.07/0.26  %    Propositional encoding time       : 0.000
% 0.07/0.26  %    Propositional solver time         : 0.000
% 0.07/0.26  %    Success case prop preproc time    : 0.000
% 0.07/0.26  %    Success case prop encoding time   : 0.000
% 0.07/0.26  %    Success case prop solver time     : 0.000
% 0.07/0.26  % Current number of processed clauses  : 10
% 0.07/0.26  %    Positive orientable unit clauses  : 3
% 0.07/0.26  %    Positive unorientable unit clauses: 0
% 0.07/0.26  %    Negative unit clauses             : 4
% 0.07/0.26  %    Non-unit-clauses                  : 3
% 0.07/0.26  % Current number of unprocessed clauses: 6
% 0.07/0.26  % ...number of literals in the above   : 12
% 0.07/0.26  % Current number of archived formulas  : 0
% 0.07/0.26  % Current number of archived clauses   : 15
% 0.07/0.26  % Clause-clause subsumption calls (NU) : 3
% 0.07/0.26  % Rec. Clause-clause subsumption calls : 3
% 0.07/0.26  % Non-unit clause-clause subsumptions  : 2
% 0.07/0.26  % Unit Clause-clause subsumption calls : 5
% 0.07/0.26  % Rewrite failures with RHS unbound    : 0
% 0.07/0.26  % BW rewrite match attempts            : 1
% 0.07/0.26  % BW rewrite match successes           : 1
% 0.07/0.26  % Condensation attempts                : 0
% 0.07/0.26  % Condensation successes               : 0
% 0.07/0.26  % Termbank termtop insertions          : 1360
% 0.07/0.26  % Search garbage collected termcells   : 376
% 0.07/0.26  
% 0.07/0.26  % -------------------------------------------------
% 0.07/0.26  % User time                : 0.007 s
% 0.07/0.26  % System time              : 0.003 s
% 0.07/0.26  % Total time               : 0.010 s
% 0.07/0.26  % Maximum resident set size: 3632 pages
% 0.07/0.26  
% 0.07/0.26  % -------------------------------------------------
% 0.07/0.26  % User time                : 0.016 s
% 0.07/0.26  % System time              : 0.006 s
% 0.07/0.26  % Total time               : 0.022 s
% 0.07/0.26  % Maximum resident set size: 4608 pages
% 0.07/0.26  % E exiting
%------------------------------------------------------------------------------