↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR149^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 07:46:41 AM UTC 2026

% Result   : Theorem 0.10s 0.25s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   86 (   0 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  215 (  37   ~;  26   |;  11   &; 136   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  22   !;   6   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_38,type,
    holdsDuring_THFTYPE_IiooI: $i > $o > $o ).

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

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

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

thf(decl_84,type,
    lYearFn_THFTYPE_IiiI: $i > $i ).

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

thf(decl_94,type,
    n2009_THFTYPE_i: $i ).

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

thf(con,conjecture,
    ? [X5: $i,X6: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.eKGhPbJPtD/E---3.1_429535.p',con) ).

thf(ax_022,axiom,
    ! [X20: $i,X21: $o] :
      ( ( holdsDuring_THFTYPE_IiooI @ X20 @ ~ X21 )
     => ~ ( holdsDuring_THFTYPE_IiooI @ X20 @ X21 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.eKGhPbJPtD/E---3.1_429535.p',ax_022) ).

thf(ax_004,axiom,
    ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
    @ ! [X5: $i] :
        ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
       => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.eKGhPbJPtD/E---3.1_429535.p',ax_004) ).

thf(ax_051,axiom,
    ! [X6: $i] : ( holdsDuring_THFTYPE_IiooI @ X6 @ $true ),
    file('/export/starexec/sandbox2/tmp/tmp.eKGhPbJPtD/E---3.1_429535.p',ax_051) ).

thf(ax_023,axiom,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.eKGhPbJPtD/E---3.1_429535.p',ax_023) ).

thf(c_0_5,negated_conjecture,
    ~ ? [X5: $i,X6: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_6,negated_conjecture,
    ~ ? [X5: $i,X6: $i] :
        ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 )
          | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ $true ) )
        & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 )
          | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[c_0_5]) ).

thf(c_0_7,plain,
    ! [X20: $i,X21: $o] :
      ( ( ( X21
          | ( holdsDuring_THFTYPE_IiooI @ X20 @ $true ) )
        & ( ~ X21
          | ( holdsDuring_THFTYPE_IiooI @ X20 @ $false ) ) )
     => ~ ( holdsDuring_THFTYPE_IiooI @ X20 @ X21 ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_022])]) ).

thf(c_0_8,axiom,
    ( ( ~ ! [X5: $i] :
            ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
           => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ! [X5: $i] :
          ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
         => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_004]) ).

thf(c_0_9,negated_conjecture,
    ! [X136: $i,X137: $i] :
      ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X136 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X136 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X137 ) @ $false )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X136 ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X136 )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X137 ) @ $true ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X137 ) @ $false )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X137 ) @ $true ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

thf(c_0_10,plain,
    ! [X143: $i] : ( holdsDuring_THFTYPE_IiooI @ X143 @ $true ),
    inference(variable_rename,[status(thm)],[ax_051]) ).

thf(c_0_11,plain,
    ! [X138: $i,X139: $o] :
      ( ( X139
        | ~ X139
        | ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ X139 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ $false )
        | ~ X139
        | ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ X139 ) )
      & ( X139
        | ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ $true )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ X139 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ $false )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ $true )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ X139 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

thf(c_0_12,plain,
    ! [X145: $i] :
      ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ esk1_0 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ esk1_0 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X145 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X145 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_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_8])])])])])]) ).

thf(c_0_13,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X2 ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_14,plain,
    ! [X1: $i] : ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_15,plain,
    ! [X1: $i] :
      ( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
      | ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
    inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_11])])]) ).

