↑ 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  : SET594^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 : 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:22:29 AM UTC 2026

% Result   : Theorem 0.07s 0.26s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   30 (   2 equ;   0 cnn)
%            Maximal formula atoms :   21 (   3 avg)
%            Number of connectives :  105 (  15   ~;  20   |;  14   &;  49   @)
%                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   17 (   2   ^;  15   !;   0   ?;  17   :)

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

thf(decl_23,type,
    epred1_0: a > $o ).

thf(decl_24,type,
    epred2_0: a > $o ).

thf(decl_25,type,
    epred3_0: a > $o ).

thf(decl_26,type,
    esk1_0: a ).

thf(cBOOL_PROP_53_pme,conjecture,
    ! [X1: a > $o,X2: a > $o,X3: a > $o] :
      ( ( ( ^ [X4: a] :
              ( ( ( X1 @ X4 )
                & ( X2 @ X4 ) )
              | ( ( X1 @ X4 )
                & ( X3 @ X4 ) ) ) )
        = X1 )
     => ! [X5: a] :
          ( ( X1 @ X5 )
         => ( ( X2 @ X5 )
            | ( X3 @ X5 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FbYJCjWfQq/E---3.1_602361.p',cBOOL_PROP_53_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > $o,X2: a > $o,X3: a > $o] :
        ( ( ( ^ [X4: a] :
                ( ( ( X1 @ X4 )
                  & ( X2 @ X4 ) )
                | ( ( X1 @ X4 )
                  & ( X3 @ X4 ) ) ) )
          = X1 )
       => ! [X5: a] :
            ( ( X1 @ X5 )
           => ( ( X2 @ X5 )
              | ( X3 @ X5 ) ) ) ),
    inference(assume_negation,[status(cth)],[cBOOL_PROP_53_pme]) ).

thf(c_0_2,negated_conjecture,
    ~ ! [X1: a > $o,X2: a > $o,X3: a > $o] :
        ( ! [X10: a] :
            ( ( ( ( X1 @ X10 )
                & ( X2 @ X10 ) )
              | ( ( X1 @ X10 )
                & ( X3 @ X10 ) ) )
          <=> ( X1 @ X10 ) )
       => ! [X5: a] :
            ( ( X1 @ X5 )
           => ( ( X2 @ X5 )
              | ( X3 @ X5 ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).

thf(c_0_3,negated_conjecture,
    ! [X14: a] :
      ( ( ~ ( epred1_0 @ X14 )
        | ~ ( epred2_0 @ X14 )
        | ( epred1_0 @ X14 ) )
      & ( ~ ( epred1_0 @ X14 )
        | ~ ( epred3_0 @ X14 )
        | ( epred1_0 @ X14 ) )
      & ( ( epred1_0 @ X14 )
        | ( epred1_0 @ X14 )
        | ~ ( epred1_0 @ X14 ) )
      & ( ( epred3_0 @ X14 )
        | ( epred1_0 @ X14 )
        | ~ ( epred1_0 @ X14 ) )
      & ( ( epred1_0 @ X14 )
        | ( epred2_0 @ X14 )
        | ~ ( epred1_0 @ X14 ) )
      & ( ( epred3_0 @ X14 )
        | ( epred2_0 @ X14 )
        | ~ ( epred1_0 @ X14 ) )
      & ( epred1_0 @ esk1_0 )
      & ~ ( epred2_0 @ esk1_0 )
      & ~ ( epred3_0 @ esk1_0 ) ),
    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])])])])])]) ).

thf(c_0_4,negated_conjecture,
    ~ ( epred3_0 @ esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ! [X4: a] :
      ( ( epred3_0 @ X4 )
      | ( epred2_0 @ X4 )
      | ~ ( epred1_0 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    epred1_0 @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_7,negated_conjecture,
    ~ ( epred2_0 @ esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_8,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET594^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.07/0.18  % Computer : n026.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:41:12 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.07/0.25  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.FbYJCjWfQq/E---3.1_602361.p
% 0.07/0.26  % Version: 3.5.1-ho
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.07/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.07/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.07/0.26  % Starting post_as_ho2 with 300s (1) cores
% 0.07/0.26  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.26  % Starting full_lambda_10 with 300s (1) cores
% 0.07/0.26  % Starting new_ho_8 with 300s (1) cores
% 0.07/0.26  % post_as_ho4 with pid 602396 completed with status 0
% 0.07/0.26  % Result found by post_as_ho4
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.07/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.07/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.07/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26  % No SInE strategy applied
% 0.07/0.26  % Search class: HGUNF-FFSF00-SSSFFFNN
% 0.07/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26  % SubtermCWHack with pid 602401 completed with status 0
% 0.07/0.26  % Result found by SubtermCWHack
% 0.07/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.07/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.07/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.07/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26  % No SInE strategy applied
% 0.07/0.26  % Search class: HGUNF-FFSF00-SSSFFFNN
% 0.07/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26  % Starting SubtermCWHack with 28s (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
% See solution above
% 0.07/0.26  % Parsed axioms                        : 2
% 0.07/0.26  % Removed by relevancy pruning/SinE    : 0
% 0.07/0.26  % Initial clauses                      : 10
% 0.07/0.26  % Removed in clause preprocessing      : 6
% 0.07/0.26  % Initial clauses in saturation        : 4
% 0.07/0.26  % Processed clauses                    : 4
% 0.07/0.26  % ...of these trivial                  : 0
% 0.07/0.26  % ...subsumed                          : 0
% 0.07/0.26  % ...remaining for further processing  : 4
% 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                   : 0
% 0.07/0.26  % Generated clauses                    : 1
% 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                      : 1
% 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                  : 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  : 4
% 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                  : 1
% 0.07/0.26  % Current number of unprocessed clauses: 0
% 0.07/0.26  % ...number of literals in the above   : 0
% 0.07/0.26  % Current number of archived formulas  : 0
% 0.07/0.26  % Current number of archived clauses   : 0
% 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            : 0
% 0.07/0.26  % BW rewrite match successes           : 0
% 0.07/0.26  % Condensation attempts                : 0
% 0.07/0.26  % Condensation successes               : 0
% 0.07/0.26  % Termbank termtop insertions          : 634
% 0.07/0.26  % Search garbage collected termcells   : 237
% 0.07/0.26  
% 0.07/0.26  % -------------------------------------------------
% 0.07/0.26  % User time                : 0.002 s
% 0.07/0.26  % System time              : 0.001 s
% 0.07/0.26  % Total time               : 0.003 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.003 s
% 0.07/0.26  % System time              : 0.007 s
% 0.07/0.26  % Total time               : 0.010 s
% 0.07/0.26  % Maximum resident set size: 4608 pages
% 0.07/0.26  % E exiting
%------------------------------------------------------------------------------