↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n006.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 03:10:49 PM UTC 2026

% Result   : Theorem 2.36s 1.04s
% Output   : CNFRefutation 2.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (  11 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   26 (  13   ~;   8   |;   3   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :   17 (  17 usr;   8 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_6,conjecture,
    hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_6) ).

fof(fact_453_insert__subset,axiom,
    ! [X11,X5,X10] :
      ( hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X11),X5)),X10))
    <=> ( hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X5),X10))
        & hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X11),X10)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_453_insert__subset) ).

fof(conj_1,hypothesis,
    hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,g),image_pname_a(mgt_call,u))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

fof(fact_434_imageI,axiom,
    ! [X9,X11,X5] :
      ( hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,X11),X5))
     => hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(X9,X11)),image_pname_a(X9,X5))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_434_imageI) ).

fof(conj_4,hypothesis,
    hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,pn),u)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_4) ).

fof(c_0_5,negated_conjecture,
    ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u))),
    inference(assume_negation,[status(cth)],[conj_6]) ).

fof(c_0_6,negated_conjecture,
    ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u))),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_7,negated_conjecture,
    ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u))),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

fof(c_0_8,plain,
    ! [X270,X271,X272] :
      ( ( hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X270),X271)),X272))
        | ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X271),X272))
        | ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X270),X272)) )
      & ( ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X270),X271)),X272))
        | hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X271),X272)) )
      & ( ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X270),X271)),X272))
        | hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X270),X272)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_453_insert__subset])])])]) ).

cnf(c_0_9,negated_conjecture,
    ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    ( ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X3),X2))
    | ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X1),X2))
    | hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X1),X3)),X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,hypothesis,
    hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,g),image_pname_a(mgt_call,u))),
    inference(split_conjunct,[status(thm)],[conj_1]) ).

fof(c_0_12,plain,
    ! [X338,X339,X340] :
      ( hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(X338,X339)),image_pname_a(X338,X340)))
      | ~ hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,X339),X340)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_434_imageI])])]) ).

