↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.09s 0.26s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   18 (   7 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   61 (  14   ~;   5   |;   6   &;  36   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   22 (  22   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   6 con; 0-2 aty)
%            Number of variables   :   20 (   2   ^;   9   !;   9   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    lAnna_THFTYPE_i: $i ).

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

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

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

thf(decl_30,type,
    parent_THFTYPE_IiioI: $i > $i > $o ).

thf(con,conjecture,
    ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
      ( ( X2 @ X3 @ lBill_THFTYPE_i )
      & ( X1 @ X3 @ lAnna_THFTYPE_i )
      & ( X2 != X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.26R4xg17bH/E---3.1_1608586.p',con) ).

thf(ax_007,axiom,
    parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.26R4xg17bH/E---3.1_1608586.p',ax_007) ).

thf(ax_009,axiom,
    ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.26R4xg17bH/E---3.1_1608586.p',ax_009) ).

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

thf(c_0_4,negated_conjecture,
    ~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
        ( ( X2 @ X3 @ lBill_THFTYPE_i )
        & ( X1 @ X3 @ lAnna_THFTYPE_i )
        & ( X2 != X1 ) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ! [X7: $i > $i > $o,X8: $i > $i > $o,X9: $i] :
      ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
      | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
      | ( X8 = X7 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

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

thf(c_0_7,plain,
    parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[ax_007]) ).

thf(c_0_8,plain,
    ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
    inference(fof_simplification,[status(thm)],[ax_009]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: $i > $i > $o] :
      ( ( X1 = parent_THFTYPE_IiioI )
      | ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_10,plain,
    ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

thf(c_0_11,negated_conjecture,
    ( ( ^ [Z0: $i,Z1: $i] : $true )
    = parent_THFTYPE_IiioI ),
    inference(er,[status(thm)],[c_0_9]) ).

thf(c_0_12,plain,
    ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_13,negated_conjecture,
    ! [X3: $i,X6: $i] : ( parent_THFTYPE_IiioI @ X3 @ X6 ),
    inference(arg_cong,[status(thm)],[c_0_11]) ).

thf(c_0_14,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR139^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.09/0.17  % Computer : n001.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Tue Sep 29 18:02:06 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.09/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.26R4xg17bH/E---3.1_1608586.p
% 0.09/0.26  % Version: 3.5.1-ho
% 0.09/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.09/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.09/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.09/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.09/0.26  % Starting post_as_ho2 with 300s (1) cores
% 0.09/0.26  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.09/0.26  % Starting full_lambda_10 with 300s (1) cores
% 0.09/0.26  % Starting new_ho_8 with 300s (1) cores
% 0.09/0.26  % post_as_ho4 with pid 1608616 completed with status 0
% 0.09/0.26  % Result found by post_as_ho4
% 0.09/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.09/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.09/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.09/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.09/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26  % No SInE strategy applied
% 0.09/0.26  % Search class: HHUSF-FFSM00-SSSFFFBN
% 0.09/0.26  % partial match(1): HHUNF-FFSM00-SSSFFFBN
% 0.09/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26  % SubtermCWHack with pid 1608622 completed with status 10
% 0.09/0.26  % Starting post_as_ho4 with 31s (1) cores
% 0.09/0.26  % post_as_ho4 with pid 1608633 completed with status 0
% 0.09/0.26  % Result found by post_as_ho4
% 0.09/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.09/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.09/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.09/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.09/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26  % No SInE strategy applied
% 0.09/0.26  % Search class: HHUSF-FFSM00-SSSFFFBN
% 0.09/0.26  % partial match(1): HHUNF-FFSM00-SSSFFFBN
% 0.09/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26  % SubtermCWHack with pid 1608622 completed with status 10
% 0.09/0.26  % Starting post_as_ho4 with 31s (1) cores
% 0.09/0.26  % Preprocessing time       : 0.001 s
% 0.09/0.26  % Presaturation interreduction done
% 0.09/0.26  
% 0.09/0.26  % Proof found!
% 0.09/0.26  % SZS status Theorem
% 0.09/0.26  % SZS output start CNFRefutation
% See solution above
% 0.09/0.26  % Parsed axioms                        : 20
% 0.09/0.26  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.26  % Initial clauses                      : 20
% 0.09/0.26  % Removed in clause preprocessing      : 9
% 0.09/0.26  % Initial clauses in saturation        : 11
% 0.09/0.26  % Processed clauses                    : 32
% 0.09/0.26  % ...of these trivial                  : 0
% 0.09/0.26  % ...subsumed                          : 2
% 0.09/0.26  % ...remaining for further processing  : 30
% 0.09/0.26  % Other redundant clauses eliminated   : 0
% 0.09/0.26  % Clauses deleted for lack of memory   : 0
% 0.09/0.26  % Backward-subsumed                    : 0
% 0.09/0.26  % Backward-rewritten                   : 6
% 0.09/0.26  % Generated clauses                    : 100
% 0.09/0.26  % ...of the previous two non-redundant : 92
% 0.09/0.26  % ...aggressively subsumed             : 0
% 0.09/0.26  % Contextual simplify-reflections      : 0
% 0.09/0.26  % Paramodulations                      : 70
% 0.09/0.26  % Factorizations                       : 0
% 0.09/0.26  % NegExts                              : 0
% 0.09/0.26  % Equation resolutions                 : 3
% 0.09/0.26  % Disequality decompositions           : 0
% 0.09/0.26  % Total rewrite steps                  : 3
% 0.09/0.26  % ...of those cached                   : 0
% 0.09/0.26  % Propositional unsat checks           : 0
% 0.09/0.26  %    Propositional check models        : 0
% 0.09/0.26  %    Propositional check unsatisfiable : 0
% 0.09/0.26  %    Propositional clauses             : 0
% 0.09/0.26  %    Propositional clauses after purity: 0
% 0.09/0.26  %    Propositional unsat core size     : 0
% 0.09/0.26  %    Propositional preprocessing time  : 0.000
% 0.09/0.26  %    Propositional encoding time       : 0.000
% 0.09/0.26  %    Propositional solver time         : 0.000
% 0.09/0.26  %    Success case prop preproc time    : 0.000
% 0.09/0.26  %    Success case prop encoding time   : 0.000
% 0.09/0.26  %    Success case prop solver time     : 0.000
% 0.09/0.26  % Current number of processed clauses  : 13
% 0.09/0.26  %    Positive orientable unit clauses  : 8
% 0.09/0.26  %    Positive unorientable unit clauses: 1
% 0.09/0.26  %    Negative unit clauses             : 1
% 0.09/0.26  %    Non-unit-clauses                  : 3
% 0.09/0.26  % Current number of unprocessed clauses: 82
% 0.09/0.26  % ...number of literals in the above   : 153
% 0.09/0.26  % Current number of archived formulas  : 0
% 0.09/0.26  % Current number of archived clauses   : 17
% 0.09/0.26  % Clause-clause subsumption calls (NU) : 2
% 0.09/0.26  % Rec. Clause-clause subsumption calls : 1
% 0.09/0.26  % Non-unit clause-clause subsumptions  : 0
% 0.09/0.26  % Unit Clause-clause subsumption calls : 2
% 0.09/0.26  % Rewrite failures with RHS unbound    : 0
% 0.09/0.26  % BW rewrite match attempts            : 12
% 0.09/0.26  % BW rewrite match successes           : 7
% 0.09/0.26  % Condensation attempts                : 32
% 0.09/0.26  % Condensation successes               : 0
% 0.09/0.26  % Termbank termtop insertions          : 2852
% 0.09/0.26  % Search garbage collected termcells   : 54
% 0.09/0.26  
% 0.09/0.26  % -------------------------------------------------
% 0.09/0.26  % User time                : 0.008 s
% 0.09/0.26  % System time              : 0.002 s
% 0.09/0.26  % Total time               : 0.010 s
% 0.09/0.26  % Maximum resident set size: 3636 pages
% 0.09/0.26  
% 0.09/0.26  % -------------------------------------------------
% 0.09/0.26  % User time                : 0.010 s
% 0.09/0.26  % System time              : 0.007 s
% 0.09/0.26  % Total time               : 0.016 s
% 0.09/0.26  % Maximum resident set size: 4864 pages
% 0.09/0.26  % E exiting
%------------------------------------------------------------------------------