↑ Up

E-SAT---3.5.1.CAX-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SCT166+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n015.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 02:08:36 PM UTC 2026

% Result   : ContradictoryAxioms 0.16s 0.75s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (  16 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   41 (  20   ~;  14   |;   2   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-4 aty)
%            Number of variables   :   58 (   5 sgn  35   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_Suc__n__not__le__n,axiom,
    ! [X46] : ~ hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,hAPP(c_Nat_OSuc,X46)),X46)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_Suc__n__not__le__n) ).

fof(fact_finite__nat__set__iff__bounded__le,axiom,
    ! [X56] :
      ( c_Finite__Set_Ofinite(tc_Nat_Onat,X56)
    <=> ? [X17] :
        ! [X3] :
          ( hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X3),X56))
         => hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,X3),X17)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_finite__nat__set__iff__bounded__le) ).

fof(fact_rangeI,axiom,
    ! [X14,X8,X2,X10] : hBOOL(hAPP(hAPP(c_member(X10),hAPP(X2,X8)),c_Set_Oimage(X14,X10,X2,c_Orderings_Otop__class_Otop(tc_fun(X14,tc_HOL_Obool))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_rangeI) ).

fof(fact_rev__finite__subset,axiom,
    ! [X12,X11,X10] :
      ( c_Finite__Set_Ofinite(X10,X11)
     => ( hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X10,tc_HOL_Obool),X12),X11))
       => c_Finite__Set_Ofinite(X10,X12) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_rev__finite__subset) ).

fof(fact_subset__UNIV,axiom,
    ! [X12,X10] : hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X10,tc_HOL_Obool),X12),c_Orderings_Otop__class_Otop(tc_fun(X10,tc_HOL_Obool)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_subset__UNIV) ).

fof(fact_finite__imageI,axiom,
    ! [X65,X14,X40,X10] :
      ( c_Finite__Set_Ofinite(X10,X40)
     => c_Finite__Set_Ofinite(X14,c_Set_Oimage(X10,X14,X65,X40)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_finite__imageI) ).

fof(fact_finite__indi,axiom,
    c_Finite__Set_Ofinite(tc_Arrow__Order__Mirabelle_Oindi,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_HOL_Obool))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_finite__indi) ).

fof(c_0_7,plain,
    ! [X46] : ~ hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,hAPP(c_Nat_OSuc,X46)),X46)),
    inference(fof_simplification,[status(thm)],[fact_Suc__n__not__le__n]) ).

fof(c_0_8,plain,
    ! [X977] : ~ hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,hAPP(c_Nat_OSuc,X977)),X977)),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).

fof(c_0_9,plain,
    ! [X601,X603,X604,X605] :
      ( ( c_Finite__Set_Ofinite(tc_Nat_Onat,X604)
        | ~ hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,esk20_2(X604,X605)),X605)) )
      & ( c_Finite__Set_Ofinite(tc_Nat_Onat,X604)
        | hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),esk20_2(X604,X605)),X604)) )
      & ( hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,X603),esk19_1(X601)))
        | ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X603),X601))
        | ~ c_Finite__Set_Ofinite(tc_Nat_Onat,X601) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_finite__nat__set__iff__bounded__le])])])])])])]) ).

cnf(c_0_10,plain,
    ~ hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,hAPP(c_Nat_OSuc,X1)),X1)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    ( ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X2),X1))
    | ~ c_Finite__Set_Ofinite(tc_Nat_Onat,X1)
    | hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,X2),esk19_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_12,plain,
    ! [X561,X562,X563,X564] : hBOOL(hAPP(hAPP(c_member(X564),hAPP(X563,X562)),c_Set_Oimage(X561,X564,X563,c_Orderings_Otop__class_Otop(tc_fun(X561,tc_HOL_Obool))))),
    inference(variable_rename,[status(thm)],[fact_rangeI]) ).

fof(c_0_13,plain,
    ! [X570,X571,X572] :
      ( c_Finite__Set_Ofinite(X572,X570)
      | ~ hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X572,tc_HOL_Obool),X570),X571))
      | ~ c_Finite__Set_Ofinite(X572,X571) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_rev__finite__subset])])]) ).

