↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Computer : n026.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:05:42 AM UTC 2026

% Result   : Theorem 0.21s 0.28s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   12 (   3 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   36 (   4   ~;   0   |;   0   &;  32   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   4 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    6 (   0   ^;   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    refine424419629nres_a: $tType ).

thf(decl_sort2,type,
    refine432681134nres_b: $tType ).

thf(decl_sort3,type,
    set_Product_prod_a_b: $tType ).

thf(decl_35,type,
    ord_le519537037nres_a: refine424419629nres_a > refine424419629nres_a > $o ).

thf(decl_48,type,
    top_to231829469nres_a: refine424419629nres_a ).

thf(decl_49,type,
    top_to240090974nres_b: refine432681134nres_b ).

thf(decl_73,type,
    refine1441824854un_a_b: set_Product_prod_a_b > refine432681134nres_b > refine424419629nres_a ).

thf(decl_92,type,
    r: set_Product_prod_a_b ).

thf(decl_93,type,
    x: refine424419629nres_a ).

thf(conj_0,conjecture,
    ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ),
    file('/export/starexec/sandbox/tmp/tmp.icC2fox2ZN/E---3.1_1110792.p',conj_0) ).

thf(fact_29_conc__fun__FAIL,axiom,
    ! [X41: set_Product_prod_a_b] :
      ( ( refine1441824854un_a_b @ X41 @ top_to240090974nres_b )
      = top_to231829469nres_a ),
    file('/export/starexec/sandbox/tmp/tmp.icC2fox2ZN/E---3.1_1110792.p',fact_29_conc__fun__FAIL) ).

thf(fact_32_nres__order__simps_I3_J,axiom,
    ! [X43: refine424419629nres_a] : ( ord_le519537037nres_a @ X43 @ top_to231829469nres_a ),
    file('/export/starexec/sandbox/tmp/tmp.icC2fox2ZN/E---3.1_1110792.p',fact_32_nres__order__simps_I3_J) ).

thf(c_0_3,negated_conjecture,
    ~ ( ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,negated_conjecture,
    ~ ( ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ~ ( ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_6,plain,
    ! [X1195: set_Product_prod_a_b] :
      ( ( refine1441824854un_a_b @ X1195 @ top_to240090974nres_b )
      = top_to231829469nres_a ),
    inference(variable_rename,[status(thm)],[fact_29_conc__fun__FAIL]) ).

thf(c_0_7,plain,
    ! [X1218: refine424419629nres_a] : ( ord_le519537037nres_a @ X1218 @ top_to231829469nres_a ),
    inference(variable_rename,[status(thm)],[fact_32_nres__order__simps_I3_J]) ).

thf(c_0_8,negated_conjecture,
    ~ ( ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ! [X18: set_Product_prod_a_b] :
      ( ( refine1441824854un_a_b @ X18 @ top_to240090974nres_b )
      = top_to231829469nres_a ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ! [X3: refine424419629nres_a] : ( ord_le519537037nres_a @ X3 @ top_to231829469nres_a ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP159^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n026.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 20:06:27 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running higher-order theorem proving
% 0.08/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.icC2fox2ZN/E---3.1_1110792.p
% 0.21/0.28  % Version: 3.5.1-ho
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSCHFA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting lpo5_fix with 1500s (5) cores
% 0.21/0.28  % Starting lpo6_lambda_fix with 300s (1) cores
% 0.21/0.28  % Starting post_as_ho8 with 300s (1) cores
% 0.21/0.28  % Starting lpo5_rw_fix with 300s (1) cores
% 0.21/0.28  % post_as_ho8 with pid 1110807 completed with status 0
% 0.21/0.28  % Result found by post_as_ho8
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSCHFA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting lpo5_fix with 1500s (5) cores
% 0.21/0.28  % Starting lpo6_lambda_fix with 300s (1) cores
% 0.21/0.28  % Starting post_as_ho8 with 300s (1) cores
% 0.21/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.21/0.28  % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.21/0.28  % Search class: HGUSM-FFMF33-SHFFFSNN
% 0.21/0.28  % partial match(3): FGUSM-FFMF33-SFFFFFNN
% 0.21/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.28  % SubtermCWHack with pid 1110809 completed with status 0
% 0.21/0.28  % Result found by SubtermCWHack
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSCHFA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting lpo5_fix with 1500s (5) cores
% 0.21/0.28  % Starting lpo6_lambda_fix with 300s (1) cores
% 0.21/0.28  % Starting post_as_ho8 with 300s (1) cores
% 0.21/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.21/0.28  % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.21/0.28  % Search class: HGUSM-FFMF33-SHFFFSNN
% 0.21/0.28  % partial match(3): FGUSM-FFMF33-SFFFFFNN
% 0.21/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.28  % Preprocessing time       : 0.004 s
% 0.21/0.28  
% 0.21/0.28  % Proof found!
% 0.21/0.28  % SZS status Theorem
% 0.21/0.28  % SZS output start CNFRefutation
% See solution above
% 0.21/0.28  % Parsed axioms                        : 454
% 0.21/0.28  % Removed by relevancy pruning/SinE    : 361
% 0.21/0.28  % Initial clauses                      : 140
% 0.21/0.28  % Removed in clause preprocessing      : 11
% 0.21/0.28  % Initial clauses in saturation        : 129
% 0.21/0.28  % Processed clauses                    : 14
% 0.21/0.28  % ...of these trivial                  : 5
% 0.21/0.28  % ...subsumed                          : 0
% 0.21/0.28  % ...remaining for further processing  : 8
% 0.21/0.28  % Other redundant clauses eliminated   : 0
% 0.21/0.28  % Clauses deleted for lack of memory   : 0
% 0.21/0.28  % Backward-subsumed                    : 0
% 0.21/0.28  % Backward-rewritten                   : 0
% 0.21/0.28  % Generated clauses                    : 0
% 0.21/0.28  % ...of the previous two non-redundant : 0
% 0.21/0.28  % ...aggressively subsumed             : 0
% 0.21/0.28  % Contextual simplify-reflections      : 0
% 0.21/0.28  % Paramodulations                      : 0
% 0.21/0.28  % Factorizations                       : 0
% 0.21/0.28  % NegExts                              : 0
% 0.21/0.28  % Equation resolutions                 : 0
% 0.21/0.28  % Disequality decompositions           : 0
% 0.21/0.28  % Total rewrite steps                  : 7
% 0.21/0.28  % ...of those cached                   : 0
% 0.21/0.28  % Propositional unsat checks           : 0
% 0.21/0.28  %    Propositional check models        : 0
% 0.21/0.28  %    Propositional check unsatisfiable : 0
% 0.21/0.28  %    Propositional clauses             : 0
% 0.21/0.28  %    Propositional clauses after purity: 0
% 0.21/0.28  %    Propositional unsat core size     : 0
% 0.21/0.28  %    Propositional preprocessing time  : 0.000
% 0.21/0.28  %    Propositional encoding time       : 0.000
% 0.21/0.28  %    Propositional solver time         : 0.000
% 0.21/0.28  %    Success case prop preproc time    : 0.000
% 0.21/0.28  %    Success case prop encoding time   : 0.000
% 0.21/0.28  %    Success case prop solver time     : 0.000
% 0.21/0.28  % Current number of processed clauses  : 8
% 0.21/0.28  %    Positive orientable unit clauses  : 8
% 0.21/0.28  %    Positive unorientable unit clauses: 0
% 0.21/0.28  %    Negative unit clauses             : 0
% 0.21/0.28  %    Non-unit-clauses                  : 0
% 0.21/0.28  % Current number of unprocessed clauses: 115
% 0.21/0.28  % ...number of literals in the above   : 331
% 0.21/0.28  % Current number of archived formulas  : 0
% 0.21/0.28  % Current number of archived clauses   : 0
% 0.21/0.28  % Clause-clause subsumption calls (NU) : 0
% 0.21/0.28  % Rec. Clause-clause subsumption calls : 0
% 0.21/0.28  % Non-unit clause-clause subsumptions  : 0
% 0.21/0.28  % Unit Clause-clause subsumption calls : 0
% 0.21/0.28  % Rewrite failures with RHS unbound    : 0
% 0.21/0.28  % BW rewrite match attempts            : 2
% 0.21/0.28  % BW rewrite match successes           : 0
% 0.21/0.28  % Condensation attempts                : 0
% 0.21/0.28  % Condensation successes               : 0
% 0.21/0.28  % Termbank termtop insertions          : 15644
% 0.21/0.28  % Search garbage collected termcells   : 6375
% 0.21/0.28  
% 0.21/0.28  % -------------------------------------------------
% 0.21/0.28  % User time                : 0.012 s
% 0.21/0.28  % System time              : 0.008 s
% 0.21/0.28  % Total time               : 0.020 s
% 0.21/0.28  % Maximum resident set size: 5432 pages
% 0.21/0.28  
% 0.21/0.28  % -------------------------------------------------
% 0.21/0.28  % User time                : 0.026 s
% 0.21/0.28  % System time              : 0.014 s
% 0.21/0.28  % Total time               : 0.039 s
% 0.21/0.28  % Maximum resident set size: 5888 pages
% 0.21/0.28  % E exiting
%------------------------------------------------------------------------------