↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n008.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:23:52 AM UTC 2026

% Result   : Theorem 0.26s 0.38s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   25 (   7 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   62 (   5   ~;   3   |;   2   &;  47   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   35 (  35   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   27 (  13   ^;  14   !;   0   ?;  27   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).

thf(decl_26,type,
    infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).

thf(decl_34,type,
    sc: ( $i > $i > $o ) > $i > $i > $o ).

thf(decl_52,type,
    epred1_0: $i > $i > $o ).

thf(decl_53,type,
    esk1_0: $i ).

thf(decl_54,type,
    esk2_0: $i ).

thf(inflationary,axiom,
    ( infl
    = ( ^ [X5: ( $i > $i > $o ) > $i > $i > $o] :
        ! [X1: $i > $i > $o] : ( subrel @ X1 @ ( X5 @ X1 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.M2esNPG01L/E---3.1_3171689.p',inflationary) ).

thf(subrel,axiom,
    ( subrel
    = ( ^ [X1: $i > $i > $o,X2: $i > $i > $o] :
        ! [X3: $i,X4: $i] :
          ( ( X1 @ X3 @ X4 )
         => ( X2 @ X3 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.M2esNPG01L/E---3.1_3171689.p',subrel) ).

thf(symmetric_closure_op_is_inflationary,conjecture,
    infl @ sc,
    file('/export/starexec/sandbox/tmp/tmp.M2esNPG01L/E---3.1_3171689.p',symmetric_closure_op_is_inflationary) ).

thf(symmetric_closure,axiom,
    ( sc
    = ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] :
          ( ( X1 @ X4 @ X3 )
          | ( X1 @ X3 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.M2esNPG01L/E---3.1_3171689.p',symmetric_closure) ).

thf(c_0_4,plain,
    ( infl
    = ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
        ! [X1: $i > $i > $o,X9: $i,X10: $i] :
          ( ( X1 @ X9 @ X10 )
         => ( Z0 @ X1 @ X9 @ X10 ) ) ) ),
    inference(fof_simplification,[status(thm)],[inflationary]) ).

thf(c_0_5,plain,
    ( subrel
    = ( ^ [Z0: $i > $i > $o,Z1: $i > $i > $o] :
        ! [X3: $i,X4: $i] :
          ( ( Z0 @ X3 @ X4 )
         => ( Z1 @ X3 @ X4 ) ) ) ),
    inference(fof_simplification,[status(thm)],[subrel]) ).

thf(c_0_6,negated_conjecture,
    ~ ( infl @ sc ),
    inference(assume_negation,[status(cth)],[symmetric_closure_op_is_inflationary]) ).

thf(c_0_7,plain,
    ( sc
    = ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
          ( ( Z0 @ Z2 @ Z1 )
          | ( Z0 @ Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[symmetric_closure]) ).

thf(c_0_8,plain,
    ( infl
    = ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
        ! [X1: $i > $i > $o,X9: $i,X10: $i] :
          ( ( X1 @ X9 @ X10 )
         => ( Z0 @ X1 @ X9 @ X10 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).

thf(c_0_9,negated_conjecture,
    ~ ! [X79: $i > $i > $o,X80: $i,X81: $i] :
        ( ( X79 @ X80 @ X81 )
       => ( ( X79 @ X81 @ X80 )
          | ( X79 @ X80 @ X81 ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

thf(c_0_10,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ esk2_0 )
    & ~ ( epred1_0 @ esk2_0 @ esk1_0 )
    & ~ ( epred1_0 @ esk1_0 @ esk2_0 ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

thf(c_0_11,negated_conjecture,
    ~ ( epred1_0 @ esk1_0 @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_12,negated_conjecture,
    epred1_0 @ esk1_0 @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEU459^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.27  % Computer : n008.cluster.edu
% 0.10/0.27  % Model    : x86_64 x86_64
% 0.10/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.27  % Memory   : 8046.5625MB
% 0.10/0.27  % OS       : Linux 6.8.0-71-generic
% 0.10/0.27  % CPULimit : 300
% 0.10/0.27  % WCLimit  : 300
% 0.10/0.27  % DateTime : Tue Sep 29 13:42:24 UTC 2026
% 0.10/0.27  % CPUTime  : 
% 0.10/0.27  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.32  Running higher-order theorem proving
% 0.26/0.35  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.M2esNPG01L/E---3.1_3171689.p
% 0.26/0.38  % Version: 3.5.1-ho
% 0.26/0.38  % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.26/0.38  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.38  % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.38  % Starting pre_casc_5 with 300s (1) cores
% 0.26/0.38  % Starting post_as_ho11 with 300s (1) cores
% 0.26/0.38  % Starting ho_unfolding_1 with 300s (1) cores
% 0.26/0.38  % pre_casc_5 with pid 3171703 completed with status 0
% 0.26/0.38  % Result found by pre_casc_5
% 0.26/0.38  % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.26/0.38  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.38  % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.38  % Starting pre_casc_5 with 300s (1) cores
% 0.26/0.38  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,3,,5,20000,1.0,true))
% 0.26/0.38  % SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.26/0.38  % Search class: HUUNF-FFSF00-SHHSMFNN
% 0.26/0.38  % partial match(1): HUUNF-FFSF00-SHSSMFNN
% 0.26/0.38  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.38  % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.38  % SubtermCWHack with pid 3171706 completed with status 0
% 0.26/0.38  % Result found by SubtermCWHack
% 0.26/0.38  % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.26/0.38  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.38  % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.38  % Starting pre_casc_5 with 300s (1) cores
% 0.26/0.38  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,3,,5,20000,1.0,true))
% 0.26/0.38  % SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.26/0.38  % Search class: HUUNF-FFSF00-SHHSMFNN
% 0.26/0.38  % partial match(1): HUUNF-FFSF00-SHSSMFNN
% 0.26/0.38  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.38  % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.38  % Preprocessing time       : 0.002 s
% 0.26/0.38  
% 0.26/0.38  % Proof found!
% 0.26/0.38  % SZS status Theorem
% 0.26/0.38  % SZS output start CNFRefutation
% See solution above
% 0.26/0.38  % Parsed axioms                        : 59
% 0.26/0.38  % Removed by relevancy pruning/SinE    : 45
% 0.26/0.38  % Initial clauses                      : 3
% 0.26/0.38  % Removed in clause preprocessing      : 0
% 0.26/0.38  % Initial clauses in saturation        : 3
% 0.26/0.38  % Processed clauses                    : 2
% 0.26/0.38  % ...of these trivial                  : 0
% 0.26/0.38  % ...subsumed                          : 0
% 0.26/0.38  % ...remaining for further processing  : 1
% 0.26/0.38  % Other redundant clauses eliminated   : 0
% 0.26/0.38  % Clauses deleted for lack of memory   : 0
% 0.26/0.38  % Backward-subsumed                    : 0
% 0.26/0.38  % Backward-rewritten                   : 0
% 0.26/0.38  % Generated clauses                    : 0
% 0.26/0.38  % ...of the previous two non-redundant : 0
% 0.26/0.38  % ...aggressively subsumed             : 0
% 0.26/0.38  % Contextual simplify-reflections      : 0
% 0.26/0.38  % Paramodulations                      : 0
% 0.26/0.38  % Factorizations                       : 0
% 0.26/0.38  % NegExts                              : 0
% 0.26/0.38  % Equation resolutions                 : 0
% 0.26/0.38  % Disequality decompositions           : 0
% 0.26/0.38  % Total rewrite steps                  : 1
% 0.26/0.38  % ...of those cached                   : 0
% 0.26/0.38  % Propositional unsat checks           : 0
% 0.26/0.38  %    Propositional check models        : 0
% 0.26/0.38  %    Propositional check unsatisfiable : 0
% 0.26/0.38  %    Propositional clauses             : 0
% 0.26/0.38  %    Propositional clauses after purity: 0
% 0.26/0.38  %    Propositional unsat core size     : 0
% 0.26/0.38  %    Propositional preprocessing time  : 0.000
% 0.26/0.38  %    Propositional encoding time       : 0.000
% 0.26/0.38  %    Propositional solver time         : 0.000
% 0.26/0.38  %    Success case prop preproc time    : 0.000
% 0.26/0.38  %    Success case prop encoding time   : 0.000
% 0.26/0.38  %    Success case prop solver time     : 0.000
% 0.26/0.38  % Current number of processed clauses  : 1
% 0.26/0.38  %    Positive orientable unit clauses  : 1
% 0.26/0.38  %    Positive unorientable unit clauses: 0
% 0.26/0.38  %    Negative unit clauses             : 0
% 0.26/0.38  %    Non-unit-clauses                  : 0
% 0.26/0.38  % Current number of unprocessed clauses: 1
% 0.26/0.38  % ...number of literals in the above   : 1
% 0.26/0.38  % Current number of archived formulas  : 0
% 0.26/0.38  % Current number of archived clauses   : 0
% 0.26/0.38  % Clause-clause subsumption calls (NU) : 0
% 0.26/0.38  % Rec. Clause-clause subsumption calls : 0
% 0.26/0.38  % Non-unit clause-clause subsumptions  : 0
% 0.26/0.38  % Unit Clause-clause subsumption calls : 0
% 0.26/0.38  % Rewrite failures with RHS unbound    : 0
% 0.26/0.38  % BW rewrite match attempts            : 0
% 0.26/0.38  % BW rewrite match successes           : 0
% 0.26/0.38  % Condensation attempts                : 0
% 0.26/0.38  % Condensation successes               : 0
% 0.26/0.38  % Termbank termtop insertions          : 1464
% 0.26/0.38  % Search garbage collected termcells   : 478
% 0.26/0.38  
% 0.26/0.38  % -------------------------------------------------
% 0.26/0.38  % User time                : 0.004 s
% 0.26/0.38  % System time              : 0.004 s
% 0.26/0.38  % Total time               : 0.008 s
% 0.26/0.38  % Maximum resident set size: 3896 pages
% 0.26/0.38  
% 0.26/0.38  % -------------------------------------------------
% 0.26/0.38  % User time                : 0.008 s
% 0.26/0.38  % System time              : 0.010 s
% 0.26/0.38  % Total time               : 0.018 s
% 0.26/0.38  % Maximum resident set size: 4864 pages
% 0.26/0.38  % E exiting
%------------------------------------------------------------------------------