TSTP Solution File: CSR135^2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : CSR135^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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 : Sat May  4 07:34:36 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_24,type,
    lBill_THFTYPE_i: $i ).

thf(decl_26,type,
    lMary_THFTYPE_i: $i ).

thf(decl_27,type,
    lSue_THFTYPE_i: $i ).

thf(con,conjecture,
    ? [X1: $i > $i > $o] :
      ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      & ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    file('/export/starexec/sandbox2/tmp/tmp.CMkWbivAeP/E---3.1_18815.p',con) ).

thf(c_0_1,negated_conjecture,
    ~ ? [X1: $i > $i > $o] :
        ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        & ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_2,negated_conjecture,
    ! [X3: $i > $i > $o] :
      ( ~ ( X3 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( X3 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: $i > $i > $o] :
      ( ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    $false,
    inference(flex_resolve,[status(thm)],[c_0_3]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : CSR135^2 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n019.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   : Fri May  3 15:11:53 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running higher-order theorem proving
% 0.19/0.46  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.CMkWbivAeP/E---3.1_18815.p
% 0.19/0.47  # Version: 3.1.0-ho
% 0.19/0.47  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.47  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.47  # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho4 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.47  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.47  # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.47  # Starting new_ho_8 with 300s (1) cores
% 0.19/0.47  # post_as_ho4 with pid 18896 completed with status 0
% 0.19/0.47  # Result found by post_as_ho4
% 0.19/0.47  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.47  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.47  # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho4 with 300s (1) cores
% 0.19/0.47  # No SInE strategy applied
% 0.19/0.47  # Search class: HUHNF-FFSM00-SSSFFFBN
% 0.19/0.47  # partial match(2): HUHNF-FFSF00-SSSFFFNN
% 0.19/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47  # new_ho_10 with pid 18901 completed with status 0
% 0.19/0.47  # Result found by new_ho_10
% 0.19/0.47  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.47  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.47  # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho4 with 300s (1) cores
% 0.19/0.47  # No SInE strategy applied
% 0.19/0.47  # Search class: HUHNF-FFSM00-SSSFFFBN
% 0.19/0.47  # partial match(2): HUHNF-FFSF00-SSSFFFNN
% 0.19/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47  # Preprocessing time       : 0.001 s
% 0.19/0.47  # Presaturation interreduction done
% 0.19/0.47  
% 0.19/0.47  # Proof found!
% 0.19/0.47  # SZS status Theorem
% 0.19/0.47  # SZS output start CNFRefutation
% See solution above
% 0.19/0.47  # Parsed axioms                        : 21
% 0.19/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.47  # Initial clauses                      : 21
% 0.19/0.47  # Removed in clause preprocessing      : 9
% 0.19/0.47  # Initial clauses in saturation        : 12
% 0.19/0.47  # Processed clauses                    : 7
% 0.19/0.47  # ...of these trivial                  : 2
% 0.19/0.47  # ...subsumed                          : 1
% 0.19/0.47  # ...remaining for further processing  : 3
% 0.19/0.47  # Other redundant clauses eliminated   : 0
% 0.19/0.47  # Clauses deleted for lack of memory   : 0
% 0.19/0.47  # Backward-subsumed                    : 0
% 0.19/0.47  # Backward-rewritten                   : 0
% 0.19/0.47  # Generated clauses                    : 0
% 0.19/0.47  # ...of the previous two non-redundant : 0
% 0.19/0.47  # ...aggressively subsumed             : 0
% 0.19/0.47  # Contextual simplify-reflections      : 0
% 0.19/0.47  # Paramodulations                      : 0
% 0.19/0.47  # Factorizations                       : 0
% 0.19/0.47  # NegExts                              : 0
% 0.19/0.47  # Equation resolutions                 : 0
% 0.19/0.47  # Disequality decompositions           : 0
% 0.19/0.47  # Total rewrite steps                  : 2
% 0.19/0.47  # ...of those cached                   : 0
% 0.19/0.47  # Propositional unsat checks           : 0
% 0.19/0.47  #    Propositional check models        : 0
% 0.19/0.47  #    Propositional check unsatisfiable : 0
% 0.19/0.47  #    Propositional clauses             : 0
% 0.19/0.47  #    Propositional clauses after purity: 0
% 0.19/0.47  #    Propositional unsat core size     : 0
% 0.19/0.47  #    Propositional preprocessing time  : 0.000
% 0.19/0.47  #    Propositional encoding time       : 0.000
% 0.19/0.47  #    Propositional solver time         : 0.000
% 0.19/0.47  #    Success case prop preproc time    : 0.000
% 0.19/0.47  #    Success case prop encoding time   : 0.000
% 0.19/0.47  #    Success case prop solver time     : 0.000
% 0.19/0.47  # Current number of processed clauses  : 3
% 0.19/0.47  #    Positive orientable unit clauses  : 2
% 0.19/0.47  #    Positive unorientable unit clauses: 0
% 0.19/0.47  #    Negative unit clauses             : 1
% 0.19/0.47  #    Non-unit-clauses                  : 0
% 0.19/0.47  # Current number of unprocessed clauses: 5
% 0.19/0.47  # ...number of literals in the above   : 5
% 0.19/0.47  # Current number of archived formulas  : 0
% 0.19/0.47  # Current number of archived clauses   : 0
% 0.19/0.47  # Clause-clause subsumption calls (NU) : 0
% 0.19/0.47  # Rec. Clause-clause subsumption calls : 0
% 0.19/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.47  # Unit Clause-clause subsumption calls : 0
% 0.19/0.47  # Rewrite failures with RHS unbound    : 0
% 0.19/0.47  # BW rewrite match attempts            : 0
% 0.19/0.47  # BW rewrite match successes           : 0
% 0.19/0.47  # Condensation attempts                : 7
% 0.19/0.47  # Condensation successes               : 0
% 0.19/0.47  # Termbank termtop insertions          : 479
% 0.19/0.47  # Search garbage collected termcells   : 30
% 0.19/0.47  
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.003 s
% 0.19/0.47  # System time              : 0.000 s
% 0.19/0.47  # Total time               : 0.003 s
% 0.19/0.47  # Maximum resident set size: 1612 pages
% 0.19/0.47  
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.003 s
% 0.19/0.47  # System time              : 0.002 s
% 0.19/0.47  # Total time               : 0.006 s
% 0.19/0.47  # Maximum resident set size: 1716 pages
% 0.19/0.47  % E---3.1 exiting
% 0.19/0.47  % E exiting
%------------------------------------------------------------------------------