↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n016.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:55:29 PM UTC 2026

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

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

tff(decl_sort2,type,
    'C_update_a_update_fun_bool_fun$': $tType ).

tff(decl_sort3,type,
    'D_update_a_update_fun$': $tType ).

tff(decl_sort4,type,
    'D_update_a_update_fun_bool_fun$': $tType ).

tff(decl_32,type,
    'register$': 'C_update_a_update_fun_bool_fun$' ).

tff(decl_173,type,
    'fun_app$k': ( 'C_update_a_update_fun$' * 'C_update_a_update_fun_bool_fun$' ) > $o ).

tff(decl_187,type,
    'g$': 'C_update_a_update_fun$' ).

tff(decl_315,type,
    'compatible$': 'C_update_a_update_fun$' > 'D_update_a_update_fun_bool_fun$' ).

tff(decl_416,type,
    'h$': 'D_update_a_update_fun$' ).

tff(decl_692,type,
    'fun_app$j': ( 'D_update_a_update_fun$' * 'D_update_a_update_fun_bool_fun$' ) > $o ).

tff(conjecture59,conjecture,
    'fun_app$k'('register$','g$'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture59) ).

tff(axiom66,axiom,
    ! [X119: 'C_update_a_update_fun$',X120: 'D_update_a_update_fun$'] :
      ( 'fun_app$j'('compatible$'(X119),X120)
     => 'fun_app$k'('register$',X119) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom66) ).

tff(axiom60,axiom,
    'fun_app$j'('compatible$'('g$'),'h$'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom60) ).

tff(c_0_3,negated_conjecture,
    ~ 'fun_app$k'('register$','g$'),
    inference(assume_negation,[status(cth)],[conjecture59]) ).

tff(c_0_4,negated_conjecture,
    ~ 'fun_app$k'('register$','g$'),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

tff(c_0_5,plain,
    ! [X2220: 'C_update_a_update_fun$',X2221: 'D_update_a_update_fun$'] :
      ( 'fun_app$k'('register$',X2220)
      | ~ 'fun_app$j'('compatible$'(X2220),X2221) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom66])])]) ).