fof(c_0_14,plain,
    ! [X518,X519] : hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X519,tc_HOL_Obool),X518),c_Orderings_Otop__class_Otop(tc_fun(X519,tc_HOL_Obool)))),
    inference(variable_rename,[status(thm)],[fact_subset__UNIV]) ).

cnf(c_0_15,plain,
    ( ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),hAPP(c_Nat_OSuc,esk19_1(X1))),X1))
    | ~ c_Finite__Set_Ofinite(tc_Nat_Onat,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    hBOOL(hAPP(hAPP(c_member(X1),hAPP(X2,X3)),c_Set_Oimage(X4,X1,X2,c_Orderings_Otop__class_Otop(tc_fun(X4,tc_HOL_Obool))))),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_17,plain,
    ! [X576,X577,X578,X579] :
      ( c_Finite__Set_Ofinite(X577,c_Set_Oimage(X579,X577,X576,X578))
      | ~ c_Finite__Set_Ofinite(X579,X578) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_finite__imageI])])]) ).

cnf(c_0_18,plain,
    ( ~ hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool),X3),X2))
    | ~ c_Finite__Set_Ofinite(X1,X2)
    | c_Finite__Set_Ofinite(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    hBOOL(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool),X2),c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool)))),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    ~ c_Finite__Set_Ofinite(tc_Nat_Onat,c_Set_Oimage(X1,tc_Nat_Onat,c_Nat_OSuc,c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool)))),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( ~ c_Finite__Set_Ofinite(X1,X2)
    | c_Finite__Set_Ofinite(X3,c_Set_Oimage(X1,X3,X4,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_22,plain,
    ( ~ c_Finite__Set_Ofinite(X1,c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool)))
    | c_Finite__Set_Ofinite(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    c_Finite__Set_Ofinite(tc_Arrow__Order__Mirabelle_Oindi,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_HOL_Obool))),
    inference(split_conjunct,[status(thm)],[fact_finite__indi]) ).

