↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.23s 0.27s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   81 (   6 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  164 (  26   ~;  22   |;   9   &; 104   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   7 con; 0-2 aty)
%            Number of variables   :    6 (   0   ^;   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_34,type,
    knows_THFTYPE_IiooI: $i > $o > $o ).

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

thf(decl_39,type,
    lChris_THFTYPE_i: $i ).

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

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

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

thf(decl_64,type,
    esk2_0: $i ).

thf(con,conjecture,
    knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.wh5gHaUsR7/E---3.1_956736.p',con) ).

thf(ax_015,axiom,
    knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.wh5gHaUsR7/E---3.1_956736.p',ax_015) ).

thf(ax_017,axiom,
    ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
    @ ! [X1: $i] :
        ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
       => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.wh5gHaUsR7/E---3.1_956736.p',ax_017) ).

thf(ax_006,axiom,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.wh5gHaUsR7/E---3.1_956736.p',ax_006) ).

thf(c_0_4,negated_conjecture,
    ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_5,axiom,
    ( ( ( lChris_THFTYPE_i != lChris_THFTYPE_i )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
    & ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_015]) ).

thf(c_0_6,negated_conjecture,
    ~ ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
      & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    ( ( ( lChris_THFTYPE_i != lChris_THFTYPE_i )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
    & ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

thf(c_0_8,axiom,
    ( ( ~ ! [X1: $i] :
            ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
           => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
    & ( ! [X1: $i] :
          ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
         => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_017]) ).

thf(c_0_9,negated_conjecture,
    ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
    & ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
    & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
    & ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false )
      | ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

thf(c_0_10,plain,
    ( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true )
    | ( lChris_THFTYPE_i != lChris_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X85: $i] :
      ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ esk2_0 )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ esk2_0 )
        | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X85 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X85 )
        | ( knows_THFTYPE_IiooI @ lChris_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_12,negated_conjecture,
    ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true )
    | ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_13,plain,
    knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true,
    inference(cn,[status(thm)],[c_0_10]) ).

thf(c_0_14,negated_conjecture,
    ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
    | ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_15,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
      | ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true )
      | ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_16,negated_conjecture,
    ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).

thf(c_0_17,negated_conjecture,
    ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13])]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR152^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n026.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 18:00:42 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.07/0.25  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.wh5gHaUsR7/E---3.1_956736.p
% 0.23/0.27  % Version: 3.5.1-ho
% 0.23/0.27  % partial match(1): HSLSSMSMSSSNHFA
% 0.23/0.27  % Preprocessing class: HSMSSMSMSSSNHFA.
% 0.23/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27  % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.23/0.27  % Starting full_lambda_6 with 300s (1) cores
% 0.23/0.27  % Starting full_lambda_9 with 300s (1) cores
% 0.23/0.27  % new_ho_10_cnf2 with pid 956750 completed with status 0
% 0.23/0.27  % Result found by new_ho_10_cnf2
% 0.23/0.27  % partial match(1): HSLSSMSMSSSNHFA
% 0.23/0.27  % Preprocessing class: HSMSSMSMSSSNHFA.
% 0.23/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27  % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.23/0.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.27  % No SInE strategy applied
% 0.23/0.27  % Search class: HGHNF-FFMM11-SHFFFFBN
% 0.23/0.27  % partial match(2): HGHSF-FFMM21-SHFFFFBN
% 0.23/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.27  % SubtermCWHack with pid 956753 completed with status 0
% 0.23/0.27  % Result found by SubtermCWHack
% 0.23/0.27  % partial match(1): HSLSSMSMSSSNHFA
% 0.23/0.27  % Preprocessing class: HSMSSMSMSSSNHFA.
% 0.23/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27  % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.23/0.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.27  % No SInE strategy applied
% 0.23/0.27  % Search class: HGHNF-FFMM11-SHFFFFBN
% 0.23/0.27  % partial match(2): HGHSF-FFMM21-SHFFFFBN
% 0.23/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.27  % Preprocessing time       : 0.002 s
% 0.23/0.27  
% 0.23/0.27  % Proof found!
% 0.23/0.27  % SZS status Theorem
% 0.23/0.27  % SZS output start CNFRefutation
% See solution above
% 0.23/0.27  % Parsed axioms                        : 90
% 0.23/0.27  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.27  % Initial clauses                      : 106
% 0.23/0.27  % Removed in clause preprocessing      : 49
% 0.23/0.27  % Initial clauses in saturation        : 57
% 0.23/0.27  % Processed clauses                    : 50
% 0.23/0.27  % ...of these trivial                  : 6
% 0.23/0.27  % ...subsumed                          : 1
% 0.23/0.27  % ...remaining for further processing  : 43
% 0.23/0.27  % Other redundant clauses eliminated   : 0
% 0.23/0.27  % Clauses deleted for lack of memory   : 0
% 0.23/0.27  % Backward-subsumed                    : 1
% 0.23/0.27  % Backward-rewritten                   : 0
% 0.23/0.27  % Generated clauses                    : 3
% 0.23/0.27  % ...of the previous two non-redundant : 1
% 0.23/0.27  % ...aggressively subsumed             : 0
% 0.23/0.27  % Contextual simplify-reflections      : 0
% 0.23/0.27  % Paramodulations                      : 3
% 0.23/0.27  % Factorizations                       : 0
% 0.23/0.27  % NegExts                              : 0
% 0.23/0.27  % Equation resolutions                 : 0
% 0.23/0.27  % Disequality decompositions           : 0
% 0.23/0.27  % Total rewrite steps                  : 9
% 0.23/0.27  % ...of those cached                   : 7
% 0.23/0.27  % Propositional unsat checks           : 0
% 0.23/0.27  %    Propositional check models        : 0
% 0.23/0.27  %    Propositional check unsatisfiable : 0
% 0.23/0.27  %    Propositional clauses             : 0
% 0.23/0.27  %    Propositional clauses after purity: 0
% 0.23/0.27  %    Propositional unsat core size     : 0
% 0.23/0.27  %    Propositional preprocessing time  : 0.000
% 0.23/0.27  %    Propositional encoding time       : 0.000
% 0.23/0.27  %    Propositional solver time         : 0.000
% 0.23/0.27  %    Success case prop preproc time    : 0.000
% 0.23/0.27  %    Success case prop encoding time   : 0.000
% 0.23/0.27  %    Success case prop solver time     : 0.000
% 0.23/0.27  % Current number of processed clauses  : 42
% 0.23/0.27  %    Positive orientable unit clauses  : 32
% 0.23/0.27  %    Positive unorientable unit clauses: 0
% 0.23/0.27  %    Negative unit clauses             : 2
% 0.23/0.27  %    Non-unit-clauses                  : 8
% 0.23/0.27  % Current number of unprocessed clauses: 8
% 0.23/0.27  % ...number of literals in the above   : 26
% 0.23/0.27  % Current number of archived formulas  : 0
% 0.23/0.27  % Current number of archived clauses   : 1
% 0.23/0.27  % Clause-clause subsumption calls (NU) : 4
% 0.23/0.27  % Rec. Clause-clause subsumption calls : 3
% 0.23/0.27  % Non-unit clause-clause subsumptions  : 1
% 0.23/0.27  % Unit Clause-clause subsumption calls : 2
% 0.23/0.27  % Rewrite failures with RHS unbound    : 0
% 0.23/0.27  % BW rewrite match attempts            : 0
% 0.23/0.27  % BW rewrite match successes           : 0
% 0.23/0.27  % Condensation attempts                : 0
% 0.23/0.27  % Condensation successes               : 0
% 0.23/0.27  % Termbank termtop insertions          : 3798
% 0.23/0.27  % Search garbage collected termcells   : 595
% 0.23/0.27  
% 0.23/0.27  % -------------------------------------------------
% 0.23/0.27  % User time                : 0.009 s
% 0.23/0.27  % System time              : 0.000 s
% 0.23/0.27  % Total time               : 0.009 s
% 0.23/0.27  % Maximum resident set size: 3668 pages
% 0.23/0.27  
% 0.23/0.27  % -------------------------------------------------
% 0.23/0.27  % User time                : 0.011 s
% 0.23/0.27  % System time              : 0.005 s
% 0.23/0.27  % Total time               : 0.017 s
% 0.23/0.27  % Maximum resident set size: 4864 pages
% 0.23/0.27  % E exiting
%------------------------------------------------------------------------------