↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR121^2 : 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 : 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.07s 0.16s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   86 (   0 equ;   0 cnn)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  237 (  39   ~;  31   |;  13   &; 154   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   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   :   10 (   0   ^;   7   !;   3   ?;  10   :)

% 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(con,conjecture,
    ? [X5: $i] :
      ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
      @ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
        & ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PefnZ0v8Fs/E---3.1_457606.p',con) ).

thf(ax_049,axiom,
    ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
    @ ~ ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PefnZ0v8Fs/E---3.1_457606.p',ax_049) ).

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

thf(c_0_3,negated_conjecture,
    ~ ? [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 ) )
        & ( ( ( 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)],[c_0_2]) ).

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

thf(c_0_5,negated_conjecture,
    ! [X130: $i] :
      ( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 )
        | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 )
        | ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 )
        | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 )
        | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 )
        | ~ ( 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_3])])])]) ).

thf(c_0_6,plain,
    ( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) )
    & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

thf(c_0_7,negated_conjecture,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,plain,
    ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

thf(c_0_10,plain,
    ( ( 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_6]) ).

thf(c_0_11,negated_conjecture,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_13,plain,
    ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
    | ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
    | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_14,negated_conjecture,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    inference(ef,[status(thm)],[c_0_11]) ).

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

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

thf(c_0_17,plain,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

thf(c_0_18,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
      | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : CSR121^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.10  % Computer : n012.cluster.edu
% 0.00/0.10  % Model    : x86_64 x86_64
% 0.00/0.10  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10  % Memory   : 8046.5625MB
% 0.00/0.10  % OS       : Linux 6.8.0-71-generic
% 0.00/0.10  % CPULimit : 300
% 0.00/0.10  % WCLimit  : 300
% 0.00/0.10  % DateTime : Tue Sep 29 17:54:18 UTC 2026
% 0.00/0.10  % CPUTime  : 
% 0.00/0.10  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.12  Running higher-order theorem proving
% 0.07/0.13  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.PefnZ0v8Fs/E---3.1_457606.p
% 0.07/0.16  % Version: 3.5.1-ho
% 0.07/0.16  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.07/0.16  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.16  % Starting new_ho_10 with 1500s (5) cores
% 0.07/0.16  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.07/0.16  % Starting full_lambda_6 with 300s (1) cores
% 0.07/0.16  % Starting full_lambda_9 with 300s (1) cores
% 0.07/0.16  % full_lambda_9 with pid 457622 completed with status 0
% 0.07/0.16  % Result found by full_lambda_9
% 0.07/0.16  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.07/0.16  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.16  % Starting new_ho_10 with 1500s (5) cores
% 0.07/0.16  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.07/0.16  % Starting full_lambda_6 with 300s (1) cores
% 0.07/0.16  % Starting full_lambda_9 with 300s (1) cores
% 0.07/0.16  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.07/0.16  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.07/0.16  % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.07/0.16  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.16  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.16  % SubtermCWHack with pid 457623 completed with status 0
% 0.07/0.16  % Result found by SubtermCWHack
% 0.07/0.16  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.07/0.16  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.16  % Starting new_ho_10 with 1500s (5) cores
% 0.07/0.16  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.07/0.16  % Starting full_lambda_6 with 300s (1) cores
% 0.07/0.16  % Starting full_lambda_9 with 300s (1) cores
% 0.07/0.16  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.07/0.16  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.07/0.16  % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.07/0.16  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.16  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.16  % Preprocessing time       : 0.001 s
% 0.07/0.16  
% 0.07/0.16  % Proof found!
% 0.07/0.16  % SZS status Theorem
% 0.07/0.16  % SZS output start CNFRefutation
% See solution above
% 0.07/0.16  % Parsed axioms                        : 279
% 0.07/0.16  % Removed by relevancy pruning/SinE    : 148
% 0.07/0.16  % Initial clauses                      : 150
% 0.07/0.16  % Removed in clause preprocessing      : 7
% 0.07/0.16  % Initial clauses in saturation        : 143
% 0.07/0.16  % Processed clauses                    : 209
% 0.07/0.16  % ...of these trivial                  : 13
% 0.07/0.16  % ...subsumed                          : 11
% 0.07/0.16  % ...remaining for further processing  : 185
% 0.07/0.16  % Other redundant clauses eliminated   : 0
% 0.07/0.16  % Clauses deleted for lack of memory   : 0
% 0.07/0.16  % Backward-subsumed                    : 3
% 0.07/0.16  % Backward-rewritten                   : 2
% 0.07/0.16  % Generated clauses                    : 97
% 0.07/0.16  % ...of the previous two non-redundant : 85
% 0.07/0.16  % ...aggressively subsumed             : 0
% 0.07/0.16  % Contextual simplify-reflections      : 0
% 0.07/0.16  % Paramodulations                      : 92
% 0.07/0.16  % Factorizations                       : 4
% 0.07/0.16  % NegExts                              : 0
% 0.07/0.16  % Equation resolutions                 : 1
% 0.07/0.16  % Disequality decompositions           : 0
% 0.07/0.16  % Total rewrite steps                  : 25
% 0.07/0.16  % ...of those cached                   : 14
% 0.07/0.16  % Propositional unsat checks           : 0
% 0.07/0.16  %    Propositional check models        : 0
% 0.07/0.16  %    Propositional check unsatisfiable : 0
% 0.07/0.16  %    Propositional clauses             : 0
% 0.07/0.16  %    Propositional clauses after purity: 0
% 0.07/0.16  %    Propositional unsat core size     : 0
% 0.07/0.16  %    Propositional preprocessing time  : 0.000
% 0.07/0.16  %    Propositional encoding time       : 0.000
% 0.07/0.16  %    Propositional solver time         : 0.000
% 0.07/0.16  %    Success case prop preproc time    : 0.000
% 0.07/0.16  %    Success case prop encoding time   : 0.000
% 0.07/0.16  %    Success case prop solver time     : 0.000
% 0.07/0.16  % Current number of processed clauses  : 180
% 0.07/0.16  %    Positive orientable unit clauses  : 122
% 0.07/0.16  %    Positive unorientable unit clauses: 0
% 0.07/0.16  %    Negative unit clauses             : 1
% 0.07/0.16  %    Non-unit-clauses                  : 57
% 0.07/0.16  % Current number of unprocessed clauses: 15
% 0.07/0.16  % ...number of literals in the above   : 52
% 0.07/0.16  % Current number of archived formulas  : 0
% 0.07/0.16  % Current number of archived clauses   : 5
% 0.07/0.16  % Clause-clause subsumption calls (NU) : 611
% 0.07/0.16  % Rec. Clause-clause subsumption calls : 581
% 0.07/0.16  % Non-unit clause-clause subsumptions  : 11
% 0.07/0.16  % Unit Clause-clause subsumption calls : 109
% 0.07/0.16  % Rewrite failures with RHS unbound    : 0
% 0.07/0.16  % BW rewrite match attempts            : 2
% 0.07/0.16  % BW rewrite match successes           : 2
% 0.07/0.16  % Condensation attempts                : 0
% 0.07/0.16  % Condensation successes               : 0
% 0.07/0.16  % Termbank termtop insertions          : 8722
% 0.07/0.16  % Search garbage collected termcells   : 1343
% 0.07/0.16  
% 0.07/0.16  % -------------------------------------------------
% 0.07/0.16  % User time                : 0.005 s
% 0.07/0.16  % System time              : 0.005 s
% 0.07/0.16  % Total time               : 0.010 s
% 0.07/0.16  % Maximum resident set size: 4096 pages
% 0.07/0.16  
% 0.07/0.16  % -------------------------------------------------
% 0.07/0.16  % User time                : 0.008 s
% 0.07/0.16  % System time              : 0.006 s
% 0.07/0.16  % Total time               : 0.015 s
% 0.07/0.16  % Maximum resident set size: 5120 pages
% 0.07/0.16  % E exiting
%------------------------------------------------------------------------------