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

View Problem - Process Solution

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

% Computer : n009.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:44:35 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    cR: $o ).

thf(decl_23,type,
    cP: $o ).

thf(decl_24,type,
    cQ: $o ).

thf(cTHM49,conjecture,
    ( ( cP
    <=> cQ )
    | ( cQ
    <=> cR )
    | ( cP
    <=> cR ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM49) ).

thf(c_0_1,negated_conjecture,
    ~ ( ( cP
      <=> cQ )
      | ( cQ
      <=> cR )
      | ( cP
      <=> cR ) ),
    inference(assume_negation,[status(cth)],[cTHM49]) ).

thf(c_0_2,negated_conjecture,
    ( ( ~ cP
      | ~ cQ )
    & ( cP
      | cQ )
    & ( ~ cQ
      | ~ cR )
    & ( cQ
      | cR )
    & ( ~ cP
      | ~ cR )
    & ( cP
      | cR ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])]) ).

thf(c_0_3,negated_conjecture,
    ( ~ cP
    | ~ cQ ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( cQ
    | cR ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ( cP
    | cR ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ( ~ cQ
    | ~ cR ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    cR,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ( ~ cP
    | ~ cR ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ( cP
    | cQ ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_10,negated_conjecture,
    ~ cQ,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

thf(c_0_11,negated_conjecture,
    ~ cP,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).

thf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYO078^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon May 20 10:52:07 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.18/0.46  Running higher-order theorem proving
% 0.18/0.46  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.18/0.47  # Version: 3.1.0-ho
% 0.18/0.47  # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.47  # Starting ehoh_best8_lambda with 300s (1) cores
% 0.18/0.47  # Starting ho_unfolding_6 with 300s (1) cores
% 0.18/0.47  # Starting sh4l with 300s (1) cores
% 0.18/0.47  # ehoh_best8_lambda with pid 3419 completed with status 0
% 0.18/0.47  # Result found by ehoh_best8_lambda
% 0.18/0.47  # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.47  # Starting ehoh_best8_lambda with 300s (1) cores
% 0.18/0.47  # No SInE strategy applied
% 0.18/0.47  # Search class: HGHNF-FFSS00-SFFFFFNN
% 0.18/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting new_ho_10 with 163s (1) cores
% 0.18/0.47  # new_ho_10 with pid 3423 completed with status 0
% 0.18/0.47  # Result found by new_ho_10
% 0.18/0.47  # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.47  # Starting ehoh_best8_lambda with 300s (1) cores
% 0.18/0.47  # No SInE strategy applied
% 0.18/0.47  # Search class: HGHNF-FFSS00-SFFFFFNN
% 0.18/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting new_ho_10 with 163s (1) cores
% 0.18/0.47  # Preprocessing time       : 0.001 s
% 0.18/0.47  # Presaturation interreduction done
% 0.18/0.47  
% 0.18/0.47  # Proof found!
% 0.18/0.47  # SZS status Theorem
% 0.18/0.47  # SZS output start CNFRefutation
% See solution above
% 0.18/0.47  # Parsed axioms                        : 4
% 0.18/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.18/0.47  # Initial clauses                      : 9
% 0.18/0.47  # Removed in clause preprocessing      : 3
% 0.18/0.47  # Initial clauses in saturation        : 6
% 0.18/0.47  # Processed clauses                    : 15
% 0.18/0.47  # ...of these trivial                  : 0
% 0.18/0.47  # ...subsumed                          : 0
% 0.18/0.47  # ...remaining for further processing  : 14
% 0.18/0.47  # Other redundant clauses eliminated   : 0
% 0.18/0.47  # Clauses deleted for lack of memory   : 0
% 0.18/0.47  # Backward-subsumed                    : 2
% 0.18/0.47  # Backward-rewritten                   : 3
% 0.18/0.47  # Generated clauses                    : 3
% 0.18/0.47  # ...of the previous two non-redundant : 3
% 0.18/0.47  # ...aggressively subsumed             : 0
% 0.18/0.47  # Contextual simplify-reflections      : 1
% 0.18/0.47  # Paramodulations                      : 3
% 0.18/0.47  # Factorizations                       : 0
% 0.18/0.47  # NegExts                              : 0
% 0.18/0.47  # Equation resolutions                 : 0
% 0.18/0.47  # Disequality decompositions           : 0
% 0.18/0.47  # Total rewrite steps                  : 3
% 0.18/0.47  # ...of those cached                   : 2
% 0.18/0.47  # Propositional unsat checks           : 0
% 0.18/0.47  #    Propositional check models        : 0
% 0.18/0.47  #    Propositional check unsatisfiable : 0
% 0.18/0.47  #    Propositional clauses             : 0
% 0.18/0.47  #    Propositional clauses after purity: 0
% 0.18/0.47  #    Propositional unsat core size     : 0
% 0.18/0.47  #    Propositional preprocessing time  : 0.000
% 0.18/0.47  #    Propositional encoding time       : 0.000
% 0.18/0.47  #    Propositional solver time         : 0.000
% 0.18/0.47  #    Success case prop preproc time    : 0.000
% 0.18/0.47  #    Success case prop encoding time   : 0.000
% 0.18/0.47  #    Success case prop solver time     : 0.000
% 0.18/0.47  # Current number of processed clauses  : 3
% 0.18/0.47  #    Positive orientable unit clauses  : 1
% 0.18/0.47  #    Positive unorientable unit clauses: 0
% 0.18/0.47  #    Negative unit clauses             : 2
% 0.18/0.47  #    Non-unit-clauses                  : 0
% 0.18/0.47  # Current number of unprocessed clauses: 0
% 0.18/0.47  # ...number of literals in the above   : 0
% 0.18/0.47  # Current number of archived formulas  : 0
% 0.18/0.47  # Current number of archived clauses   : 11
% 0.18/0.47  # Clause-clause subsumption calls (NU) : 1
% 0.18/0.47  # Rec. Clause-clause subsumption calls : 1
% 0.18/0.47  # Non-unit clause-clause subsumptions  : 1
% 0.18/0.47  # Unit Clause-clause subsumption calls : 2
% 0.18/0.47  # Rewrite failures with RHS unbound    : 0
% 0.18/0.47  # BW rewrite match attempts            : 1
% 0.18/0.47  # BW rewrite match successes           : 1
% 0.18/0.47  # Condensation attempts                : 16
% 0.18/0.47  # Condensation successes               : 0
% 0.18/0.47  # Termbank termtop insertions          : 339
% 0.18/0.47  # Search garbage collected termcells   : 50
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.003 s
% 0.18/0.47  # System time              : 0.001 s
% 0.18/0.47  # Total time               : 0.004 s
% 0.18/0.47  # Maximum resident set size: 1640 pages
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.003 s
% 0.18/0.47  # System time              : 0.003 s
% 0.18/0.47  # Total time               : 0.007 s
% 0.18/0.47  # Maximum resident set size: 1684 pages
% 0.18/0.47  % E---3.1 exiting
% 0.18/0.48  % E exiting
%------------------------------------------------------------------------------