thf(c_0_16,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
      | ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_17,negated_conjecture,
    ! [X1: $i] :
      ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

thf(c_0_18,plain,
    ! [X1: $i] :
      ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).

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

thf(c_0_20,plain,
    ! [X1: $i] :
      ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

thf(c_0_21,plain,
    $false,
    inference(sr,[status(thm)],[c_0_19,c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR149^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.16  % Computer : n018.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.16  % CPULimit : 300
% 0.10/0.16  % WCLimit  : 300
% 0.10/0.16  % DateTime : Tue Sep 29 17:59:41 UTC 2026
% 0.10/0.16  % CPUTime  : 
% 0.10/0.16  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20  Running higher-order theorem proving
% 0.10/0.22  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.eKGhPbJPtD/E---3.1_429535.p
% 0.10/0.25  % Version: 3.5.1-ho
% 0.10/0.25  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.10/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25  % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.10/0.25  % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.25  % Starting full_lambda_9 with 300s (1) cores
% 0.10/0.25  % full_lambda_6 with pid 429568 completed with status 0
% 0.10/0.25  % Result found by full_lambda_6
% 0.10/0.25  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.10/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25  % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.10/0.25  % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.10/0.25  % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.10/0.25  % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.10/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.25  % SubtermCWHack with pid 429574 completed with status 0
% 0.10/0.25  % Result found by SubtermCWHack
% 0.10/0.25  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.10/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25  % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.10/0.25  % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.10/0.25  % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.10/0.25  % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.10/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.25  % Preprocessing time       : 0.002 s
% 0.10/0.25  
% 0.10/0.25  % Proof found!
% 0.10/0.25  % SZS status Theorem
% 0.10/0.25  % SZS output start CNFRefutation
% See solution above
% 0.10/0.25  % Parsed axioms                        : 281
% 0.10/0.25  % Removed by relevancy pruning/SinE    : 114
% 0.10/0.25  % Initial clauses                      : 184
% 0.10/0.25  % Removed in clause preprocessing      : 6
% 0.10/0.25  % Initial clauses in saturation        : 178
% 0.10/0.25  % Processed clauses                    : 198
% 0.10/0.25  % ...of these trivial                  : 18
% 0.10/0.25  % ...subsumed                          : 4
% 0.10/0.25  % ...remaining for further processing  : 176
% 0.10/0.25  % Other redundant clauses eliminated   : 0
% 0.10/0.25  % Clauses deleted for lack of memory   : 0
% 0.10/0.25  % Backward-subsumed                    : 0
% 0.10/0.25  % Backward-rewritten                   : 0
% 0.10/0.25  % Generated clauses                    : 64
% 0.10/0.25  % ...of the previous two non-redundant : 57
% 0.10/0.25  % ...aggressively subsumed             : 0
% 0.10/0.25  % Contextual simplify-reflections      : 0
% 0.10/0.25  % Paramodulations                      : 62
% 0.10/0.25  % Factorizations                       : 0
% 0.10/0.25  % NegExts                              : 0
% 0.10/0.25  % Equation resolutions                 : 1
% 0.10/0.25  % Disequality decompositions           : 0
% 0.10/0.25  % Total rewrite steps                  : 24
% 0.10/0.25  % ...of those cached                   : 13
% 0.10/0.25  % Propositional unsat checks           : 0
% 0.10/0.25  %    Propositional check models        : 0
% 0.10/0.25  %    Propositional check unsatisfiable : 0
% 0.10/0.25  %    Propositional clauses             : 0
% 0.10/0.25  %    Propositional clauses after purity: 0
% 0.10/0.25  %    Propositional unsat core size     : 0
% 0.10/0.25  %    Propositional preprocessing time  : 0.000
% 0.10/0.25  %    Propositional encoding time       : 0.000
% 0.10/0.25  %    Propositional solver time         : 0.000
% 0.10/0.25  %    Success case prop preproc time    : 0.000
% 0.10/0.25  %    Success case prop encoding time   : 0.000
% 0.10/0.25  %    Success case prop solver time     : 0.000
% 0.10/0.25  % Current number of processed clauses  : 175
% 0.10/0.25  %    Positive orientable unit clauses  : 150
% 0.10/0.25  %    Positive unorientable unit clauses: 0
% 0.10/0.25  %    Negative unit clauses             : 4
% 0.10/0.25  %    Non-unit-clauses                  : 21
% 0.10/0.25  % Current number of unprocessed clauses: 37
% 0.10/0.25  % ...number of literals in the above   : 104
% 0.10/0.25  % Current number of archived formulas  : 0
% 0.10/0.25  % Current number of archived clauses   : 1
% 0.10/0.25  % Clause-clause subsumption calls (NU) : 56
% 0.10/0.25  % Rec. Clause-clause subsumption calls : 47
% 0.10/0.25  % Non-unit clause-clause subsumptions  : 1
% 0.10/0.25  % Unit Clause-clause subsumption calls : 37
% 0.10/0.25  % Rewrite failures with RHS unbound    : 0
% 0.10/0.25  % BW rewrite match attempts            : 0
% 0.10/0.25  % BW rewrite match successes           : 0
% 0.10/0.25  % Condensation attempts                : 0
% 0.10/0.25  % Condensation successes               : 0
% 0.10/0.25  % Termbank termtop insertions          : 8954
% 0.10/0.25  % Search garbage collected termcells   : 1353
% 0.10/0.25  
% 0.10/0.25  % -------------------------------------------------
% 0.10/0.25  % User time                : 0.009 s
% 0.10/0.25  % System time              : 0.005 s
% 0.10/0.25  % Total time               : 0.014 s
% 0.10/0.25  % Maximum resident set size: 4096 pages
% 0.10/0.25  
% 0.10/0.25  % -------------------------------------------------
% 0.10/0.25  % User time                : 0.013 s
% 0.10/0.25  % System time              : 0.011 s
% 0.10/0.25  % Total time               : 0.024 s
% 0.10/0.25  % Maximum resident set size: 5120 pages
% 0.10/0.25  % E exiting
%------------------------------------------------------------------------------