↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP010_2 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n026.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 : Thu Sep 24 12:53:34 PM UTC 2026

% Result   : Theorem 0.11s 0.45s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    6 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   13 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   14 (   7   ~;   0   |;   0   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   12 (   2 sgn  12   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    del: $tType ).

tff(decl_23,type,
    bool: del ).

tff(decl_25,type,
    arr: ( del * del ) > del ).

tff(decl_26,type,
    mem: ( del * $i ) > $o ).

tff(decl_27,type,
    ap: ( $i * $i ) > $i ).

tff(decl_30,type,
    p: $i > $o ).

tff(decl_35,type,
    c_2Ecardinal_2Ecardleq: ( del * del ) > $i ).

tff(conj_thm_2Ecardinal_2ECARD__NOT__LE,conjecture,
    ! [X11: del,X12: del,X18] :
      ( mem(X18,arr(X11,bool))
     => ! [X19] :
          ( mem(X19,arr(X12,bool))
         => ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X11,X12),X18),X19))
          <=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X11,X12),X18),X19)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecardinal_2ECARD__NOT__LE) ).

tff(c_0_1,negated_conjecture,
    ~ ! [X11: del,X12: del,X18] :
        ( mem(X18,arr(X11,bool))
       => ! [X19] :
            ( mem(X19,arr(X12,bool))
           => ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X11,X12),X18),X19))
            <=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(X11,X12),X18),X19)) ) ) ),
    inference(assume_negation,[status(cth)],[conj_thm_2Ecardinal_2ECARD__NOT__LE]) ).

tff(c_0_2,negated_conjecture,
    ~ ! [X11: del,X12: del,X18] :
        ( mem(X18,arr(X11,bool))
       => ! [X19] : $true ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_3,negated_conjecture,
    ~ $true,
    inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])]) ).

cnf(c_0_4,negated_conjecture,
    $false,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[c_0_4]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP010_2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n026.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 20 21:47:36 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.45  % Version: 3.5.1
% 0.11/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45  % Starting sh5l with 300s (1) cores
% 0.11/0.45  % new_bool_3 with pid 623374 completed with status 0
% 0.11/0.45  % Result found by new_bool_3
% 0.11/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45  % Search class: FGHSS-FFMF32-MFFFFFNN
% 0.11/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45  % SubtermCWHack with pid 623381 completed with status 0
% 0.11/0.45  % Result found by SubtermCWHack
% 0.11/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45  % Search class: FGHSS-FFMF32-MFFFFFNN
% 0.11/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45  % Preprocessing time       : 0.002 s
% 0.11/0.45  
% 0.11/0.45  % Proof found!
% 0.11/0.45  % SZS status Theorem
% 0.11/0.45  % SZS output start CNFRefutation
% See solution above
% 0.11/0.45  % Parsed axioms                        : 74
% 0.11/0.45  % Removed by relevancy pruning/SinE    : 54
% 0.11/0.45  % Initial clauses                      : 129
% 0.11/0.45  % Removed in clause preprocessing      : 94
% 0.11/0.45  % Initial clauses in saturation        : 35
% 0.11/0.45  % Processed clauses                    : 1
% 0.11/0.45  % ...of these trivial                  : 0
% 0.11/0.45  % ...subsumed                          : 0
% 0.11/0.45  % ...remaining for further processing  : 0
% 0.11/0.45  % Other redundant clauses eliminated   : 0
% 0.11/0.45  % Clauses deleted for lack of memory   : 0
% 0.11/0.45  % Backward-subsumed                    : 0
% 0.11/0.45  % Backward-rewritten                   : 0
% 0.11/0.45  % Generated clauses                    : 0
% 0.11/0.45  % ...of the previous two non-redundant : 0
% 0.11/0.45  % ...aggressively subsumed             : 0
% 0.11/0.45  % Contextual simplify-reflections      : 0
% 0.11/0.45  % Paramodulations                      : 0
% 0.11/0.45  % Factorizations                       : 0
% 0.11/0.45  % NegExts                              : 0
% 0.11/0.45  % Equation resolutions                 : 0
% 0.11/0.45  % Disequality decompositions           : 0
% 0.11/0.45  % Total rewrite steps                  : 0
% 0.11/0.45  % ...of those cached                   : 0
% 0.11/0.45  % Propositional unsat checks           : 0
% 0.11/0.45  %    Propositional check models        : 0
% 0.11/0.45  %    Propositional check unsatisfiable : 0
% 0.11/0.45  %    Propositional clauses             : 0
% 0.11/0.45  %    Propositional clauses after purity: 0
% 0.11/0.45  %    Propositional unsat core size     : 0
% 0.11/0.45  %    Propositional preprocessing time  : 0.000
% 0.11/0.45  %    Propositional encoding time       : 0.000
% 0.11/0.45  %    Propositional solver time         : 0.000
% 0.11/0.45  %    Success case prop preproc time    : 0.000
% 0.11/0.45  %    Success case prop encoding time   : 0.000
% 0.11/0.45  %    Success case prop solver time     : 0.000
% 0.11/0.45  % Current number of processed clauses  : 0
% 0.11/0.45  %    Positive orientable unit clauses  : 0
% 0.11/0.45  %    Positive unorientable unit clauses: 0
% 0.11/0.45  %    Negative unit clauses             : 0
% 0.11/0.45  %    Non-unit-clauses                  : 0
% 0.11/0.45  % Current number of unprocessed clauses: 34
% 0.11/0.45  % ...number of literals in the above   : 123
% 0.11/0.45  % Current number of archived formulas  : 0
% 0.11/0.45  % Current number of archived clauses   : 0
% 0.11/0.45  % Clause-clause subsumption calls (NU) : 0
% 0.11/0.45  % Rec. Clause-clause subsumption calls : 0
% 0.11/0.45  % Non-unit clause-clause subsumptions  : 0
% 0.11/0.45  % Unit Clause-clause subsumption calls : 0
% 0.11/0.45  % Rewrite failures with RHS unbound    : 0
% 0.11/0.45  % BW rewrite match attempts            : 0
% 0.11/0.45  % BW rewrite match successes           : 0
% 0.11/0.45  % Condensation attempts                : 0
% 0.11/0.45  % Condensation successes               : 0
% 0.11/0.45  % Termbank termtop insertions          : 6948
% 0.11/0.45  % Search garbage collected termcells   : 1413
% 0.11/0.45  
% 0.11/0.45  % -------------------------------------------------
% 0.11/0.45  % User time                : 0.008 s
% 0.11/0.45  % System time              : 0.003 s
% 0.11/0.45  % Total time               : 0.011 s
% 0.11/0.45  % Maximum resident set size: 3964 pages
% 0.11/0.45  
% 0.11/0.45  % -------------------------------------------------
% 0.11/0.45  % User time                : 0.009 s
% 0.11/0.45  % System time              : 0.006 s
% 0.11/0.45  % Total time               : 0.015 s
% 0.11/0.45  % Maximum resident set size: 4608 pages
% 0.11/0.45  % E exiting
%------------------------------------------------------------------------------