TSTP Solution File: LCL785-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : LCL785-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 23:53:28 EDT 2024

% Result   : Unsatisfiable 0.20s 0.53s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (  14 unt;   0 nHn;  12 RR)
%            Number of literals    :   14 (   6 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;  11 con; 0-5 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    ~ c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(v_n____)),v_a____),v_as____,tc_Lambda_OdB,tc_Lambda_OdB),v_T_H____),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_True_0,axiom,
    v_n____ = v_i____,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_True_0) ).

cnf(cls_nT_0,axiom,
    c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(v_n____),v_rs____,tc_Lambda_OdB,tc_Lambda_OdB),v_T_H____),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_nT_0) ).

cnf(cls_foldl__Cons_0,axiom,
    c_List_Ofoldl(X1,X2,c_List_Olist_OCons(X3,X4,X5),X6,X5) = c_List_Ofoldl(X1,hAPP(hAPP(X1,X2),X3),X4,X6,X5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_foldl__Cons_0) ).

cnf(cls_Cons_0,axiom,
    v_rs____ = c_List_Olist_OCons(v_a____,v_as____,tc_Lambda_OdB),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Cons_0) ).

cnf(c_0_5,negated_conjecture,
    ~ c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(v_n____)),v_a____),v_as____,tc_Lambda_OdB,tc_Lambda_OdB),v_T_H____),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_6,negated_conjecture,
    ~ c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(v_n____)),v_a____),v_as____,tc_Lambda_OdB,tc_Lambda_OdB),v_T_H____),
    c_0_5 ).

cnf(c_0_7,axiom,
    v_n____ = v_i____,
    cls_True_0 ).

cnf(c_0_8,axiom,
    c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(v_n____),v_rs____,tc_Lambda_OdB,tc_Lambda_OdB),v_T_H____),
    cls_nT_0 ).

cnf(c_0_9,negated_conjecture,
    ~ c_Type_Otyping(c_Type_Oshift(v_e____,v_n____,v_T____,tc_Type_Otype),c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(v_n____)),v_a____),v_as____,tc_Lambda_OdB,tc_Lambda_OdB),v_T_H____),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,axiom,
    c_List_Ofoldl(X1,X2,c_List_Olist_OCons(X3,X4,X5),X6,X5) = c_List_Ofoldl(X1,hAPP(hAPP(X1,X2),X3),X4,X6,X5),
    cls_foldl__Cons_0 ).

cnf(c_0_11,axiom,
    v_rs____ = c_List_Olist_OCons(v_a____,v_as____,tc_Lambda_OdB),
    cls_Cons_0 ).

