TSTP Solution File: CSR152^1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n032.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 : Mon May 20 19:16:47 EDT 2024

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

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

thf(decl_23,type,
    lBill_THFTYPE_i: $i ).

thf(decl_24,type,
    lChris_THFTYPE_i: $i ).

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

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

thf(decl_27,type,
    likes_THFTYPE_IiioI: $i > $i > $o ).

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

thf(ax,axiom,
    knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).

thf(con,conjecture,
    knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

thf(ax_002,axiom,
    ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
    @ ! [X1: $i] :
        ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
       => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_002) ).

thf(ax_001,axiom,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001) ).

thf(c_0_4,axiom,
    ( ( ( lChris_THFTYPE_i != lChris_THFTYPE_i )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
    & ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax]) ).

thf(c_0_5,negated_conjecture,
    ~ ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
      & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).

thf(c_0_6,plain,
    ( ( ( lChris_THFTYPE_i != lChris_THFTYPE_i )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
    & ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_7,axiom,
    ( ( ~ ! [X1: $i] :
            ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
           => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
    & ( ! [X1: $i] :
          ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
         => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_002]) ).

thf(c_0_8,negated_conjecture,
    ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
    & ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
    & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
    & ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false )
      | ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

thf(c_0_9,plain,
    ( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true )
    | ( lChris_THFTYPE_i != lChris_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ! [X3: $i] :
      ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ esk1_0 )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ esk1_0 )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X3 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X3 )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).

thf(c_0_11,negated_conjecture,
    ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true )
    | ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_12,plain,
    knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true,
    inference(cn,[status(thm)],[c_0_9]) ).

thf(c_0_13,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true )
      | ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_14,negated_conjecture,
    ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).

thf(c_0_15,negated_conjecture,
    ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
    | ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_16,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
      | ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
    inference(sr,[status(thm)],[c_0_13,c_0_14]) ).

thf(c_0_17,plain,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[ax_001]) ).

thf(c_0_18,negated_conjecture,
    ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12])]) ).

