↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR145^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 : n017.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.11s 0.25s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (   2 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  115 (  23   ~;  14   |;   5   &;  70   @)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   24 (  24   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   36 (   4   ^;  27   !;   5   ?;  36   :)

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

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

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

thf(decl_26,type,
    wife_THFTYPE_IiioI: $i > $i > $o ).

thf(decl_27,type,
    inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).

thf(decl_28,type,
    esk1_0: $i ).

thf(con,conjecture,
    ? [X6: $i > $i > $o] :
      ( ( X6 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
      & ( X6
       != ( ^ [X5: $i,X7: $i] : $true ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.uyi4L10Qxl/E---3.1_680965.p',con) ).

thf(ax_001,axiom,
    ! [X1: $i > $i > $o,X2: $i > $i > $o] :
      ( ( inverse_THFTYPE_IIiioIIiioIoI @ X2 @ X1 )
     => ! [X3: $i,X4: $i] :
          ( ( X2 @ X3 @ X4 )
        <=> ( X1 @ X4 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.uyi4L10Qxl/E---3.1_680965.p',ax_001) ).

thf(ax_002,axiom,
    ? [X5: $i] :
      ~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X5 ),
    file('/export/starexec/sandbox2/tmp/tmp.uyi4L10Qxl/E---3.1_680965.p',ax_002) ).

thf(ax,axiom,
    inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
    file('/export/starexec/sandbox2/tmp/tmp.uyi4L10Qxl/E---3.1_680965.p',ax) ).

thf(ax_003,axiom,
    wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.uyi4L10Qxl/E---3.1_680965.p',ax_003) ).

thf(c_0_5,negated_conjecture,
    ~ ? [X6: $i > $i > $o] :
        ( ( X6 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
        & ( X6
         != ( ^ [X5: $i,X7: $i] : $true ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_6,negated_conjecture,
    ~ ? [X6: $i > $i > $o] :
        ( ( X6 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
        & ~ ! [X14: $i,X15: $i] :
              ( ( X6 @ X14 @ X15 )
            <=> $true ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])]) ).

thf(c_0_7,negated_conjecture,
    ! [X21: $i > $i > $o,X22: $i,X23: $i] :
      ( ( ~ ( X21 @ X22 @ X23 )
        | $true
        | ~ ( X21 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
      & ( ~ $true
        | ( X21 @ X22 @ X23 )
        | ~ ( X21 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).

thf(c_0_8,plain,
    ! [X16: $i > $i > $o,X17: $i > $i > $o,X18: $i,X19: $i] :
      ( ( ~ ( X17 @ X18 @ X19 )
        | ( X16 @ X19 @ X18 )
        | ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X17 @ X16 ) )
      & ( ~ ( X16 @ X19 @ X18 )
        | ( X17 @ X18 @ X19 )
        | ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X17 @ X16 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_001])])])])]) ).

thf(c_0_9,plain,
    ? [X5: $i] :
      ~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X5 ),
    inference(fof_simplification,[status(thm)],[ax_002]) ).

thf(c_0_10,negated_conjecture,
    ! [X4: $i,X3: $i,X1: $i > $i > $o] :
      ( ( X1 @ X3 @ X4 )
      | ~ $true
      | ~ ( X1 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X4: $i,X3: $i,X2: $i > $i > $o,X1: $i > $i > $o] :
      ( ( X2 @ X4 @ X3 )
      | ~ ( X1 @ X3 @ X4 )
      | ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X2 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_12,plain,
    inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
    inference(split_conjunct,[status(thm)],[ax]) ).

thf(c_0_13,plain,
    ~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ esk1_0 ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])]) ).

thf(c_0_14,negated_conjecture,
    ! [X4: $i,X3: $i,X1: $i > $i > $o] :
      ( ( X1 @ X3 @ X4 )
      | ~ ( X1 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ),
    inference(cn,[status(thm)],[c_0_10]) ).

thf(c_0_15,plain,
    ! [X4: $i,X3: $i] :
      ( ( husband_THFTYPE_IiioI @ X3 @ X4 )
      | ~ ( wife_THFTYPE_IiioI @ X4 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

thf(c_0_16,plain,
    wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[ax_003]) ).

thf(c_0_17,plain,
    ~ ( husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_18,negated_conjecture,
    ! [X3: $i,X4: $i] : ( husband_THFTYPE_IiioI @ X3 @ X4 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

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

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