cnf(c_0_13,negated_conjecture,
    ~ hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(mgt_call,pn)),image_pname_a(mgt_call,u))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_14,plain,
    ( ~ hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,X1),X2))
    | hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(X3,X1)),image_pname_a(X3,X2))) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_15,hypothesis,
    hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,pn),u)),
    inference(split_conjunct,[status(thm)],[conj_4]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW473+3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.58  % Computer : n006.cluster.edu
% 0.09/0.58  % Model    : x86_64 x86_64
% 0.09/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.58  % Memory   : 8046.5625MB
% 0.09/0.58  % OS       : Linux 6.8.0-71-generic
% 0.09/0.58  % CPULimit : 300
% 0.09/0.58  % WCLimit  : 300
% 0.09/0.58  % DateTime : Mon Sep 21 09:57:58 UTC 2026
% 0.09/0.58  % CPUTime  : 
% 0.09/0.58  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.62  Running first-order theorem proving
% 0.09/0.62  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.14/1.04  % Version: 3.5.1
% 0.14/1.04  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/1.04  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/1.04  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/1.04  % Starting new_bool_3 with 300s (1) cores
% 0.14/1.04  % Starting new_bool_1 with 300s (1) cores
% 0.14/1.04  % Starting sh5l with 300s (1) cores
% 0.14/1.04  % new_bool_3 with pid 2568482 completed with status 0
% 0.14/1.04  % Result found by new_bool_3
% 0.14/1.04  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/1.04  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/1.04  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/1.04  % Starting new_bool_3 with 300s (1) cores
% 0.14/1.04  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/1.04  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/1.04  % Search class: FGHSM-FSLM31-DFFFFFNN
% 0.14/1.04  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/1.04  % Starting SubtermCWHack with 28s (1) cores
% 0.14/1.04  % SubtermCWHack with pid 2568485 completed with status 0
% 0.14/1.04  % Result found by SubtermCWHack
% 2.36/1.04  % Preprocessing class: FMLMSMSMSSSNFFN.
% 2.36/1.04  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.36/1.04  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.36/1.04  % Starting new_bool_3 with 300s (1) cores
% 2.36/1.04  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.36/1.04  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.36/1.04  % Search class: FGHSM-FSLM31-DFFFFFNN
% 2.36/1.04  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.36/1.04  % Starting SubtermCWHack with 28s (1) cores
% 2.36/1.04  % Preprocessing time       : 0.007 s
% 2.36/1.04  
% 2.36/1.04  % Proof found!
% 2.36/1.04  % SZS status Theorem
% 2.36/1.04  % SZS output start CNFRefutation
% See solution above
% 2.36/1.04  % Parsed axioms                        : 1415
% 2.36/1.04  % Removed by relevancy pruning/SinE    : 881
% 2.36/1.04  % Initial clauses                      : 862
% 2.36/1.04  % Removed in clause preprocessing      : 39
% 2.36/1.04  % Initial clauses in saturation        : 823
% 2.36/1.04  % Processed clauses                    : 6065
% 2.36/1.04  % ...of these trivial                  : 104
% 2.36/1.04  % ...subsumed                          : 4517
% 2.36/1.04  % ...remaining for further processing  : 1444
% 2.36/1.04  % Other redundant clauses eliminated   : 457
% 2.36/1.04  % Clauses deleted for lack of memory   : 0
% 2.36/1.04  % Backward-subsumed                    : 15
% 2.36/1.04  % Backward-rewritten                   : 46
% 2.36/1.04  % Generated clauses                    : 29287
% 2.36/1.04  % ...of the previous two non-redundant : 23719
% 2.36/1.04  % ...aggressively subsumed             : 0
% 2.36/1.04  % Contextual simplify-reflections      : 2
% 2.36/1.04  % Paramodulations                      : 28821
% 2.36/1.04  % Factorizations                       : 6
% 2.36/1.04  % NegExts                              : 0
% 2.36/1.04  % Equation resolutions                 : 470
% 2.36/1.04  % Disequality decompositions           : 0
% 2.36/1.04  % Total rewrite steps                  : 13409
% 2.36/1.04  % ...of those cached                   : 12113
% 2.36/1.04  % Propositional unsat checks           : 0
% 2.36/1.04  %    Propositional check models        : 0
% 2.36/1.04  %    Propositional check unsatisfiable : 0
% 2.36/1.04  %    Propositional clauses             : 0
% 2.36/1.04  %    Propositional clauses after purity: 0
% 2.36/1.04  %    Propositional unsat core size     : 0
% 2.36/1.04  %    Propositional preprocessing time  : 0.000
% 2.36/1.04  %    Propositional encoding time       : 0.000
% 2.36/1.04  %    Propositional solver time         : 0.000
% 2.36/1.04  %    Success case prop preproc time    : 0.000
% 2.36/1.04  %    Success case prop encoding time   : 0.000
% 2.36/1.04  %    Success case prop solver time     : 0.000
% 2.36/1.04  % Current number of processed clauses  : 1297
% 2.36/1.04  %    Positive orientable unit clauses  : 266
% 2.36/1.04  %    Positive unorientable unit clauses: 6
% 2.36/1.04  %    Negative unit clauses             : 118
% 2.36/1.04  %    Non-unit-clauses                  : 907
% 2.36/1.04  % Current number of unprocessed clauses: 18396
% 2.36/1.04  % ...number of literals in the above   : 49694
% 2.36/1.04  % Current number of archived formulas  : 0
% 2.36/1.04  % Current number of archived clauses   : 61
% 2.36/1.04  % Clause-clause subsumption calls (NU) : 101397
% 2.36/1.04  % Rec. Clause-clause subsumption calls : 79387
% 2.36/1.04  % Non-unit clause-clause subsumptions  : 2391
% 2.36/1.04  % Unit Clause-clause subsumption calls : 4429
% 2.36/1.04  % Rewrite failures with RHS unbound    : 0
% 2.36/1.04  % BW rewrite match attempts            : 1411
% 2.36/1.04  % BW rewrite match successes           : 66
% 2.36/1.04  % Condensation attempts                : 0
% 2.36/1.04  % Condensation successes               : 0
% 2.36/1.04  % Termbank termtop insertions          : 521602
% 2.36/1.04  % Search garbage collected termcells   : 18829
% 2.36/1.04  
% 2.36/1.04  % -------------------------------------------------
% 2.36/1.04  % User time                : 0.309 s
% 2.36/1.04  % System time              : 0.017 s
% 2.36/1.04  % Total time               : 0.326 s
% 2.36/1.04  % Maximum resident set size: 7912 pages
% 2.36/1.04  
% 2.36/1.04  % -------------------------------------------------
% 2.36/1.04  % User time                : 0.357 s
% 2.36/1.04  % System time              : 0.023 s
% 2.36/1.04  % Total time               : 0.380 s
% 2.36/1.04  % Maximum resident set size: 6656 pages
% 2.36/1.04  % E exiting
%------------------------------------------------------------------------------