thf(c_0_19,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : CSR152^1 : TPTP v8.2.0. Released v4.1.0.
% 0.02/0.10  % Command    : run_E %s %d THM
% 0.11/0.29  % Computer : n032.cluster.edu
% 0.11/0.29  % Model    : x86_64 x86_64
% 0.11/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29  % Memory   : 8042.1875MB
% 0.11/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29  % CPULimit   : 300
% 0.11/0.29  % WCLimit    : 300
% 0.11/0.29  % DateTime   : Sun May 19 00:41:37 EDT 2024
% 0.11/0.29  % CPUTime    : 
% 0.14/0.38  Running higher-order theorem proving
% 0.14/0.38  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.14/0.39  # Version: 3.1.0-ho
% 0.14/0.39  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.14/0.39  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39  # Starting new_ho_10 with 1500s (5) cores
% 0.14/0.39  # Starting ho_unfolding_6 with 300s (1) cores
% 0.14/0.39  # Starting sh4l with 300s (1) cores
% 0.14/0.39  # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.14/0.39  # new_ho_10 with pid 10874 completed with status 0
% 0.14/0.39  # Result found by new_ho_10
% 0.14/0.39  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.14/0.39  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39  # Starting new_ho_10 with 1500s (5) cores
% 0.14/0.39  # No SInE strategy applied
% 0.14/0.39  # Search class: HGHNF-FFSS00-SFFFFFNN
% 0.14/0.39  # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.39  # Starting new_ho_10 with 901s (1) cores
% 0.14/0.39  # Starting sh5l with 151s (1) cores
% 0.14/0.39  # Starting new_bool_1 with 151s (1) cores
% 0.14/0.39  # Starting new_bool_9 with 151s (1) cores
% 0.14/0.39  # Starting ehoh_best_sine_rwall with 146s (1) cores
% 0.14/0.39  # new_ho_10 with pid 10878 completed with status 0
% 0.14/0.39  # Result found by new_ho_10
% 0.14/0.39  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.14/0.39  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39  # Starting new_ho_10 with 1500s (5) cores
% 0.14/0.39  # No SInE strategy applied
% 0.14/0.39  # Search class: HGHNF-FFSS00-SFFFFFNN
% 0.14/0.39  # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.39  # Starting new_ho_10 with 901s (1) cores
% 0.14/0.39  # Preprocessing time       : 0.001 s
% 0.14/0.39  # Presaturation interreduction done
% 0.14/0.39  
% 0.14/0.39  # Proof found!
% 0.14/0.39  # SZS status Theorem
% 0.14/0.39  # SZS output start CNFRefutation
% See solution above
% 0.14/0.39  # Parsed axioms                        : 11
% 0.14/0.39  # Removed by relevancy pruning/SinE    : 0
% 0.14/0.39  # Initial clauses                      : 17
% 0.14/0.39  # Removed in clause preprocessing      : 9
% 0.14/0.39  # Initial clauses in saturation        : 8
% 0.14/0.39  # Processed clauses                    : 13
% 0.14/0.39  # ...of these trivial                  : 2
% 0.14/0.39  # ...subsumed                          : 1
% 0.14/0.39  # ...remaining for further processing  : 10
% 0.14/0.39  # Other redundant clauses eliminated   : 0
% 0.14/0.39  # Clauses deleted for lack of memory   : 0
% 0.14/0.39  # Backward-subsumed                    : 0
% 0.14/0.39  # Backward-rewritten                   : 0
% 0.14/0.39  # Generated clauses                    : 1
% 0.14/0.39  # ...of the previous two non-redundant : 0
% 0.14/0.39  # ...aggressively subsumed             : 0
% 0.14/0.39  # Contextual simplify-reflections      : 0
% 0.14/0.39  # Paramodulations                      : 1
% 0.14/0.39  # Factorizations                       : 0
% 0.14/0.39  # NegExts                              : 0
% 0.14/0.39  # Equation resolutions                 : 0
% 0.14/0.39  # Disequality decompositions           : 0
% 0.14/0.39  # Total rewrite steps                  : 4
% 0.14/0.39  # ...of those cached                   : 3
% 0.14/0.39  # Propositional unsat checks           : 0
% 0.14/0.39  #    Propositional check models        : 0
% 0.14/0.39  #    Propositional check unsatisfiable : 0
% 0.14/0.39  #    Propositional clauses             : 0
% 0.14/0.39  #    Propositional clauses after purity: 0
% 0.14/0.39  #    Propositional unsat core size     : 0
% 0.14/0.39  #    Propositional preprocessing time  : 0.000
% 0.14/0.39  #    Propositional encoding time       : 0.000
% 0.14/0.39  #    Propositional solver time         : 0.000
% 0.14/0.39  #    Success case prop preproc time    : 0.000
% 0.14/0.39  #    Success case prop encoding time   : 0.000
% 0.14/0.39  #    Success case prop solver time     : 0.000
% 0.14/0.39  # Current number of processed clauses  : 5
% 0.14/0.39  #    Positive orientable unit clauses  : 2
% 0.14/0.39  #    Positive unorientable unit clauses: 0
% 0.14/0.39  #    Negative unit clauses             : 2
% 0.14/0.39  #    Non-unit-clauses                  : 1
% 0.14/0.39  # Current number of unprocessed clauses: 0
% 0.14/0.39  # ...number of literals in the above   : 0
% 0.14/0.39  # Current number of archived formulas  : 0
% 0.14/0.39  # Current number of archived clauses   : 5
% 0.14/0.39  # Clause-clause subsumption calls (NU) : 0
% 0.14/0.39  # Rec. Clause-clause subsumption calls : 0
% 0.14/0.39  # Non-unit clause-clause subsumptions  : 0
% 0.14/0.39  # Unit Clause-clause subsumption calls : 0
% 0.14/0.39  # Rewrite failures with RHS unbound    : 0
% 0.14/0.39  # BW rewrite match attempts            : 0
% 0.14/0.39  # BW rewrite match successes           : 0
% 0.14/0.39  # Condensation attempts                : 13
% 0.14/0.39  # Condensation successes               : 0
% 0.14/0.39  # Termbank termtop insertions          : 607
% 0.14/0.39  # Search garbage collected termcells   : 65
% 0.14/0.39  
% 0.14/0.39  # -------------------------------------------------
% 0.14/0.39  # User time                : 0.002 s
% 0.14/0.39  # System time              : 0.002 s
% 0.14/0.39  # Total time               : 0.004 s
% 0.14/0.39  # Maximum resident set size: 1748 pages
% 0.14/0.39  
% 0.14/0.39  # -------------------------------------------------
% 0.14/0.39  # User time                : 0.007 s
% 0.14/0.39  # System time              : 0.007 s
% 0.14/0.39  # Total time               : 0.014 s
% 0.14/0.39  # Maximum resident set size: 1712 pages
% 0.14/0.39  % E---3.1 exiting
% 0.14/0.39  % E exiting
%------------------------------------------------------------------------------