cnf(c_0_12,plain,
    c_Type_Otyping(c_Type_Oshift(v_e____,v_n____,v_T____,tc_Type_Otype),c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(v_n____),v_rs____,tc_Lambda_OdB,tc_Lambda_OdB),v_T_H____),
    inference(rw,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL785-1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 02:37:08 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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.20/0.53  # Version: 3.1.0
% 0.20/0.53  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.53  # Starting new_bool_3 with 600s (2) cores
% 0.20/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53  # Starting sh5l with 300s (1) cores
% 0.20/0.53  # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 31378 completed with status 0
% 0.20/0.53  # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.20/0.53  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.53  # No SInE strategy applied
% 0.20/0.53  # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.20/0.53  # Scheduled 11 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.53  # Starting G-E--_303_C18_F1_URBAN_S0Y with 110s (1) cores
% 0.20/0.53  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 110s (1) cores
% 0.20/0.53  # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 110s (1) cores
% 0.20/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 110s (1) cores
% 0.20/0.53  # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 31387 completed with status 0
% 0.20/0.53  # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.20/0.53  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.53  # No SInE strategy applied
% 0.20/0.53  # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.20/0.53  # Scheduled 11 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.53  # Starting G-E--_303_C18_F1_URBAN_S0Y with 110s (1) cores
% 0.20/0.53  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 110s (1) cores
% 0.20/0.53  # Preprocessing time       : 0.007 s
% 0.20/0.53  # Presaturation interreduction done
% 0.20/0.53  
% 0.20/0.53  # Proof found!
% 0.20/0.53  # SZS status Unsatisfiable
% 0.20/0.53  # SZS output start CNFRefutation
% See solution above
% 0.20/0.53  # Parsed axioms                        : 418
% 0.20/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.53  # Initial clauses                      : 418
% 0.20/0.53  # Removed in clause preprocessing      : 1
% 0.20/0.53  # Initial clauses in saturation        : 417
% 0.20/0.53  # Processed clauses                    : 229
% 0.20/0.53  # ...of these trivial                  : 30
% 0.20/0.53  # ...subsumed                          : 23
% 0.20/0.53  # ...remaining for further processing  : 176
% 0.20/0.53  # Other redundant clauses eliminated   : 0
% 0.20/0.53  # Clauses deleted for lack of memory   : 0
% 0.20/0.53  # Backward-subsumed                    : 0
% 0.20/0.53  # Backward-rewritten                   : 2
% 0.20/0.53  # Generated clauses                    : 0
% 0.20/0.53  # ...of the previous two non-redundant : 0
% 0.20/0.53  # ...aggressively subsumed             : 0
% 0.20/0.53  # Contextual simplify-reflections      : 0
% 0.20/0.53  # Paramodulations                      : 0
% 0.20/0.53  # Factorizations                       : 0
% 0.20/0.53  # NegExts                              : 0
% 0.20/0.53  # Equation resolutions                 : 0
% 0.20/0.53  # Disequality decompositions           : 0
% 0.20/0.53  # Total rewrite steps                  : 39
% 0.20/0.53  # ...of those cached                   : 12
% 0.20/0.53  # Propositional unsat checks           : 0
% 0.20/0.53  #    Propositional check models        : 0
% 0.20/0.53  #    Propositional check unsatisfiable : 0
% 0.20/0.53  #    Propositional clauses             : 0
% 0.20/0.53  #    Propositional clauses after purity: 0
% 0.20/0.53  #    Propositional unsat core size     : 0
% 0.20/0.53  #    Propositional preprocessing time  : 0.000
% 0.20/0.53  #    Propositional encoding time       : 0.000
% 0.20/0.53  #    Propositional solver time         : 0.000
% 0.20/0.53  #    Success case prop preproc time    : 0.000
% 0.20/0.53  #    Success case prop encoding time   : 0.000
% 0.20/0.53  #    Success case prop solver time     : 0.000
% 0.20/0.53  # Current number of processed clauses  : 174
% 0.20/0.53  #    Positive orientable unit clauses  : 61
% 0.20/0.53  #    Positive unorientable unit clauses: 5
% 0.20/0.53  #    Negative unit clauses             : 14
% 0.20/0.53  #    Non-unit-clauses                  : 94
% 0.20/0.53  # Current number of unprocessed clauses: 188
% 0.20/0.53  # ...number of literals in the above   : 448
% 0.20/0.53  # Current number of archived formulas  : 0
% 0.20/0.53  # Current number of archived clauses   : 3
% 0.20/0.53  # Clause-clause subsumption calls (NU) : 1984
% 0.20/0.53  # Rec. Clause-clause subsumption calls : 1854
% 0.20/0.53  # Non-unit clause-clause subsumptions  : 13
% 0.20/0.53  # Unit Clause-clause subsumption calls : 171
% 0.20/0.53  # Rewrite failures with RHS unbound    : 442
% 0.20/0.53  # BW rewrite match attempts            : 154
% 0.20/0.53  # BW rewrite match successes           : 138
% 0.20/0.53  # Condensation attempts                : 0
% 0.20/0.53  # Condensation successes               : 0
% 0.20/0.53  # Termbank termtop insertions          : 10855
% 0.20/0.53  # Search garbage collected termcells   : 719
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.021 s
% 0.20/0.53  # System time              : 0.007 s
% 0.20/0.53  # Total time               : 0.027 s
% 0.20/0.53  # Maximum resident set size: 2556 pages
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.073 s
% 0.20/0.53  # System time              : 0.023 s
% 0.20/0.53  # Total time               : 0.096 s
% 0.20/0.53  # Maximum resident set size: 2024 pages
% 0.20/0.53  % E---3.1 exiting
% 0.20/0.53  % E exiting
%------------------------------------------------------------------------------