↑ Up

E---3.5.1.THM-CRf.s

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_24,type,
    lBill_THFTYPE_i: $i ).

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

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

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

thf(con,conjecture,
    ? [X1: $i > $i > $o] :
      ( ( X1 @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      & ( X1 @ lSue_THFTYPE_i @ lBob_THFTYPE_i )
      & ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.eTUz5jBjwY/E---3.1_3215258.p',con) ).

thf(ax_001,axiom,
    ( ( lMary_THFTYPE_i != lSue_THFTYPE_i )
    & ( lMary_THFTYPE_i != lBill_THFTYPE_i )
    & ( lBob_THFTYPE_i != lMary_THFTYPE_i ) ),
    file('/export/starexec/sandbox2/tmp/tmp.eTUz5jBjwY/E---3.1_3215258.p',ax_001) ).

thf(c_0_2,negated_conjecture,
    ~ ? [X1: $i > $i > $o] :
        ( ( X1 @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
        & ( X1 @ lSue_THFTYPE_i @ lBob_THFTYPE_i )
        & ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_3,plain,
    ( ( lMary_THFTYPE_i != lSue_THFTYPE_i )
    & ( lMary_THFTYPE_i != lBill_THFTYPE_i )
    & ( lBob_THFTYPE_i != lMary_THFTYPE_i ) ),
    inference(fof_simplification,[status(thm)],[ax_001]) ).

thf(c_0_4,negated_conjecture,
    ! [X7: $i > $i > $o,X8: $i,X9: $i] :
      ( ~ ( X7 @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( X7 @ lSue_THFTYPE_i @ lBob_THFTYPE_i )
      | ( X7 @ X8 @ X9 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

thf(c_0_5,plain,
    ( ( lMary_THFTYPE_i != lSue_THFTYPE_i )
    & ( lMary_THFTYPE_i != lBill_THFTYPE_i )
    & ( lBob_THFTYPE_i != lMary_THFTYPE_i ) ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ! [X3: $i,X2: $i,X1: $i > $i > $o] :
      ( ( X1 @ X2 @ X3 )
      | ~ ( X1 @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( X1 @ lSue_THFTYPE_i @ lBob_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    lMary_THFTYPE_i != lSue_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ! [X2: $i] :
      ( ( lSue_THFTYPE_i = X2 )
      | ( lBob_THFTYPE_i = X2 ) ),
    inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).

thf(c_0_9,plain,
    lBob_THFTYPE_i != lMary_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_10,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR153^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.16  % Computer : n010.cluster.edu
% 0.11/0.16  % Model    : x86_64 x86_64
% 0.11/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16  % Memory   : 8046.5625MB
% 0.11/0.16  % OS       : Linux 6.8.0-71-generic
% 0.11/0.16  % CPULimit : 300
% 0.11/0.16  % WCLimit  : 300
% 0.11/0.16  % DateTime : Tue Sep 29 17:58:18 UTC 2026
% 0.11/0.17  % CPUTime  : 
% 0.11/0.17  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.20  Running higher-order theorem proving
% 0.11/0.21  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.eTUz5jBjwY/E---3.1_3215258.p
% 0.11/0.24  % Version: 3.5.1-ho
% 0.11/0.24  % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.24  % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.24  % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.24  % Starting new_ho_3 with 300s (1) cores
% 0.11/0.24  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.24  % ehoh_best2_full_lfho with pid 3215275 completed with status 0
% 0.11/0.24  % Result found by ehoh_best2_full_lfho
% 0.11/0.24  % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.24  % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.24  % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.24  % Starting new_ho_3 with 300s (1) cores
% 0.11/0.24  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.24  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.24  % No SInE strategy applied
% 0.11/0.24  % Search class: HHUSF-FFSS00-SSSFFFBN
% 0.11/0.24  % partial match(2): HHUSF-FFSF00-SSSFFFNN
% 0.11/0.24  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.24  % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.24  % SubtermCWHack with pid 3215280 completed with status 10
% 0.11/0.24  % Starting ehoh_best2_full_lfho with 31s (1) cores
% 0.11/0.24  % ehoh_best2_full_lfho with pid 3215284 completed with status 0
% 0.11/0.24  % Result found by ehoh_best2_full_lfho
% 0.11/0.24  % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.24  % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.24  % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.24  % Starting new_ho_3 with 300s (1) cores
% 0.11/0.24  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.24  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.24  % No SInE strategy applied
% 0.11/0.24  % Search class: HHUSF-FFSS00-SSSFFFBN
% 0.11/0.24  % partial match(2): HHUSF-FFSF00-SSSFFFNN
% 0.11/0.24  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.24  % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.24  % SubtermCWHack with pid 3215280 completed with status 10
% 0.11/0.24  % Starting ehoh_best2_full_lfho with 31s (1) cores
% 0.11/0.24  % Preprocessing time       : 0.001 s
% 0.11/0.24  
% 0.11/0.24  % Proof found!
% 0.11/0.24  % SZS status Theorem
% 0.11/0.24  % SZS output start CNFRefutation
% See solution above
% 0.11/0.24  % Parsed axioms                        : 13
% 0.11/0.24  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.24  % Initial clauses                      : 20
% 0.11/0.24  % Removed in clause preprocessing      : 7
% 0.11/0.24  % Initial clauses in saturation        : 13
% 0.11/0.24  % Processed clauses                    : 18
% 0.11/0.24  % ...of these trivial                  : 0
% 0.11/0.24  % ...subsumed                          : 4
% 0.11/0.24  % ...remaining for further processing  : 14
% 0.11/0.24  % Other redundant clauses eliminated   : 0
% 0.11/0.24  % Clauses deleted for lack of memory   : 0
% 0.11/0.24  % Backward-subsumed                    : 0
% 0.11/0.24  % Backward-rewritten                   : 0
% 0.11/0.24  % Generated clauses                    : 33
% 0.11/0.24  % ...of the previous two non-redundant : 17
% 0.11/0.24  % ...aggressively subsumed             : 0
% 0.11/0.24  % Contextual simplify-reflections      : 0
% 0.11/0.24  % Paramodulations                      : 19
% 0.11/0.24  % Factorizations                       : 2
% 0.11/0.24  % NegExts                              : 0
% 0.11/0.24  % Equation resolutions                 : 0
% 0.11/0.24  % Disequality decompositions           : 0
% 0.11/0.24  % Total rewrite steps                  : 2
% 0.11/0.24  % ...of those cached                   : 0
% 0.11/0.24  % Propositional unsat checks           : 0
% 0.11/0.24  %    Propositional check models        : 0
% 0.11/0.24  %    Propositional check unsatisfiable : 0
% 0.11/0.24  %    Propositional clauses             : 0
% 0.11/0.24  %    Propositional clauses after purity: 0
% 0.11/0.24  %    Propositional unsat core size     : 0
% 0.11/0.24  %    Propositional preprocessing time  : 0.000
% 0.11/0.24  %    Propositional encoding time       : 0.000
% 0.11/0.24  %    Propositional solver time         : 0.000
% 0.11/0.24  %    Success case prop preproc time    : 0.000
% 0.11/0.24  %    Success case prop encoding time   : 0.000
% 0.11/0.24  %    Success case prop solver time     : 0.000
% 0.11/0.24  % Current number of processed clauses  : 14
% 0.11/0.24  %    Positive orientable unit clauses  : 3
% 0.11/0.24  %    Positive unorientable unit clauses: 0
% 0.11/0.24  %    Negative unit clauses             : 9
% 0.11/0.24  %    Non-unit-clauses                  : 2
% 0.11/0.24  % Current number of unprocessed clauses: 6
% 0.11/0.24  % ...number of literals in the above   : 16
% 0.11/0.24  % Current number of archived formulas  : 0
% 0.11/0.24  % Current number of archived clauses   : 0
% 0.11/0.24  % Clause-clause subsumption calls (NU) : 0
% 0.11/0.24  % Rec. Clause-clause subsumption calls : 0
% 0.11/0.24  % Non-unit clause-clause subsumptions  : 0
% 0.11/0.24  % Unit Clause-clause subsumption calls : 0
% 0.11/0.24  % Rewrite failures with RHS unbound    : 0
% 0.11/0.24  % BW rewrite match attempts            : 0
% 0.11/0.24  % BW rewrite match successes           : 0
% 0.11/0.24  % Condensation attempts                : 0
% 0.11/0.24  % Condensation successes               : 0
% 0.11/0.24  % Termbank termtop insertions          : 877
% 0.11/0.24  % Search garbage collected termcells   : 47
% 0.11/0.24  
% 0.11/0.24  % -------------------------------------------------
% 0.11/0.24  % User time                : 0.007 s
% 0.11/0.24  % System time              : 0.001 s
% 0.11/0.24  % Total time               : 0.008 s
% 0.11/0.24  % Maximum resident set size: 3584 pages
% 0.11/0.24  
% 0.11/0.24  % -------------------------------------------------
% 0.11/0.24  % User time                : 0.008 s
% 0.11/0.24  % System time              : 0.006 s
% 0.11/0.24  % Total time               : 0.014 s
% 0.11/0.24  % Maximum resident set size: 4864 pages
% 0.11/0.24  % E exiting
%------------------------------------------------------------------------------