tff(c_0_6,negated_conjecture,
    ~ 'fun_app$k'('register$','g$'),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

tcf(c_0_7,plain,
    ! [X11: 'C_update_a_update_fun$',X9: 'D_update_a_update_fun$'] :
      ( ~ 'fun_app$j'('compatible$'(X11),X9)
      | 'fun_app$k'('register$',X11) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_8,plain,
    'fun_app$j'('compatible$'('g$'),'h$'),
    inference(split_conjunct,[status(thm)],[axiom60]) ).

tcf(c_0_9,negated_conjecture,
    ~ 'fun_app$k'('register$','g$'),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP383_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n016.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 20 22:40:52 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.42  Running first-order theorem proving
% 0.11/0.42  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.20/0.48  % Version: 3.5.1
% 0.20/0.48  % partial match(1): FMLMSMSMSSSNFFN
% 0.20/0.48  % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.20/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  % Starting sh5l with 300s (1) cores
% 0.20/0.48  % new_bool_1 with pid 945931 completed with status 0
% 0.20/0.48  % Result found by new_bool_1
% 0.20/0.48  % partial match(1): FMLMSMSMSSSNFFN
% 0.20/0.48  % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.20/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.48  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48  % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.20/0.48  % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.20/0.48  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.48  % SubtermCWHack with pid 945934 completed with status 0
% 0.20/0.48  % Result found by SubtermCWHack
% 0.20/0.48  % partial match(1): FMLMSMSMSSSNFFN
% 0.20/0.48  % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.20/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.48  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48  % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.20/0.48  % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.20/0.48  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.48  % Preprocessing time       : 0.003 s
% 0.20/0.48  
% 0.20/0.48  % Proof found!
% 0.20/0.48  % SZS status Theorem
% 0.20/0.48  % SZS output start CNFRefutation
% See solution above
% 0.20/0.48  % Parsed axioms                        : 1627
% 0.20/0.48  % Removed by relevancy pruning/SinE    : 1567
% 0.20/0.48  % Initial clauses                      : 66
% 0.20/0.48  % Removed in clause preprocessing      : 3
% 0.20/0.48  % Initial clauses in saturation        : 63
% 0.20/0.48  % Processed clauses                    : 15
% 0.20/0.48  % ...of these trivial                  : 0
% 0.20/0.48  % ...subsumed                          : 1
% 0.20/0.48  % ...remaining for further processing  : 14
% 0.20/0.48  % Other redundant clauses eliminated   : 0
% 0.20/0.48  % Clauses deleted for lack of memory   : 0
% 0.20/0.48  % Backward-subsumed                    : 0
% 0.20/0.48  % Backward-rewritten                   : 0
% 0.20/0.48  % Generated clauses                    : 3
% 0.20/0.48  % ...of the previous two non-redundant : 2
% 0.20/0.48  % ...aggressively subsumed             : 0
% 0.20/0.48  % Contextual simplify-reflections      : 0
% 0.20/0.48  % Paramodulations                      : 3
% 0.20/0.48  % Factorizations                       : 0
% 0.20/0.48  % NegExts                              : 0
% 0.20/0.48  % Equation resolutions                 : 0
% 0.20/0.48  % Disequality decompositions           : 0
% 0.20/0.48  % Total rewrite steps                  : 0
% 0.20/0.48  % ...of those cached                   : 0
% 0.20/0.48  % Propositional unsat checks           : 0
% 0.20/0.48  %    Propositional check models        : 0
% 0.20/0.48  %    Propositional check unsatisfiable : 0
% 0.20/0.48  %    Propositional clauses             : 0
% 0.20/0.48  %    Propositional clauses after purity: 0
% 0.20/0.48  %    Propositional unsat core size     : 0
% 0.20/0.48  %    Propositional preprocessing time  : 0.000
% 0.20/0.48  %    Propositional encoding time       : 0.000
% 0.20/0.48  %    Propositional solver time         : 0.000
% 0.20/0.48  %    Success case prop preproc time    : 0.000
% 0.20/0.48  %    Success case prop encoding time   : 0.000
% 0.20/0.48  %    Success case prop solver time     : 0.000
% 0.20/0.48  % Current number of processed clauses  : 14
% 0.20/0.48  %    Positive orientable unit clauses  : 8
% 0.20/0.48  %    Positive unorientable unit clauses: 0
% 0.20/0.48  %    Negative unit clauses             : 1
% 0.20/0.48  %    Non-unit-clauses                  : 5
% 0.20/0.48  % Current number of unprocessed clauses: 50
% 0.20/0.48  % ...number of literals in the above   : 101
% 0.20/0.48  % Current number of archived formulas  : 0
% 0.20/0.48  % Current number of archived clauses   : 0
% 0.20/0.48  % Clause-clause subsumption calls (NU) : 5
% 0.20/0.48  % Rec. Clause-clause subsumption calls : 5
% 0.20/0.48  % Non-unit clause-clause subsumptions  : 1
% 0.20/0.48  % Unit Clause-clause subsumption calls : 0
% 0.20/0.48  % Rewrite failures with RHS unbound    : 0
% 0.20/0.48  % BW rewrite match attempts            : 0
% 0.20/0.48  % BW rewrite match successes           : 0
% 0.20/0.48  % Condensation attempts                : 0
% 0.20/0.48  % Condensation successes               : 0
% 0.20/0.48  % Termbank termtop insertions          : 16306
% 0.20/0.48  % Search garbage collected termcells   : 9219
% 0.20/0.48  
% 0.20/0.48  % -------------------------------------------------
% 0.20/0.48  % User time                : 0.013 s
% 0.20/0.48  % System time              : 0.008 s
% 0.20/0.48  % Total time               : 0.021 s
% 0.20/0.48  % Maximum resident set size: 7312 pages
% 0.20/0.48  
% 0.20/0.48  % -------------------------------------------------
% 0.20/0.48  % User time                : 0.041 s
% 0.20/0.48  % System time              : 0.011 s
% 0.20/0.48  % Total time               : 0.052 s
% 0.20/0.48  % Maximum resident set size: 7168 pages
% 0.20/0.48  % E exiting
%------------------------------------------------------------------------------