↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.23s 0.32s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   20 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   67 (  11   ~;   7   |;   1   &;  46   @)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (   0   ^;  17   !;   2   ?;  19   :)

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

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

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

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

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

thf(con,conjecture,
    ? [X7: $i] : ( husband_THFTYPE_IiioI @ X7 @ lCorina_THFTYPE_i ),
    file('/export/starexec/sandbox/tmp/tmp.AoVNzccJ85/E---3.1_679203.p',con) ).

thf(ax_006,axiom,
    ! [X11: $i > $i > $o,X12: $i > $i > $o] :
      ( ( inverse_THFTYPE_IIiioIIiioIoI @ X12 @ X11 )
     => ! [X13: $i,X14: $i] :
          ( ( X12 @ X13 @ X14 )
        <=> ( X11 @ X14 @ X13 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.AoVNzccJ85/E---3.1_679203.p',ax_006) ).

thf(ax_042,axiom,
    inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
    file('/export/starexec/sandbox/tmp/tmp.AoVNzccJ85/E---3.1_679203.p',ax_042) ).

thf(ax_051,axiom,
    wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
    file('/export/starexec/sandbox/tmp/tmp.AoVNzccJ85/E---3.1_679203.p',ax_051) ).

thf(c_0_4,negated_conjecture,
    ~ ? [X7: $i] : ( husband_THFTYPE_IiioI @ X7 @ lCorina_THFTYPE_i ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_5,plain,
    ! [X199: $i > $i > $o,X200: $i > $i > $o,X201: $i,X202: $i] :
      ( ( ~ ( X200 @ X201 @ X202 )
        | ( X199 @ X202 @ X201 )
        | ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X200 @ X199 ) )
      & ( ~ ( X199 @ X202 @ X201 )
        | ( X200 @ X201 @ X202 )
        | ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X200 @ X199 ) ) ),
    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_006])])])])]) ).

