↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n020.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:04:09 AM UTC 2026

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

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

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

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

thf(decl_23,type,
    binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a ).

thf(decl_30,type,
    binary1721989714Tree_a: ( a > int ) > binary1439146945Tree_a > $o ).

thf(decl_50,type,
    h: a > int ).

thf(decl_51,type,
    t1: binary1439146945Tree_a ).

thf(decl_52,type,
    t2: binary1439146945Tree_a ).

thf(decl_53,type,
    x: a ).

thf(conj_0,conjecture,
    binary1721989714Tree_a @ h @ t1,
    file('/export/starexec/sandbox2/tmp/tmp.9yBKkf3a0e/E---3.1_1492519.p',conj_0) ).

thf(fact_3_sortLemmaL,axiom,
    ! [X1: a > int,X2: binary1439146945Tree_a,X3: a,X4: binary1439146945Tree_a] :
      ( ( binary1721989714Tree_a @ X1 @ ( binary717961607le_T_a @ X2 @ X3 @ X4 ) )
     => ( binary1721989714Tree_a @ X1 @ X2 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9yBKkf3a0e/E---3.1_1492519.p',fact_3_sortLemmaL) ).

thf(fact_1_s,axiom,
    binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ),
    file('/export/starexec/sandbox2/tmp/tmp.9yBKkf3a0e/E---3.1_1492519.p',fact_1_s) ).

thf(c_0_3,negated_conjecture,
    ~ ( binary1721989714Tree_a @ h @ t1 ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,negated_conjecture,
    ~ ( binary1721989714Tree_a @ h @ t1 ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

thf(c_0_5,plain,
    ! [X1774: a > int,X1775: binary1439146945Tree_a,X1776: a,X1777: binary1439146945Tree_a] :
      ( ~ ( binary1721989714Tree_a @ X1774 @ ( binary717961607le_T_a @ X1775 @ X1776 @ X1777 ) )
      | ( binary1721989714Tree_a @ X1774 @ X1775 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_sortLemmaL])])]) ).

thf(c_0_6,negated_conjecture,
    ~ ( binary1721989714Tree_a @ h @ t1 ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    ! [X1: a > int,X2: binary1439146945Tree_a,X3: a,X4: binary1439146945Tree_a] :
      ( ( binary1721989714Tree_a @ X1 @ X2 )
      | ~ ( binary1721989714Tree_a @ X1 @ ( binary717961607le_T_a @ X2 @ X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,plain,
    binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ),
    inference(split_conjunct,[status(thm)],[fact_1_s]) ).

thf(c_0_9,negated_conjecture,
    ~ ( binary1721989714Tree_a @ h @ t1 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP033^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n020.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 19:40:50 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running higher-order theorem proving
% 0.22/0.26  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.9yBKkf3a0e/E---3.1_1492519.p
% 0.22/0.37  % Version: 3.5.1-ho
% 0.22/0.37  % Preprocessing class: HSLSSMSSSSLNHSA.
% 0.22/0.37  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.37  % Starting pre_casc_6 with 1200s (4) cores
% 0.22/0.37  % Starting sh4 with 600s (2) cores
% 0.22/0.37  % Starting pre_casc_4 with 300s (1) cores
% 0.22/0.37  % Starting full_lambda_7 with 300s (1) cores
% 0.22/0.37  % full_lambda_7 with pid 1492535 completed with status 0
% 0.22/0.37  % Result found by full_lambda_7
% 0.22/0.37  % Preprocessing class: HSLSSMSSSSLNHSA.
% 0.22/0.37  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.37  % Starting pre_casc_6 with 1200s (4) cores
% 0.22/0.37  % Starting sh4 with 600s (2) cores
% 0.22/0.37  % Starting pre_casc_4 with 300s (1) cores
% 0.22/0.37  % Starting full_lambda_7 with 300s (1) cores
% 0.22/0.37  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true))
% 0.22/0.37  % SinE strategy is GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true)
% 0.22/0.37  % Search class: HGHSM-FSLM33-DHSFFSBN
% 0.22/0.37  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.37  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.37  % SubtermCWHack with pid 1492537 completed with status 0
% 0.22/0.37  % Result found by SubtermCWHack
% 0.22/0.37  % Preprocessing class: HSLSSMSSSSLNHSA.
% 0.22/0.37  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.37  % Starting pre_casc_6 with 1200s (4) cores
% 0.22/0.37  % Starting sh4 with 600s (2) cores
% 0.22/0.37  % Starting pre_casc_4 with 300s (1) cores
% 0.22/0.37  % Starting full_lambda_7 with 300s (1) cores
% 0.22/0.37  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true))
% 0.22/0.37  % SinE strategy is GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true)
% 0.22/0.37  % Search class: HGHSM-FSLM33-DHSFFSBN
% 0.22/0.37  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.37  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.37  % Preprocessing time       : 0.008 s
% 0.22/0.37  
% 0.22/0.37  % Proof found!
% 0.22/0.37  % SZS status Theorem
% 0.22/0.37  % SZS output start CNFRefutation
% See solution above
% 0.22/0.37  % Parsed axioms                        : 390
% 0.22/0.37  % Removed by relevancy pruning/SinE    : 101
% 0.22/0.37  % Initial clauses                      : 416
% 0.22/0.37  % Removed in clause preprocessing      : 16
% 0.22/0.37  % Initial clauses in saturation        : 400
% 0.22/0.37  % Processed clauses                    : 344
% 0.22/0.37  % ...of these trivial                  : 6
% 0.22/0.37  % ...subsumed                          : 174
% 0.22/0.37  % ...remaining for further processing  : 164
% 0.22/0.37  % Other redundant clauses eliminated   : 35
% 0.22/0.37  % Clauses deleted for lack of memory   : 0
% 0.22/0.37  % Backward-subsumed                    : 2
% 0.22/0.37  % Backward-rewritten                   : 2
% 0.22/0.37  % Generated clauses                    : 377
% 0.22/0.37  % ...of the previous two non-redundant : 274
% 0.22/0.37  % ...aggressively subsumed             : 0
% 0.22/0.37  % Contextual simplify-reflections      : 4
% 0.22/0.37  % Paramodulations                      : 329
% 0.22/0.37  % Factorizations                       : 8
% 0.22/0.37  % NegExts                              : 0
% 0.22/0.37  % Equation resolutions                 : 35
% 0.22/0.37  % Disequality decompositions           : 0
% 0.22/0.37  % Total rewrite steps                  : 156
% 0.22/0.37  % ...of those cached                   : 134
% 0.22/0.37  % Propositional unsat checks           : 0
% 0.22/0.37  %    Propositional check models        : 0
% 0.22/0.37  %    Propositional check unsatisfiable : 0
% 0.22/0.37  %    Propositional clauses             : 0
% 0.22/0.37  %    Propositional clauses after purity: 0
% 0.22/0.37  %    Propositional unsat core size     : 0
% 0.22/0.37  %    Propositional preprocessing time  : 0.000
% 0.22/0.37  %    Propositional encoding time       : 0.000
% 0.22/0.37  %    Propositional solver time         : 0.000
% 0.22/0.37  %    Success case prop preproc time    : 0.000
% 0.22/0.37  %    Success case prop encoding time   : 0.000
% 0.22/0.37  %    Success case prop solver time     : 0.000
% 0.22/0.37  % Current number of processed clauses  : 125
% 0.22/0.37  %    Positive orientable unit clauses  : 22
% 0.22/0.37  %    Positive unorientable unit clauses: 0
% 0.22/0.37  %    Negative unit clauses             : 23
% 0.22/0.37  %    Non-unit-clauses                  : 80
% 0.22/0.37  % Current number of unprocessed clauses: 327
% 0.22/0.37  % ...number of literals in the above   : 1003
% 0.22/0.37  % Current number of archived formulas  : 0
% 0.22/0.37  % Current number of archived clauses   : 5
% 0.22/0.37  % Clause-clause subsumption calls (NU) : 778
% 0.22/0.37  % Rec. Clause-clause subsumption calls : 731
% 0.22/0.37  % Non-unit clause-clause subsumptions  : 114
% 0.22/0.37  % Unit Clause-clause subsumption calls : 208
% 0.22/0.37  % Rewrite failures with RHS unbound    : 0
% 0.22/0.37  % BW rewrite match attempts            : 11
% 0.22/0.37  % BW rewrite match successes           : 4
% 0.22/0.37  % Condensation attempts                : 0
% 0.22/0.37  % Condensation successes               : 0
% 0.22/0.37  % Termbank termtop insertions          : 46562
% 0.22/0.37  % Search garbage collected termcells   : 14235
% 0.22/0.37  
% 0.22/0.37  % -------------------------------------------------
% 0.22/0.37  % User time                : 0.052 s
% 0.22/0.37  % System time              : 0.014 s
% 0.22/0.37  % Total time               : 0.066 s
% 0.22/0.37  % Maximum resident set size: 6752 pages
% 0.22/0.37  
% 0.22/0.37  % -------------------------------------------------
% 0.22/0.37  % User time                : 0.067 s
% 0.22/0.37  % System time              : 0.019 s
% 0.22/0.37  % Total time               : 0.086 s
% 0.22/0.37  % Maximum resident set size: 5632 pages
% 0.22/0.37  % E exiting
%------------------------------------------------------------------------------