↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n016.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:20:09 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  : PHI045^6 : TPTP v9.3.1. Released v9.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n016.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 13:25:04 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.07/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.eWfSpjaviL/E---3.1_331473.p
% 0.07/0.26  % Version: 3.5.1-ho
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting new_ho_14 with 1500s (5) cores
% 0.07/0.26  % Starting full_lambda_8 with 300s (1) cores
% 0.07/0.26  % Starting new_ho_13 with 300s (1) cores
% 0.07/0.26  % Starting ho_unfolding_3 with 300s (1) cores
% 0.07/0.26  % new_ho_14 with pid 331507 completed with status 0
% 0.07/0.26  % Result found by new_ho_14
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting new_ho_14 with 1500s (5) cores
% 0.07/0.26  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.26  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.26  % Search class: HGUNF-FFSF22-SSFFFSBN
% 0.07/0.26  % partial match(1): HGUNF-FFSF22-SSSFFSBN
% 0.07/0.26  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.26  % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.26  % Starting new_ho_14 with 151s (1) cores
% 0.07/0.26  % Starting lpo8_s with 136s (1) cores
% 0.07/0.26  % Starting sh2lt with 136s (1) cores
% 0.07/0.26  % Starting sh2l with 136s (1) cores
% 0.07/0.26  % SubtermCWHack with pid 331511 completed with status 0
% 0.07/0.26  % Result found by SubtermCWHack
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting new_ho_14 with 1500s (5) cores
% 0.07/0.26  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.26  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.26  % Search class: HGUNF-FFSF22-SSFFFSBN
% 0.07/0.26  % partial match(1): HGUNF-FFSF22-SSSFFSBN
% 0.07/0.26  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.26  % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.26  % Preprocessing time       : 0.001 s
% 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, entity: $tType).
% 0.07/0.26  thf(decl_23, type, god_like: entity > $o).
% 0.07/0.26  thf(decl_24, type, positive_property: (entity > $o) > $o).
% 0.07/0.26  thf(decl_25, type, esk1_2: (entity > $o) > (entity > $o) > entity).
% 0.07/0.26  thf(decl_26, type, epred1_0: entity > $o).
% 0.07/0.26  thf(coro1, axiom, ~((positive_property @ (^[X1:entity]:(((X1)!=(X1)))))), file('/export/starexec/sandbox2/tmp/tmp.eWfSpjaviL/E---3.1_331473.p', coro1)).
% 0.07/0.26  thf(coro2, axiom, ![X2:entity > $o, X3:entity > $o]:((((positive_property @ X2)&![X4:entity]:(((X2 @ X4)=>(X3 @ X4))))=>(positive_property @ X3))), file('/export/starexec/sandbox2/tmp/tmp.eWfSpjaviL/E---3.1_331473.p', coro2)).
% 0.07/0.26  thf(conj_1, conjecture, ?[X1:entity]:((god_like @ X1)), file('/export/starexec/sandbox2/tmp/tmp.eWfSpjaviL/E---3.1_331473.p', conj_1)).
% 0.07/0.26  thf(axiom3, axiom, (positive_property @ god_like), file('/export/starexec/sandbox2/tmp/tmp.eWfSpjaviL/E---3.1_331473.p', axiom3)).
% 0.07/0.26  thf(c_0_4, plain, ~(positive_property @ (^[Z0:entity]:(~(((Z0)=(Z0)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[coro1])])).
% 0.07/0.26  thf(c_0_5, plain, ![X10:entity > $o, X11:entity > $o]:((((X10 @ (esk1_2 @ X10 @ X11))|~(positive_property @ X10)|(positive_property @ X11))&(~(X11 @ (esk1_2 @ X10 @ X11))|~(positive_property @ X10)|(positive_property @ X11)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[coro2])])])])])).
% 0.07/0.26  thf(c_0_6, negated_conjecture, ~(?[X1:entity]:((god_like @ X1))), inference(assume_negation,[status(cth)],[conj_1])).
% 0.07/0.26  thf(c_0_7, plain, ~(positive_property @ (^[Z0:entity]:(~(((Z0)=(Z0)))))), inference(fof_nnf,[status(thm)],[c_0_4])).
% 0.07/0.26  thf(c_0_8, plain, ![X13:entity]:(((epred1_0 @ X13)<=>~(((X13)=(X13))))), introduced(definition)).
% 0.07/0.26  thf(c_0_9, plain, ![X3:entity > $o, X2:entity > $o]:(((X2 @ (esk1_2 @ X2 @ X3))|(positive_property @ X3)|~((positive_property @ X2)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.07/0.26  thf(c_0_10, plain, ?[X16:entity]:((god_like @ X16)), conj_1).
% 0.07/0.26  thf(c_0_11, negated_conjecture, ![X9:entity]:(~(god_like @ X9)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
% 0.07/0.26  thf(c_0_12, plain, ~((((positive_property @ epred1_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]), c_0_8])).
% 0.07/0.26  thf(c_0_13, plain, ![X3:entity > $o]:(((positive_property @ X3)|(god_like @ (esk1_2 @ god_like @ X3))|~((positive_property @ god_like)))), inference(trigger,[status(thm)],[c_0_9, c_0_10])).
% 0.07/0.26  thf(c_0_14, plain, (positive_property @ god_like), inference(split_conjunct,[status(thm)],[axiom3])).
% 0.07/0.26  thf(c_0_15, negated_conjecture, ![X1:entity]:(~((god_like @ X1))), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.07/0.26  thf(c_0_16, plain, ~((positive_property @ epred1_0)), inference(cn,[status(thm)],[c_0_12])).
% 0.07/0.26  thf(c_0_17, plain, ![X2:entity > $o]:((positive_property @ X2)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])]), c_0_15])).
% 0.07/0.26  thf(c_0_18, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])]), ['proof']).
% 0.07/0.26  % SZS output end CNFRefutation
% 0.07/0.26  % Parsed axioms                        : 7
% 0.07/0.26  % Removed by relevancy pruning/SinE    : 3
% 0.07/0.26  % Initial clauses                      : 7
% 0.07/0.26  % Removed in clause preprocessing      : 1
% 0.07/0.26  % Initial clauses in saturation        : 10
% 0.07/0.26  % Processed clauses                    : 5
% 0.07/0.26  % ...of these trivial                  : 0
% 0.07/0.26  % ...subsumed                          : 0
% 0.07/0.26  % ...remaining for further processing  : 5
% 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                    : 0
% 0.07/0.26  % Backward-rewritten                   : 2
% 0.07/0.26  % Generated clauses                    : 0
% 0.07/0.26  % ...of the previous two non-redundant : 0
% 0.07/0.26  % ...aggressively subsumed             : 0
% 0.07/0.26  % Contextual simplify-reflections      : 0
% 0.07/0.26  % Paramodulations                      : 0
% 0.07/0.26  % Factorizations                       : 0
% 0.07/0.26  % NegExts                              : 0
% 0.07/0.26  % Equation resolutions                 : 0
% 0.07/0.26  % Disequality decompositions           : 0
% 0.07/0.26  % Total rewrite steps                  : 3
% 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  : 3
% 0.07/0.26  %    Positive orientable unit clauses  : 1
% 0.07/0.26  %    Positive unorientable unit clauses: 0
% 0.07/0.26  %    Negative unit clauses             : 2
% 0.07/0.26  %    Non-unit-clauses                  : 0
% 0.07/0.26  % Current number of unprocessed clauses: 5
% 0.07/0.26  % ...number of literals in the above   : 15
% 0.07/0.26  % Current number of archived formulas  : 0
% 0.07/0.26  % Current number of archived clauses   : 3
% 0.07/0.26  % Clause-clause subsumption calls (NU) : 0
% 0.07/0.26  % Rec. Clause-clause subsumption calls : 0
% 0.07/0.26  % Non-unit clause-clause subsumptions  : 0
% 0.07/0.26  % Unit Clause-clause subsumption calls : 0
% 0.07/0.26  % Rewrite failures with RHS unbound    : 0
% 0.07/0.26  % BW rewrite match attempts            : 2
% 0.07/0.26  % BW rewrite match successes           : 2
% 0.07/0.26  % Condensation attempts                : 0
% 0.07/0.26  % Condensation successes               : 0
% 0.07/0.26  % Termbank termtop insertions          : 495
% 0.07/0.26  % Search garbage collected termcells   : 111
% 0.07/0.26  
% 0.07/0.26  % -------------------------------------------------
% 0.07/0.26  % User time                : 0.003 s
% 0.07/0.26  % System time              : 0.002 s
% 0.07/0.26  % Total time               : 0.005 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.007 s
% 0.07/0.26  % System time              : 0.009 s
% 0.07/0.26  % Total time               : 0.016 s
% 0.07/0.26  % Maximum resident set size: 4864 pages
% 0.07/0.26  % E exiting
%------------------------------------------------------------------------------