↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR123^1 : 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 : n012.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:34 AM UTC 2026

% Result   : Theorem 0.08s 0.13s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   50 (   0 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  197 (  32   ~;  22   |;  12   &; 131   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   23 (   0   ^;  14   !;   9   ?;  23   :)

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

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

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

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

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

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

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

thf(con,conjecture,
    ? [X1: $i > $i > $o,X2: $i,X3: $i] :
      ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
      @ ( ( X1 @ lSue_THFTYPE_i @ X2 )
        & ~ ( X1 @ lSue_THFTYPE_i @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.oDBKejQEb0/E---3.1_458149.p',con) ).

thf(ax_002,axiom,
    ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
    @ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ),
    file('/export/starexec/sandbox2/tmp/tmp.oDBKejQEb0/E---3.1_458149.p',ax_002) ).

thf(ax,axiom,
    likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.oDBKejQEb0/E---3.1_458149.p',ax) ).

thf(c_0_3,negated_conjecture,
    ~ ? [X1: $i > $i > $o,X2: $i,X3: $i] :
        ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
        @ ( ( X1 @ lSue_THFTYPE_i @ X2 )
          & ~ ( X1 @ lSue_THFTYPE_i @ X3 ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_4,negated_conjecture,
    ~ ? [X1: $i > $i > $o,X2: $i,X3: $i] :
        ( ( ~ ( ( X1 @ lSue_THFTYPE_i @ X2 )
              & ~ ( X1 @ lSue_THFTYPE_i @ X3 ) )
          | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
        & ( ( ( X1 @ lSue_THFTYPE_i @ X2 )
            & ~ ( X1 @ lSue_THFTYPE_i @ X3 ) )
          | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[c_0_3]) ).

thf(c_0_5,plain,
    ( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_002])]) ).

thf(c_0_6,negated_conjecture,
    ! [X7: $i > $i > $o,X8: $i,X9: $i] :
      ( ( ~ ( X7 @ lSue_THFTYPE_i @ X8 )
        | ( X7 @ lSue_THFTYPE_i @ X9 )
        | ( X7 @ lSue_THFTYPE_i @ X8 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( X7 @ lSue_THFTYPE_i @ X8 ) )
      & ( ~ ( X7 @ lSue_THFTYPE_i @ X8 )
        | ( X7 @ lSue_THFTYPE_i @ X9 )
        | ~ ( X7 @ lSue_THFTYPE_i @ X9 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ~ ( X7 @ lSue_THFTYPE_i @ X9 ) )
      & ( ~ ( X7 @ lSue_THFTYPE_i @ X8 )
        | ( X7 @ lSue_THFTYPE_i @ X9 )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

thf(c_0_7,plain,
    ( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i] :
      ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
      | ~ ( X1 @ lSue_THFTYPE_i @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

thf(c_0_10,plain,
    ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
    | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_12,negated_conjecture,
    ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
    inference(csr,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_13,negated_conjecture,
    ! [X1: $i > $i > $o,X3: $i,X2: $i] :
      ( ( X1 @ lSue_THFTYPE_i @ X3 )
      | ~ ( X1 @ lSue_THFTYPE_i @ X2 )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_14,plain,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

thf(c_0_15,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i,X3: $i] :
      ( ( X1 @ lSue_THFTYPE_i @ X2 )
      | ~ ( X1 @ lSue_THFTYPE_i @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

thf(c_0_16,plain,
    likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[ax]) ).

thf(c_0_17,negated_conjecture,
    ! [X2: $i] : ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

thf(c_0_18,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_17])]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : CSR123^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.09  % Computer : n012.cluster.edu
% 0.00/0.09  % Model    : x86_64 x86_64
% 0.00/0.09  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.09  % Memory   : 8046.5625MB
% 0.00/0.09  % OS       : Linux 6.8.0-71-generic
% 0.00/0.09  % CPULimit : 300
% 0.00/0.09  % WCLimit  : 300
% 0.00/0.09  % DateTime : Tue Sep 29 17:54:33 UTC 2026
% 0.00/0.09  % CPUTime  : 
% 0.00/0.09  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.11  Running higher-order theorem proving
% 0.08/0.12  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.oDBKejQEb0/E---3.1_458149.p
% 0.08/0.13  % Version: 3.5.1-ho
% 0.08/0.13  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.08/0.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.13  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.08/0.13  % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.13  % Starting new_bool_9 with 300s (1) cores
% 0.08/0.13  % Starting sh5l with 300s (1) cores
% 0.08/0.13  % post_as_ho10 with pid 458163 completed with status 0
% 0.08/0.13  % Result found by post_as_ho10
% 0.08/0.13  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.08/0.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.13  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.08/0.13  % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.13  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.13  % No SInE strategy applied
% 0.08/0.13  % Search class: HGHNF-FFSS11-SSSFFSBN
% 0.08/0.13  % partial match(1): HGHNF-FFSM11-SSSFFSBN
% 0.08/0.13  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.13  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.13  % SubtermCWHack with pid 458168 completed with status 0
% 0.08/0.13  % Result found by SubtermCWHack
% 0.08/0.13  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.08/0.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.13  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.08/0.13  % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.13  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.13  % No SInE strategy applied
% 0.08/0.13  % Search class: HGHNF-FFSS11-SSSFFSBN
% 0.08/0.13  % partial match(1): HGHNF-FFSM11-SSSFFSBN
% 0.08/0.13  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.13  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.13  % Preprocessing time       : 0.001 s
% 0.08/0.13  
% 0.08/0.13  % Proof found!
% 0.08/0.13  % SZS status Theorem
% 0.08/0.13  % SZS output start CNFRefutation
% See solution above
% 0.08/0.13  % Parsed axioms                        : 13
% 0.08/0.13  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.13  % Initial clauses                      : 19
% 0.08/0.13  % Removed in clause preprocessing      : 11
% 0.08/0.13  % Initial clauses in saturation        : 8
% 0.08/0.13  % Processed clauses                    : 10
% 0.08/0.13  % ...of these trivial                  : 0
% 0.08/0.13  % ...subsumed                          : 1
% 0.08/0.13  % ...remaining for further processing  : 9
% 0.08/0.13  % Other redundant clauses eliminated   : 0
% 0.08/0.13  % Clauses deleted for lack of memory   : 0
% 0.08/0.13  % Backward-subsumed                    : 1
% 0.08/0.13  % Backward-rewritten                   : 3
% 0.08/0.13  % Generated clauses                    : 3
% 0.08/0.13  % ...of the previous two non-redundant : 2
% 0.08/0.13  % ...aggressively subsumed             : 0
% 0.08/0.13  % Contextual simplify-reflections      : 1
% 0.08/0.13  % Paramodulations                      : 3
% 0.08/0.13  % Factorizations                       : 0
% 0.08/0.13  % NegExts                              : 0
% 0.08/0.13  % Equation resolutions                 : 0
% 0.08/0.13  % Disequality decompositions           : 0
% 0.08/0.13  % Total rewrite steps                  : 3
% 0.08/0.13  % ...of those cached                   : 0
% 0.08/0.13  % Propositional unsat checks           : 0
% 0.08/0.13  %    Propositional check models        : 0
% 0.08/0.13  %    Propositional check unsatisfiable : 0
% 0.08/0.13  %    Propositional clauses             : 0
% 0.08/0.13  %    Propositional clauses after purity: 0
% 0.08/0.13  %    Propositional unsat core size     : 0
% 0.08/0.13  %    Propositional preprocessing time  : 0.000
% 0.08/0.13  %    Propositional encoding time       : 0.000
% 0.08/0.13  %    Propositional solver time         : 0.000
% 0.08/0.13  %    Success case prop preproc time    : 0.000
% 0.08/0.13  %    Success case prop encoding time   : 0.000
% 0.08/0.13  %    Success case prop solver time     : 0.000
% 0.08/0.13  % Current number of processed clauses  : 5
% 0.08/0.13  %    Positive orientable unit clauses  : 3
% 0.08/0.13  %    Positive unorientable unit clauses: 0
% 0.08/0.13  %    Negative unit clauses             : 1
% 0.08/0.13  %    Non-unit-clauses                  : 1
% 0.08/0.13  % Current number of unprocessed clauses: 0
% 0.08/0.13  % ...number of literals in the above   : 0
% 0.08/0.13  % Current number of archived formulas  : 0
% 0.08/0.13  % Current number of archived clauses   : 4
% 0.08/0.13  % Clause-clause subsumption calls (NU) : 1
% 0.08/0.13  % Rec. Clause-clause subsumption calls : 1
% 0.08/0.13  % Non-unit clause-clause subsumptions  : 1
% 0.08/0.13  % Unit Clause-clause subsumption calls : 1
% 0.08/0.13  % Rewrite failures with RHS unbound    : 0
% 0.08/0.13  % BW rewrite match attempts            : 3
% 0.08/0.13  % BW rewrite match successes           : 3
% 0.08/0.13  % Condensation attempts                : 0
% 0.08/0.13  % Condensation successes               : 0
% 0.08/0.13  % Termbank termtop insertions          : 721
% 0.08/0.13  % Search garbage collected termcells   : 84
% 0.08/0.13  
% 0.08/0.13  % -------------------------------------------------
% 0.08/0.13  % User time                : 0.002 s
% 0.08/0.13  % System time              : 0.001 s
% 0.08/0.13  % Total time               : 0.003 s
% 0.08/0.13  % Maximum resident set size: 3632 pages
% 0.08/0.13  
% 0.08/0.13  % -------------------------------------------------
% 0.08/0.13  % User time                : 0.003 s
% 0.08/0.13  % System time              : 0.003 s
% 0.08/0.13  % Total time               : 0.006 s
% 0.08/0.13  % Maximum resident set size: 4864 pages
% 0.08/0.13  % E exiting
%------------------------------------------------------------------------------