↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR148^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 : n006.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:40 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   84 (   0 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  218 (  38   ~;  27   |;  11   &; 136   @)
%                                         (   0 <=>;   6  =>;   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   :   30 (   0   ^;  24   !;   6   ?;  30   :)

% 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.AUsV3zbsCw/E---3.1_1097436.p',con) ).

thf(ax_024,axiom,
    ! [X21: $i,X22: $o] :
      ( ( holdsDuring_THFTYPE_IiooI @ X21 @ ~ X22 )
     => ~ ( holdsDuring_THFTYPE_IiooI @ X21 @ X22 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.AUsV3zbsCw/E---3.1_1097436.p',ax_024) ).

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.AUsV3zbsCw/E---3.1_1097436.p',ax_004) ).

thf(ax_007,axiom,
    ! [X9: $o,X6: $i] :
      ( X9
     => ( holdsDuring_THFTYPE_IiooI @ X6 @ X9 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.AUsV3zbsCw/E---3.1_1097436.p',ax_007) ).

thf(ax_025,axiom,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.AUsV3zbsCw/E---3.1_1097436.p',ax_025) ).

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,
    ! [X21: $i,X22: $o] :
      ( ( ( X22
          | ( holdsDuring_THFTYPE_IiooI @ X21 @ $true ) )
        & ( ~ X22
          | ( holdsDuring_THFTYPE_IiooI @ X21 @ $false ) ) )
     => ~ ( holdsDuring_THFTYPE_IiooI @ X21 @ X22 ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_024])]) ).

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,
    ! [X100: $i,X101: $i] :
      ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X100 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X100 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X101 ) @ $false )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X100 ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X100 )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X101 ) @ $true ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X101 ) @ $false )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X101 ) @ $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,
    ! [X102: $o,X103: $i] :
      ( ~ X102
      | ( holdsDuring_THFTYPE_IiooI @ X103 @ X102 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_007])])]) ).