cnf(c_0_24,plain,
    ~ c_Finite__Set_Ofinite(X1,c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool))),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    c_Finite__Set_Ofinite(tc_Arrow__Order__Mirabelle_Oindi,X1),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,plain,
    $false,
    inference(spm,[status(thm)],[c_0_24,c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SCT166+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.56  % Computer : n015.cluster.edu
% 0.10/0.56  % Model    : x86_64 x86_64
% 0.10/0.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56  % Memory   : 8046.5625MB
% 0.10/0.56  % OS       : Linux 6.8.0-71-generic
% 0.10/0.56  % CPULimit : 300
% 0.10/0.56  % WCLimit  : 300
% 0.10/0.56  % DateTime : Mon Sep 21 04:38:23 UTC 2026
% 0.10/0.56  % CPUTime  : 
% 0.10/0.56  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.61  Running first-order theorem proving
% 0.10/0.61  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/0.75  % Version: 3.5.1
% 0.16/0.75  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.75  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.75  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.75  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.75  % Starting sh5l with 300s (1) cores
% 0.16/0.75  % new_bool_3 with pid 568012 completed with status 0
% 0.16/0.75  % Result found by new_bool_3
% 0.16/0.75  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.75  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.75  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.75  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.75  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.75  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.16/0.75  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.75  % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.75  % SubtermCWHack with pid 568016 completed with status 0
% 0.16/0.75  % Result found by SubtermCWHack
% 0.16/0.75  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.75  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.75  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.75  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.75  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.75  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.16/0.75  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.75  % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.75  % Preprocessing time       : 0.011 s
% 0.16/0.75  
% 0.16/0.75  % Proof found!
% 0.16/0.75  % SZS status ContradictoryAxioms
% 0.16/0.75  % SZS output start CNFRefutation
% See solution above
% 0.16/0.75  % Parsed axioms                        : 533
% 0.16/0.75  % Removed by relevancy pruning/SinE    : 226
% 0.16/0.75  % Initial clauses                      : 559
% 0.16/0.75  % Removed in clause preprocessing      : 68
% 0.16/0.75  % Initial clauses in saturation        : 491
% 0.16/0.75  % Processed clauses                    : 1055
% 0.16/0.75  % ...of these trivial                  : 42
% 0.16/0.75  % ...subsumed                          : 607
% 0.16/0.75  % ...remaining for further processing  : 406
% 0.16/0.75  % Other redundant clauses eliminated   : 83
% 0.16/0.75  % Clauses deleted for lack of memory   : 0
% 0.16/0.75  % Backward-subsumed                    : 15
% 0.16/0.75  % Backward-rewritten                   : 9
% 0.16/0.75  % Generated clauses                    : 3046
% 0.16/0.75  % ...of the previous two non-redundant : 2443
% 0.16/0.75  % ...aggressively subsumed             : 0
% 0.16/0.75  % Contextual simplify-reflections      : 1
% 0.16/0.75  % Paramodulations                      : 2957
% 0.16/0.75  % Factorizations                       : 4
% 0.16/0.75  % NegExts                              : 0
% 0.16/0.75  % Equation resolutions                 : 90
% 0.16/0.75  % Disequality decompositions           : 0
% 0.16/0.75  % Total rewrite steps                  : 949
% 0.16/0.75  % ...of those cached                   : 707
% 0.16/0.75  % Propositional unsat checks           : 0
% 0.16/0.75  %    Propositional check models        : 0
% 0.16/0.75  %    Propositional check unsatisfiable : 0
% 0.16/0.75  %    Propositional clauses             : 0
% 0.16/0.75  %    Propositional clauses after purity: 0
% 0.16/0.75  %    Propositional unsat core size     : 0
% 0.16/0.75  %    Propositional preprocessing time  : 0.000
% 0.16/0.75  %    Propositional encoding time       : 0.000
% 0.16/0.75  %    Propositional solver time         : 0.000
% 0.16/0.75  %    Success case prop preproc time    : 0.000
% 0.16/0.75  %    Success case prop encoding time   : 0.000
% 0.16/0.75  %    Success case prop solver time     : 0.000
% 0.16/0.75  % Current number of processed clauses  : 343
% 0.16/0.75  %    Positive orientable unit clauses  : 96
% 0.16/0.75  %    Positive unorientable unit clauses: 3
% 0.16/0.75  %    Negative unit clauses             : 66
% 0.16/0.75  %    Non-unit-clauses                  : 178
% 0.16/0.75  % Current number of unprocessed clauses: 1856
% 0.16/0.75  % ...number of literals in the above   : 4613
% 0.16/0.75  % Current number of archived formulas  : 0
% 0.16/0.75  % Current number of archived clauses   : 24
% 0.16/0.75  % Clause-clause subsumption calls (NU) : 4908
% 0.16/0.75  % Rec. Clause-clause subsumption calls : 3448
% 0.16/0.75  % Non-unit clause-clause subsumptions  : 239
% 0.16/0.75  % Unit Clause-clause subsumption calls : 237
% 0.16/0.75  % Rewrite failures with RHS unbound    : 0
% 0.16/0.75  % BW rewrite match attempts            : 202
% 0.16/0.75  % BW rewrite match successes           : 19
% 0.16/0.75  % Condensation attempts                : 0
% 0.16/0.75  % Condensation successes               : 0
% 0.16/0.75  % Termbank termtop insertions          : 123538
% 0.16/0.75  % Search garbage collected termcells   : 9086
% 0.16/0.75  
% 0.16/0.75  % -------------------------------------------------
% 0.16/0.75  % User time                : 0.103 s
% 0.16/0.75  % System time              : 0.012 s
% 0.16/0.75  % Total time               : 0.115 s
% 0.16/0.75  % Maximum resident set size: 6184 pages
% 0.16/0.75  
% 0.16/0.75  % -------------------------------------------------
% 0.16/0.75  % User time                : 0.115 s
% 0.16/0.75  % System time              : 0.015 s
% 0.16/0.75  % Total time               : 0.130 s
% 0.16/0.75  % Maximum resident set size: 5632 pages
% 0.16/0.75  % E exiting
%------------------------------------------------------------------------------