thf(c_0_6,negated_conjecture,
    ! [X326: $i] :
      ~ ( husband_THFTYPE_IiioI @ X326 @ lCorina_THFTYPE_i ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

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

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

thf(c_0_9,negated_conjecture,
    ! [X2: $i] :
      ~ ( husband_THFTYPE_IiioI @ X2 @ lCorina_THFTYPE_i ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ! [X3: $i,X2: $i] :
      ( ( husband_THFTYPE_IiioI @ X2 @ X3 )
      | ~ ( wife_THFTYPE_IiioI @ X3 @ X2 ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

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

thf(c_0_12,negated_conjecture,
    ! [X2: $i] :
      ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ X2 ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_13,plain,
    $false,
    inference(sr,[status(thm)],[c_0_11,c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR142^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n017.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 17:52:07 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.07/0.27  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.AoVNzccJ85/E---3.1_679203.p
% 0.23/0.32  % Version: 3.5.1-ho
% 0.23/0.32  % Preprocessing class: HSLMSMSMSSSNHFA.
% 0.23/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.32  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.23/0.32  % Starting new_ho_10 with 300s (1) cores
% 0.23/0.32  % Starting new_bool_6 with 300s (1) cores
% 0.23/0.32  % Starting lpo8_s with 300s (1) cores
% 0.23/0.32  % new_ho_10 with pid 679240 completed with status 0
% 0.23/0.32  % Result found by new_ho_10
% 0.23/0.32  % Preprocessing class: HSLMSMSMSSSNHFA.
% 0.23/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.32  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.23/0.32  % Starting new_ho_10 with 300s (1) cores
% 0.23/0.32  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.32  % No SInE strategy applied
% 0.23/0.32  % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.23/0.32  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.32  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.32  % SubtermCWHack with pid 679252 completed with status 0
% 0.23/0.32  % Result found by SubtermCWHack
% 0.23/0.32  % Preprocessing class: HSLMSMSMSSSNHFA.
% 0.23/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.32  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.23/0.32  % Starting new_ho_10 with 300s (1) cores
% 0.23/0.32  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.32  % No SInE strategy applied
% 0.23/0.32  % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.23/0.32  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.32  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.32  % Preprocessing time       : 0.004 s
% 0.23/0.32  
% 0.23/0.32  % Proof found!
% 0.23/0.32  % SZS status Theorem
% 0.23/0.32  % SZS output start CNFRefutation
% See solution above
% 0.23/0.32  % Parsed axioms                        : 334
% 0.23/0.32  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.32  % Initial clauses                      : 355
% 0.23/0.32  % Removed in clause preprocessing      : 109
% 0.23/0.32  % Initial clauses in saturation        : 246
% 0.23/0.32  % Processed clauses                    : 356
% 0.23/0.32  % ...of these trivial                  : 1
% 0.23/0.32  % ...subsumed                          : 12
% 0.23/0.32  % ...remaining for further processing  : 343
% 0.23/0.32  % Other redundant clauses eliminated   : 4
% 0.23/0.32  % Clauses deleted for lack of memory   : 0
% 0.23/0.32  % Backward-subsumed                    : 0
% 0.23/0.32  % Backward-rewritten                   : 1
% 0.23/0.32  % Generated clauses                    : 208
% 0.23/0.32  % ...of the previous two non-redundant : 177
% 0.23/0.32  % ...aggressively subsumed             : 0
% 0.23/0.32  % Contextual simplify-reflections      : 0
% 0.23/0.32  % Paramodulations                      : 202
% 0.23/0.32  % Factorizations                       : 0
% 0.23/0.32  % NegExts                              : 0
% 0.23/0.32  % Equation resolutions                 : 5
% 0.23/0.32  % Disequality decompositions           : 0
% 0.23/0.32  % Total rewrite steps                  : 21
% 0.23/0.32  % ...of those cached                   : 5
% 0.23/0.32  % Propositional unsat checks           : 0
% 0.23/0.32  %    Propositional check models        : 0
% 0.23/0.32  %    Propositional check unsatisfiable : 0
% 0.23/0.32  %    Propositional clauses             : 0
% 0.23/0.32  %    Propositional clauses after purity: 0
% 0.23/0.32  %    Propositional unsat core size     : 0
% 0.23/0.32  %    Propositional preprocessing time  : 0.000
% 0.23/0.32  %    Propositional encoding time       : 0.000
% 0.23/0.32  %    Propositional solver time         : 0.000
% 0.23/0.32  %    Success case prop preproc time    : 0.000
% 0.23/0.32  %    Success case prop encoding time   : 0.000
% 0.23/0.32  %    Success case prop solver time     : 0.000
% 0.23/0.32  % Current number of processed clauses  : 337
% 0.23/0.32  %    Positive orientable unit clauses  : 197
% 0.23/0.32  %    Positive unorientable unit clauses: 0
% 0.23/0.32  %    Negative unit clauses             : 12
% 0.23/0.32  %    Non-unit-clauses                  : 128
% 0.23/0.32  % Current number of unprocessed clauses: 67
% 0.23/0.32  % ...number of literals in the above   : 209
% 0.23/0.32  % Current number of archived formulas  : 0
% 0.23/0.32  % Current number of archived clauses   : 2
% 0.23/0.32  % Clause-clause subsumption calls (NU) : 1119
% 0.23/0.32  % Rec. Clause-clause subsumption calls : 1074
% 0.23/0.32  % Non-unit clause-clause subsumptions  : 11
% 0.23/0.32  % Unit Clause-clause subsumption calls : 280
% 0.23/0.32  % Rewrite failures with RHS unbound    : 0
% 0.23/0.32  % BW rewrite match attempts            : 1
% 0.23/0.32  % BW rewrite match successes           : 1
% 0.23/0.32  % Condensation attempts                : 0
% 0.23/0.32  % Condensation successes               : 0
% 0.23/0.32  % Termbank termtop insertions          : 15725
% 0.23/0.32  % Search garbage collected termcells   : 1894
% 0.23/0.32  
% 0.23/0.32  % -------------------------------------------------
% 0.23/0.32  % User time                : 0.030 s
% 0.23/0.32  % System time              : 0.005 s
% 0.23/0.32  % Total time               : 0.034 s
% 0.23/0.32  % Maximum resident set size: 4408 pages
% 0.23/0.32  
% 0.23/0.32  % -------------------------------------------------
% 0.23/0.32  % User time                : 0.036 s
% 0.23/0.32  % System time              : 0.009 s
% 0.23/0.32  % Total time               : 0.045 s
% 0.23/0.32  % Maximum resident set size: 5120 pages
% 0.23/0.32  % E exiting
%------------------------------------------------------------------------------