↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n011.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:35 AM UTC 2026

% Result   : Theorem 0.09s 0.25s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   80 (   0 equ;   0 cnn)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  194 (  24   ~;  23   |;   9   &; 135   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    9 (   0   ^;   9   !;   0   ?;   9   :)

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

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

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

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

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

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

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

thf(con,conjecture,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox/tmp/tmp.D68fCx7BXx/E---3.1_435323.p',con) ).

thf(ax,axiom,
    ! [X1: $i] : ( holdsDuring_THFTYPE_IiooI @ X1 @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    file('/export/starexec/sandbox/tmp/tmp.D68fCx7BXx/E---3.1_435323.p',ax) ).

thf(ax_001,axiom,
    ! [X2: $i] :
      ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
      @ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2 )
       => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.D68fCx7BXx/E---3.1_435323.p',ax_001) ).

thf(c_0_3,negated_conjecture,
    ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_4,negated_conjecture,
    ~ ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[c_0_3]) ).

thf(c_0_5,axiom,
    ! [X1: $i] :
      ( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ) )
      & ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ X1 @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax]) ).

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

thf(c_0_7,negated_conjecture,
    ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
    & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
    & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( 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(fof_nnf,[status(thm)],[c_0_4])])]) ).

thf(c_0_8,plain,
    ! [X5: $i] :
      ( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ X5 @ $true ) )
      & ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ X5 @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).

thf(c_0_9,plain,
    ! [X6: $i] :
      ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X6 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X6 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X6 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X6 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    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,negated_conjecture,
    ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
    | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
    | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

thf(c_0_14,negated_conjecture,
    ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
    | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

thf(c_0_15,negated_conjecture,
    ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    inference(csr,[status(thm)],[c_0_12,c_0_13]) ).

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_9]) ).

thf(c_0_17,negated_conjecture,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    inference(sr,[status(thm)],[c_0_14,c_0_15]) ).

thf(c_0_18,negated_conjecture,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).

thf(c_0_19,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_18])]),c_0_15]),
    [proof] ).

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