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

View Problem - Process Solution

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

% Computer : n008.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:32 EDT 2024

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

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

thf(decl_22,type,
    g2: a > a ).

thf(decl_23,type,
    g1: a > a ).

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

thf(decl_25,type,
    esk1_0: a > a ).

thf(cTRANS_BUG_EX2,conjecture,
    ( ~ ( p
        @ ^ [X1: a] : ( g1 @ ( g2 @ X1 ) ) )
    | ( p
      @ ^ [X2: a] : ( g1 @ ( g2 @ X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTRANS_BUG_EX2) ).

thf(c_0_1,negated_conjecture,
    ~ ( ~ ( p
          @ ^ [Z0: a] : ( g1 @ ( g2 @ Z0 ) ) )
      | ( p
        @ ^ [Z0: a] : ( g1 @ ( g2 @ Z0 ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTRANS_BUG_EX2])])]) ).

thf(c_0_2,negated_conjecture,
    ( ( p
      @ ^ [Z0: a] : ( g1 @ ( g2 @ Z0 ) ) )
    & ~ ( p
        @ ^ [Z0: a] : ( g1 @ ( g2 @ Z0 ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])]) ).

thf(c_0_3,plain,
    ! [X3: a] :
      ( ( esk1_0 @ X3 )
      = ( g1 @ ( g2 @ X3 ) ) ),
    introduced(definition) ).

thf(c_0_4,negated_conjecture,
    ( ( p @ esk1_0 )
    = $true ),
    inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( ( p @ esk1_0 )
   != $true ),
    inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_3]) ).

thf(c_0_6,negated_conjecture,
    p @ esk1_0,
    inference(cn,[status(thm)],[c_0_4]) ).

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

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