TSTP Solution File: SYO350^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SYO350^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 08:45:41 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    g: $i > $i ).

thf(decl_23,type,
    p: ( $i > $i ) > $o ).

thf(decl_24,type,
    f: $i > $i ).

thf(cE1FUNC,conjecture,
    ( ! [X1: $i] :
        ( ( f @ X1 )
        = ( g @ X1 ) )
   => ( ( p @ f )
     => ( p @ g ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cE1FUNC) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: $i] :
          ( ( f @ X1 )
          = ( g @ X1 ) )
     => ( ( p @ f )
       => ( p @ g ) ) ),
    inference(assume_negation,[status(cth)],[cE1FUNC]) ).

thf(c_0_2,negated_conjecture,
    ! [X3: $i] :
      ( ( ( f @ X3 )
        = ( g @ X3 ) )
      & ( p @ f )
      & ~ ( p @ g ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: $i] :
      ( ( f @ X1 )
      = ( g @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    p @ f,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    f = g,
    inference(pos_ext,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ~ ( p @ g ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SYO350^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n005.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon May 20 08:31:22 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.15/0.40  Running higher-order theorem proving
% 0.15/0.40  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/benchmark/theBenchmark.p
% 0.15/0.41  # Version: 3.1.0-ho
% 0.15/0.41  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.15/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.15/0.41  # Starting post_as_ho10 with 300s (1) cores
% 0.15/0.41  # Starting new_bool_9 with 300s (1) cores
% 0.15/0.41  # Starting sh5l with 300s (1) cores
% 0.15/0.41  # new_bool_9 with pid 21239 completed with status 0
% 0.15/0.41  # Result found by new_bool_9
% 0.15/0.41  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.15/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.15/0.41  # Starting post_as_ho10 with 300s (1) cores
% 0.15/0.41  # Starting new_bool_9 with 300s (1) cores
% 0.15/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.15/0.41  # Search class: HUUSF-FFSF11-SSSFFFNN
% 0.15/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41  # Starting new_ho_10 with 181s (1) cores
% 0.15/0.41  # new_ho_10 with pid 21245 completed with status 0
% 0.15/0.41  # Result found by new_ho_10
% 0.15/0.41  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.15/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.15/0.41  # Starting post_as_ho10 with 300s (1) cores
% 0.15/0.41  # Starting new_bool_9 with 300s (1) cores
% 0.15/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.15/0.41  # Search class: HUUSF-FFSF11-SSSFFFNN
% 0.15/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41  # Starting new_ho_10 with 181s (1) cores
% 0.15/0.41  # Preprocessing time       : 0.001 s
% 0.15/0.41  # Presaturation interreduction done
% 0.15/0.41  
% 0.15/0.41  # Proof found!
% 0.15/0.41  # SZS status Theorem
% 0.15/0.41  # SZS output start CNFRefutation
% See solution above
% 0.15/0.41  # Parsed axioms                        : 4
% 0.15/0.41  # Removed by relevancy pruning/SinE    : 3
% 0.15/0.41  # Initial clauses                      : 3
% 0.15/0.41  # Removed in clause preprocessing      : 0
% 0.15/0.41  # Initial clauses in saturation        : 3
% 0.15/0.41  # Processed clauses                    : 7
% 0.15/0.41  # ...of these trivial                  : 0
% 0.15/0.41  # ...subsumed                          : 0
% 0.15/0.41  # ...remaining for further processing  : 7
% 0.15/0.41  # Other redundant clauses eliminated   : 0
% 0.15/0.41  # Clauses deleted for lack of memory   : 0
% 0.15/0.41  # Backward-subsumed                    : 0
% 0.15/0.41  # Backward-rewritten                   : 1
% 0.15/0.41  # Generated clauses                    : 2
% 0.15/0.41  # ...of the previous two non-redundant : 1
% 0.15/0.41  # ...aggressively subsumed             : 0
% 0.15/0.41  # Contextual simplify-reflections      : 0
% 0.15/0.41  # Paramodulations                      : 0
% 0.15/0.41  # Factorizations                       : 0
% 0.15/0.41  # NegExts                              : 0
% 0.15/0.41  # Equation resolutions                 : 0
% 0.15/0.41  # Disequality decompositions           : 0
% 0.15/0.41  # Total rewrite steps                  : 1
% 0.15/0.41  # ...of those cached                   : 0
% 0.15/0.41  # Propositional unsat checks           : 0
% 0.15/0.41  #    Propositional check models        : 0
% 0.15/0.41  #    Propositional check unsatisfiable : 0
% 0.15/0.41  #    Propositional clauses             : 0
% 0.15/0.41  #    Propositional clauses after purity: 0
% 0.15/0.41  #    Propositional unsat core size     : 0
% 0.15/0.41  #    Propositional preprocessing time  : 0.000
% 0.15/0.41  #    Propositional encoding time       : 0.000
% 0.15/0.41  #    Propositional solver time         : 0.000
% 0.15/0.41  #    Success case prop preproc time    : 0.000
% 0.15/0.41  #    Success case prop encoding time   : 0.000
% 0.15/0.41  #    Success case prop solver time     : 0.000
% 0.15/0.41  # Current number of processed clauses  : 3
% 0.15/0.41  #    Positive orientable unit clauses  : 2
% 0.15/0.41  #    Positive unorientable unit clauses: 0
% 0.15/0.41  #    Negative unit clauses             : 1
% 0.15/0.41  #    Non-unit-clauses                  : 0
% 0.15/0.41  # Current number of unprocessed clauses: 0
% 0.15/0.41  # ...number of literals in the above   : 0
% 0.15/0.41  # Current number of archived formulas  : 0
% 0.15/0.41  # Current number of archived clauses   : 4
% 0.15/0.41  # Clause-clause subsumption calls (NU) : 0
% 0.15/0.41  # Rec. Clause-clause subsumption calls : 0
% 0.15/0.41  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.41  # Unit Clause-clause subsumption calls : 0
% 0.15/0.41  # Rewrite failures with RHS unbound    : 0
% 0.15/0.41  # BW rewrite match attempts            : 3
% 0.15/0.41  # BW rewrite match successes           : 1
% 0.15/0.41  # Condensation attempts                : 7
% 0.15/0.41  # Condensation successes               : 0
% 0.15/0.41  # Termbank termtop insertions          : 135
% 0.15/0.41  # Search garbage collected termcells   : 34
% 0.15/0.41  
% 0.15/0.41  # -------------------------------------------------
% 0.15/0.41  # User time                : 0.002 s
% 0.15/0.41  # System time              : 0.000 s
% 0.15/0.41  # Total time               : 0.002 s
% 0.15/0.41  # Maximum resident set size: 1624 pages
% 0.15/0.41  
% 0.15/0.41  # -------------------------------------------------
% 0.15/0.41  # User time                : 0.004 s
% 0.15/0.41  # System time              : 0.000 s
% 0.15/0.41  # Total time               : 0.004 s
% 0.15/0.41  # Maximum resident set size: 1700 pages
% 0.15/0.41  % E---3.1 exiting
% 0.15/0.41  % E exiting
%------------------------------------------------------------------------------