thf(c_0_11,plain,
    ! [X106: $i,X107: $o] :
      ( ( X107
        | ~ X107
        | ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ X107 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ $false )
        | ~ X107
        | ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ X107 ) )
      & ( X107
        | ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ $true )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ X107 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ $false )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ $true )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X106 @ X107 ) ) ),
    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,
    ! [X112: $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 @ X112 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X112 )
        | ( 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(cn,[status(thm)],[inference(cn,[status(thm)],[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_025]) ).

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  : CSR148^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.08/0.16  % Computer : n006.cluster.edu
% 0.08/0.16  % Model    : x86_64 x86_64
% 0.08/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16  % Memory   : 8046.5625MB
% 0.08/0.16  % OS       : Linux 6.8.0-71-generic
% 0.08/0.16  % CPULimit : 300
% 0.08/0.16  % WCLimit  : 300
% 0.08/0.16  % DateTime : Tue Sep 29 17:56:54 UTC 2026
% 0.08/0.16  % CPUTime  : 
% 0.08/0.16  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running higher-order theorem proving
% 0.08/0.23  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.AUsV3zbsCw/E---3.1_1097436.p
% 0.21/0.27  % Version: 3.5.1-ho
% 0.21/0.27  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.27  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.27  % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.27  % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.27  % full_lambda_9 with pid 1097452 completed with status 0
% 0.21/0.27  % Result found by full_lambda_9
% 0.21/0.27  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.27  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.27  % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.27  % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.27  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.21/0.27  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.27  % Search class: HGHSS-FFMM21-SHFFFFBN
% 0.21/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27  % SubtermCWHack with pid 1097454 completed with status 0
% 0.21/0.27  % Result found by SubtermCWHack
% 0.21/0.27  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.27  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.27  % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.27  % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.27  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.21/0.27  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.27  % Search class: HGHSS-FFMM21-SHFFFFBN
% 0.21/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27  % Preprocessing time       : 0.001 s
% 0.21/0.27  
% 0.21/0.27  % Proof found!
% 0.21/0.27  % SZS status Theorem
% 0.21/0.27  % SZS output start CNFRefutation
% See solution above
% 0.21/0.27  % Parsed axioms                        : 282
% 0.21/0.27  % Removed by relevancy pruning/SinE    : 181
% 0.21/0.27  % Initial clauses                      : 116
% 0.21/0.27  % Removed in clause preprocessing      : 6
% 0.21/0.27  % Initial clauses in saturation        : 110
% 0.21/0.27  % Processed clauses                    : 121
% 0.21/0.27  % ...of these trivial                  : 17
% 0.21/0.27  % ...subsumed                          : 3
% 0.21/0.27  % ...remaining for further processing  : 101
% 0.21/0.27  % Other redundant clauses eliminated   : 0
% 0.21/0.27  % Clauses deleted for lack of memory   : 0
% 0.21/0.27  % Backward-subsumed                    : 0
% 0.21/0.27  % Backward-rewritten                   : 0
% 0.21/0.27  % Generated clauses                    : 28
% 0.21/0.27  % ...of the previous two non-redundant : 24
% 0.21/0.27  % ...aggressively subsumed             : 0
% 0.21/0.27  % Contextual simplify-reflections      : 0
% 0.21/0.27  % Paramodulations                      : 26
% 0.21/0.27  % Factorizations                       : 0
% 0.21/0.27  % NegExts                              : 0
% 0.21/0.27  % Equation resolutions                 : 1
% 0.21/0.27  % Disequality decompositions           : 0
% 0.21/0.27  % Total rewrite steps                  : 22
% 0.21/0.27  % ...of those cached                   : 13
% 0.21/0.27  % Propositional unsat checks           : 0
% 0.21/0.27  %    Propositional check models        : 0
% 0.21/0.27  %    Propositional check unsatisfiable : 0
% 0.21/0.27  %    Propositional clauses             : 0
% 0.21/0.27  %    Propositional clauses after purity: 0
% 0.21/0.27  %    Propositional unsat core size     : 0
% 0.21/0.27  %    Propositional preprocessing time  : 0.000
% 0.21/0.27  %    Propositional encoding time       : 0.000
% 0.21/0.27  %    Propositional solver time         : 0.000
% 0.21/0.27  %    Success case prop preproc time    : 0.000
% 0.21/0.27  %    Success case prop encoding time   : 0.000
% 0.21/0.27  %    Success case prop solver time     : 0.000
% 0.21/0.27  % Current number of processed clauses  : 100
% 0.21/0.27  %    Positive orientable unit clauses  : 89
% 0.21/0.27  %    Positive unorientable unit clauses: 0
% 0.21/0.27  %    Negative unit clauses             : 4
% 0.21/0.27  %    Non-unit-clauses                  : 7
% 0.21/0.27  % Current number of unprocessed clauses: 13
% 0.21/0.27  % ...number of literals in the above   : 43
% 0.21/0.27  % Current number of archived formulas  : 0
% 0.21/0.27  % Current number of archived clauses   : 1
% 0.21/0.27  % Clause-clause subsumption calls (NU) : 3
% 0.21/0.27  % Rec. Clause-clause subsumption calls : 3
% 0.21/0.27  % Non-unit clause-clause subsumptions  : 0
% 0.21/0.27  % Unit Clause-clause subsumption calls : 22
% 0.21/0.27  % Rewrite failures with RHS unbound    : 0
% 0.21/0.27  % BW rewrite match attempts            : 0
% 0.21/0.27  % BW rewrite match successes           : 0
% 0.21/0.27  % Condensation attempts                : 0
% 0.21/0.27  % Condensation successes               : 0
% 0.21/0.27  % Termbank termtop insertions          : 6139
% 0.21/0.27  % Search garbage collected termcells   : 1164
% 0.21/0.27  
% 0.21/0.27  % -------------------------------------------------
% 0.21/0.27  % User time                : 0.006 s
% 0.21/0.27  % System time              : 0.004 s
% 0.21/0.27  % Total time               : 0.010 s
% 0.21/0.27  % Maximum resident set size: 4100 pages
% 0.21/0.27  
% 0.21/0.27  % -------------------------------------------------
% 0.21/0.27  % User time                : 0.013 s
% 0.21/0.27  % System time              : 0.008 s
% 0.21/0.27  % Total time               : 0.020 s
% 0.21/0.27  % Maximum resident set size: 5120 pages
% 0.21/0.27  % E exiting
%------------------------------------------------------------------------------