↑ Up

E---3.5.1.THM-CRf.s

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

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

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

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

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

thf(ax_020,axiom,
    ( ( lSue_THFTYPE_i != lBill_THFTYPE_i )
    & ( lSue_THFTYPE_i != lBob_THFTYPE_i ) ),
    file('/export/starexec/sandbox2/tmp/tmp.z5keyzXbXS/E---3.1_1615755.p',ax_020) ).

thf(ax_001,axiom,
    lBob_THFTYPE_i != lBill_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.z5keyzXbXS/E---3.1_1615755.p',ax_001) ).

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

thf(c_0_4,plain,
    ( ( lSue_THFTYPE_i != lBill_THFTYPE_i )
    & ( lSue_THFTYPE_i != lBob_THFTYPE_i ) ),
    inference(fof_simplification,[status(thm)],[ax_020]) ).

thf(c_0_5,negated_conjecture,
    ! [X62: $i > $i > $o,X63: $i,X64: $i] :
      ( ~ ( X62 @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( X62 @ lSue_THFTYPE_i @ lBob_THFTYPE_i )
      | ( X62 @ X63 @ X64 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

thf(c_0_6,plain,
    lBob_THFTYPE_i != lBill_THFTYPE_i,
    inference(fof_simplification,[status(thm)],[ax_001]) ).

thf(c_0_7,plain,
    ( ( lSue_THFTYPE_i != lBill_THFTYPE_i )
    & ( lSue_THFTYPE_i != lBob_THFTYPE_i ) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

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

thf(c_0_9,plain,
    lBob_THFTYPE_i != lBill_THFTYPE_i,
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

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

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

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

thf(c_0_13,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR153^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.10/0.17  % Computer : n001.cluster.edu
% 0.10/0.17  % Model    : x86_64 x86_64
% 0.10/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17  % Memory   : 8046.5625MB
% 0.10/0.17  % OS       : Linux 6.8.0-71-generic
% 0.10/0.17  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Tue Sep 29 18:03:51 UTC 2026
% 0.10/0.18  % CPUTime  : 
% 0.10/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22  Running higher-order theorem proving
% 0.10/0.24  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.z5keyzXbXS/E---3.1_1615755.p
% 0.21/0.28  % Version: 3.5.1-ho
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.28  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.28  % Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.28  % Starting new_bool_1 with 300s (1) cores
% 0.21/0.28  % new_bool_1 with pid 1615794 completed with status 0
% 0.21/0.28  % Result found by new_bool_1
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.28  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.28  % Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.28  % Starting new_bool_1 with 300s (1) cores
% 0.21/0.28  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.28  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.28  % Search class: HGHSF-FFSM11-SHSFFSBN
% 0.21/0.28  % partial match(2): HGHSF-FFSF11-SSSFFSBN
% 0.21/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.28  % SubtermCWHack with pid 1615797 completed with status 10
% 0.21/0.28  % Starting new_bool_1 with 31s (1) cores
% 0.21/0.28  % new_bool_1 with pid 1615804 completed with status 0
% 0.21/0.28  % Result found by new_bool_1
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.28  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.28  % Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.28  % Starting new_bool_1 with 300s (1) cores
% 0.21/0.28  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.28  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.28  % Search class: HGHSF-FFSM11-SHSFFSBN
% 0.21/0.28  % partial match(2): HGHSF-FFSF11-SSSFFSBN
% 0.21/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.28  % SubtermCWHack with pid 1615797 completed with status 10
% 0.21/0.28  % Starting new_bool_1 with 31s (1) cores
% 0.21/0.28  % Preprocessing time       : 0.001 s
% 0.21/0.28  % Presaturation interreduction done
% 0.21/0.28  
% 0.21/0.28  % Proof found!
% 0.21/0.28  % SZS status Theorem
% 0.21/0.28  % SZS output start CNFRefutation
% See solution above
% 0.21/0.28  % Parsed axioms                        : 194
% 0.21/0.28  % Removed by relevancy pruning/SinE    : 175
% 0.21/0.28  % Initial clauses                      : 29
% 0.21/0.28  % Removed in clause preprocessing      : 0
% 0.21/0.28  % Initial clauses in saturation        : 29
% 0.21/0.28  % Processed clauses                    : 82
% 0.21/0.28  % ...of these trivial                  : 3
% 0.21/0.28  % ...subsumed                          : 10
% 0.21/0.28  % ...remaining for further processing  : 69
% 0.21/0.28  % Other redundant clauses eliminated   : 1
% 0.21/0.28  % Clauses deleted for lack of memory   : 0
% 0.21/0.28  % Backward-subsumed                    : 0
% 0.21/0.28  % Backward-rewritten                   : 0
% 0.21/0.28  % Generated clauses                    : 101
% 0.21/0.28  % ...of the previous two non-redundant : 85
% 0.21/0.28  % ...aggressively subsumed             : 0
% 0.21/0.28  % Contextual simplify-reflections      : 0
% 0.21/0.28  % Paramodulations                      : 36
% 0.21/0.28  % Factorizations                       : 2
% 0.21/0.28  % NegExts                              : 18
% 0.21/0.28  % Equation resolutions                 : 1
% 0.21/0.28  % Disequality decompositions           : 0
% 0.21/0.28  % Total rewrite steps                  : 9
% 0.21/0.28  % ...of those cached                   : 2
% 0.21/0.28  % Propositional unsat checks           : 0
% 0.21/0.28  %    Propositional check models        : 0
% 0.21/0.28  %    Propositional check unsatisfiable : 0
% 0.21/0.28  %    Propositional clauses             : 0
% 0.21/0.28  %    Propositional clauses after purity: 0
% 0.21/0.28  %    Propositional unsat core size     : 0
% 0.21/0.28  %    Propositional preprocessing time  : 0.000
% 0.21/0.28  %    Propositional encoding time       : 0.000
% 0.21/0.28  %    Propositional solver time         : 0.000
% 0.21/0.28  %    Success case prop preproc time    : 0.000
% 0.21/0.28  %    Success case prop encoding time   : 0.000
% 0.21/0.28  %    Success case prop solver time     : 0.000
% 0.21/0.28  % Current number of processed clauses  : 46
% 0.21/0.28  %    Positive orientable unit clauses  : 13
% 0.21/0.28  %    Positive unorientable unit clauses: 0
% 0.21/0.28  %    Negative unit clauses             : 24
% 0.21/0.28  %    Non-unit-clauses                  : 9
% 0.21/0.28  % Current number of unprocessed clauses: 34
% 0.21/0.28  % ...number of literals in the above   : 75
% 0.21/0.28  % Current number of archived formulas  : 0
% 0.21/0.28  % Current number of archived clauses   : 23
% 0.21/0.28  % Clause-clause subsumption calls (NU) : 30
% 0.21/0.28  % Rec. Clause-clause subsumption calls : 26
% 0.21/0.28  % Non-unit clause-clause subsumptions  : 0
% 0.21/0.28  % Unit Clause-clause subsumption calls : 122
% 0.21/0.28  % Rewrite failures with RHS unbound    : 0
% 0.21/0.28  % BW rewrite match attempts            : 0
% 0.21/0.28  % BW rewrite match successes           : 0
% 0.21/0.28  % Condensation attempts                : 0
% 0.21/0.28  % Condensation successes               : 0
% 0.21/0.28  % Termbank termtop insertions          : 4576
% 0.21/0.28  % Search garbage collected termcells   : 748
% 0.21/0.28  
% 0.21/0.28  % -------------------------------------------------
% 0.21/0.28  % User time                : 0.006 s
% 0.21/0.28  % System time              : 0.007 s
% 0.21/0.28  % Total time               : 0.013 s
% 0.21/0.28  % Maximum resident set size: 3796 pages
% 0.21/0.28  
% 0.21/0.28  % -------------------------------------------------
% 0.21/0.28  % User time                : 0.009 s
% 0.21/0.28  % System time              : 0.012 s
% 0.21/0.28  % Total time               : 0.021 s
% 0.21/0.28  % Maximum resident set size: 4864 pages
% 0.21/0.28  % E exiting
%------------------------------------------------------------------------------