↑ 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  : ITP276^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n014.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 08:06:10 AM UTC 2026

% Result   : ContradictoryAxioms 10.38s 7.52s
% Output   : CNFRefutation 10.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (   7 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   38 (   4   ~;   0   |;   0   &;  34   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :    4 (   0   ^;   4   !;   0   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    nat: $tType ).

thf(decl_sort2,type,
    num: $tType ).

thf(decl_291,type,
    one_one_nat: nat ).

thf(decl_331,type,
    zero_zero_nat: nat ).

thf(decl_694,type,
    suc: nat > nat ).

thf(decl_782,type,
    bit0: num > num ).

thf(decl_784,type,
    one: num ).

thf(decl_792,type,
    numeral_numeral_nat: num > nat ).

thf(decl_853,type,
    ord_less_eq_nat: nat > nat > $o ).

thf(decl_1296,type,
    deg: nat ).

thf(fact_75__C1_C_I2_J,axiom,
    ( deg
    = ( suc @ zero_zero_nat ) ),
    file('/export/starexec/sandbox2/tmp/tmp.rGQ4gPUVcG/E---3.1_3195132.p',fact_75__C1_C_I2_J) ).

thf(fact_1158_One__nat__def,axiom,
    ( one_one_nat
    = ( suc @ zero_zero_nat ) ),
    file('/export/starexec/sandbox2/tmp/tmp.rGQ4gPUVcG/E---3.1_3195132.p',fact_1158_One__nat__def) ).

thf(fact_103_Suc__n__not__le__n,axiom,
    ! [X173: nat] :
      ~ ( ord_less_eq_nat @ ( suc @ X173 ) @ X173 ),
    file('/export/starexec/sandbox2/tmp/tmp.rGQ4gPUVcG/E---3.1_3195132.p',fact_103_Suc__n__not__le__n) ).

thf(fact_2986_a0,axiom,
    ord_less_eq_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg,
    file('/export/starexec/sandbox2/tmp/tmp.rGQ4gPUVcG/E---3.1_3195132.p',fact_2986_a0) ).

thf(fact_3212_Suc__1,axiom,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.rGQ4gPUVcG/E---3.1_3195132.p',fact_3212_Suc__1) ).

thf(c_0_5,plain,
    ( deg
    = ( suc @ zero_zero_nat ) ),
    inference(split_conjunct,[status(thm)],[fact_75__C1_C_I2_J]) ).

thf(c_0_6,plain,
    ( one_one_nat
    = ( suc @ zero_zero_nat ) ),
    inference(split_conjunct,[status(thm)],[fact_1158_One__nat__def]) ).

thf(c_0_7,plain,
    ! [X173: nat] :
      ~ ( ord_less_eq_nat @ ( suc @ X173 ) @ X173 ),
    inference(fof_simplification,[status(thm)],[fact_103_Suc__n__not__le__n]) ).

thf(c_0_8,plain,
    ord_less_eq_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg,
    inference(split_conjunct,[status(thm)],[fact_2986_a0]) ).

thf(c_0_9,plain,
    deg = one_one_nat,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_10,plain,
    ! [X25627: nat] :
      ~ ( ord_less_eq_nat @ ( suc @ X25627 ) @ X25627 ),
    inference(variable_rename,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ord_less_eq_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ one_one_nat,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_12,plain,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    inference(split_conjunct,[status(thm)],[fact_3212_Suc__1]) ).

thf(c_0_13,plain,
    ! [X3: nat] :
      ~ ( ord_less_eq_nat @ ( suc @ X3 ) @ X3 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP276^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17  % Computer : n014.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 20:52:15 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.21  Running higher-order theorem proving
% 4.47/4.51  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.rGQ4gPUVcG/E---3.1_3195132.p
% 10.38/7.52  % Version: 3.5.1-ho
% 10.38/7.52  % partial match(3): HMLMSMSMSSLCHFA
% 10.38/7.52  % Preprocessing class: HMLLSLLMSSLCHFA.
% 10.38/7.52  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 10.38/7.52  % Starting new_ho_10 with 1495s (5) cores
% 10.38/7.52  % Starting sh5l with 299s (1) cores
% 10.38/7.52  % Starting new_bool_1 with 299s (1) cores
% 10.38/7.52  % Starting new_bool_2 with 299s (1) cores
% 10.38/7.52  % new_bool_2 with pid 3195148 completed with status 0
% 10.38/7.52  % Result found by new_bool_2
% 10.38/7.52  % partial match(3): HMLMSMSMSSLCHFA
% 10.38/7.52  % Preprocessing class: HMLLSLLMSSLCHFA.
% 10.38/7.52  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 10.38/7.52  % Starting new_ho_10 with 1495s (5) cores
% 10.38/7.52  % Starting sh5l with 299s (1) cores
% 10.38/7.52  % Starting new_bool_1 with 299s (1) cores
% 10.38/7.52  % Starting new_bool_2 with 299s (1) cores
% 10.38/7.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 10.38/7.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.38/7.52  % Search class: HGHSM-SMLM32-DHFFFFBN
% 10.38/7.52  % partial match(1): HGHSM-SMLM32-DHFFFSBN
% 10.38/7.52  % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 10.38/7.52  % Starting SubtermCWHack with 30s (1) cores
% 10.38/7.52  % SubtermCWHack with pid 3195149 completed with status 0
% 10.38/7.52  % Result found by SubtermCWHack
% 10.38/7.52  % partial match(3): HMLMSMSMSSLCHFA
% 10.38/7.52  % Preprocessing class: HMLLSLLMSSLCHFA.
% 10.38/7.52  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 10.38/7.52  % Starting new_ho_10 with 1495s (5) cores
% 10.38/7.52  % Starting sh5l with 299s (1) cores
% 10.38/7.52  % Starting new_bool_1 with 299s (1) cores
% 10.38/7.52  % Starting new_bool_2 with 299s (1) cores
% 10.38/7.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 10.38/7.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.38/7.52  % Search class: HGHSM-SMLM32-DHFFFFBN
% 10.38/7.52  % partial match(1): HGHSM-SMLM32-DHFFFSBN
% 10.38/7.52  % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 10.38/7.52  % Starting SubtermCWHack with 30s (1) cores
% 10.38/7.52  % Preprocessing time       : 0.112 s
% 10.38/7.52  
% 10.38/7.52  % Proof found!
% 10.38/7.52  % SZS status ContradictoryAxioms
% 10.38/7.52  % SZS output start CNFRefutation
% See solution above
% 10.38/7.52  % Parsed axioms                        : 11045
% 10.38/7.52  % Removed by relevancy pruning/SinE    : 8568
% 10.38/7.52  % Initial clauses                      : 6998
% 10.38/7.52  % Removed in clause preprocessing      : 1910
% 10.38/7.52  % Initial clauses in saturation        : 5088
% 10.38/7.52  % Processed clauses                    : 303
% 10.38/7.52  % ...of these trivial                  : 55
% 10.38/7.52  % ...subsumed                          : 40
% 10.38/7.52  % ...remaining for further processing  : 208
% 10.38/7.52  % Other redundant clauses eliminated   : 12
% 10.38/7.52  % Clauses deleted for lack of memory   : 0
% 10.38/7.52  % Backward-subsumed                    : 4
% 10.38/7.52  % Backward-rewritten                   : 6
% 10.38/7.52  % Generated clauses                    : 122
% 10.38/7.52  % ...of the previous two non-redundant : 54
% 10.38/7.52  % ...aggressively subsumed             : 0
% 10.38/7.52  % Contextual simplify-reflections      : 0
% 10.38/7.52  % Paramodulations                      : 97
% 10.38/7.52  % Factorizations                       : 0
% 10.38/7.52  % NegExts                              : 0
% 10.38/7.52  % Equation resolutions                 : 12
% 10.38/7.52  % Disequality decompositions           : 0
% 10.38/7.52  % Total rewrite steps                  : 133
% 10.38/7.52  % ...of those cached                   : 73
% 10.38/7.52  % Propositional unsat checks           : 0
% 10.38/7.52  %    Propositional check models        : 0
% 10.38/7.52  %    Propositional check unsatisfiable : 0
% 10.38/7.52  %    Propositional clauses             : 0
% 10.38/7.52  %    Propositional clauses after purity: 0
% 10.38/7.52  %    Propositional unsat core size     : 0
% 10.38/7.52  %    Propositional preprocessing time  : 0.000
% 10.38/7.52  %    Propositional encoding time       : 0.000
% 10.38/7.52  %    Propositional solver time         : 0.000
% 10.38/7.52  %    Success case prop preproc time    : 0.000
% 10.38/7.52  %    Success case prop encoding time   : 0.000
% 10.38/7.52  %    Success case prop solver time     : 0.000
% 10.38/7.52  % Current number of processed clauses  : 186
% 10.38/7.52  %    Positive orientable unit clauses  : 122
% 10.38/7.52  %    Positive unorientable unit clauses: 0
% 10.38/7.52  %    Negative unit clauses             : 51
% 10.38/7.52  %    Non-unit-clauses                  : 13
% 10.38/7.52  % Current number of unprocessed clauses: 4839
% 10.38/7.52  % ...number of literals in the above   : 18304
% 10.38/7.52  % Current number of archived formulas  : 0
% 10.38/7.52  % Current number of archived clauses   : 10
% 10.38/7.52  % Clause-clause subsumption calls (NU) : 39
% 10.38/7.52  % Rec. Clause-clause subsumption calls : 34
% 10.38/7.52  % Non-unit clause-clause subsumptions  : 3
% 10.38/7.52  % Unit Clause-clause subsumption calls : 918
% 10.38/7.52  % Rewrite failures with RHS unbound    : 0
% 10.38/7.52  % BW rewrite match attempts            : 31
% 10.38/7.52  % BW rewrite match successes           : 6
% 10.38/7.52  % Condensation attempts                : 0
% 10.38/7.52  % Condensation successes               : 0
% 10.38/7.52  % Termbank termtop insertions          : 630511
% 10.38/7.52  % Search garbage collected termcells   : 172117
% 10.38/7.52  
% 10.38/7.52  % -------------------------------------------------
% 10.38/7.52  % User time                : 1.344 s
% 10.38/7.52  % System time              : 0.099 s
% 10.38/7.52  % Total time               : 1.443 s
% 10.38/7.52  % Maximum resident set size: 44436 pages
% 10.38/7.52  
% 10.38/7.52  % -------------------------------------------------
% 10.38/7.52  % User time                : 2.822 s
% 10.38/7.52  % System time              : 0.150 s
% 10.38/7.52  % Total time               : 2.973 s
% 10.38/7.52  % Maximum resident set size: 29952 pages
% 10.38/7.52  % E exiting
%------------------------------------------------------------------------------