TSTP Solution File: LCL808-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : LCL808-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:33:55 EDT 2023

% Result   : Unsatisfiable 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   12 (   9 unt;   0 nHn;  12 RR)
%            Number of literals    :   20 (   0 equ;  10 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-4 aty)
%            Number of variables   :    9 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_CHAINED_0_01,axiom,
    ( c_InductTermi_OIT(c_Lambda_Osubst(v_b____,X1,X2))
    | ~ c_Type_Otyping(X3,X1,v_T____)
    | ~ c_InductTermi_OIT(X1)
    | ~ c_Type_Otyping(c_Type_Oshift(X3,X2,v_T____,tc_Type_Otype),v_b____,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.fwnMLOQZe1/E---3.1_14933.p',cls_CHAINED_0_01) ).

cnf(cls_CHAINED_0,axiom,
    c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),v_b____,v_Ua____),
    file('/export/starexec/sandbox/tmp/tmp.fwnMLOQZe1/E---3.1_14933.p',cls_CHAINED_0) ).

cnf(cls_CHAINED_0_03,axiom,
    c_Type_Otyping(v_e____,v_u____,v_T____),
    file('/export/starexec/sandbox/tmp/tmp.fwnMLOQZe1/E---3.1_14933.p',cls_CHAINED_0_03) ).

cnf(cls_uIT_0,axiom,
    c_InductTermi_OIT(v_u____),
    file('/export/starexec/sandbox/tmp/tmp.fwnMLOQZe1/E---3.1_14933.p',cls_uIT_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_InductTermi_OIT(c_Lambda_Osubst(v_b____,v_u____,v_i____)),
    file('/export/starexec/sandbox/tmp/tmp.fwnMLOQZe1/E---3.1_14933.p',cls_conjecture_0) ).

cnf(c_0_5,axiom,
    ( c_InductTermi_OIT(c_Lambda_Osubst(v_b____,X1,X2))
    | ~ c_Type_Otyping(X3,X1,v_T____)
    | ~ c_InductTermi_OIT(X1)
    | ~ c_Type_Otyping(c_Type_Oshift(X3,X2,v_T____,tc_Type_Otype),v_b____,X4) ),
    cls_CHAINED_0_01 ).

cnf(c_0_6,axiom,
    c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),v_b____,v_Ua____),
    cls_CHAINED_0 ).

cnf(c_0_7,plain,
    ( c_InductTermi_OIT(c_Lambda_Osubst(v_b____,X1,v_i____))
    | ~ c_Type_Otyping(v_e____,X1,v_T____)
    | ~ c_InductTermi_OIT(X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,axiom,
    c_Type_Otyping(v_e____,v_u____,v_T____),
    cls_CHAINED_0_03 ).

cnf(c_0_9,axiom,
    c_InductTermi_OIT(v_u____),
    cls_uIT_0 ).

cnf(c_0_10,negated_conjecture,
    ~ c_InductTermi_OIT(c_Lambda_Osubst(v_b____,v_u____,v_i____)),
    cls_conjecture_0 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LCL808-1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n019.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 2400
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon Oct  2 11:53:36 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.fwnMLOQZe1/E---3.1_14933.p
% 0.21/0.51  # Version: 3.1pre001
% 0.21/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # sh5l with pid 15013 completed with status 0
% 0.21/0.51  # Result found by sh5l
% 0.21/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51  # Search class: FGHSM-FFMM32-SFFFFFNN
% 0.21/0.51  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 0.21/0.51  # G-E--_301_C18_F1_URBAN_S0Y with pid 15017 completed with status 0
% 0.21/0.51  # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.21/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51  # Search class: FGHSM-FFMM32-SFFFFFNN
% 0.21/0.51  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.002 s
% 0.21/0.51  
% 0.21/0.51  # Proof found!
% 0.21/0.51  # SZS status Unsatisfiable
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 75
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 6
% 0.21/0.51  # Initial clauses                      : 69
% 0.21/0.51  # Removed in clause preprocessing      : 0
% 0.21/0.51  # Initial clauses in saturation        : 69
% 0.21/0.51  # Processed clauses                    : 78
% 0.21/0.51  # ...of these trivial                  : 2
% 0.21/0.51  # ...subsumed                          : 14
% 0.21/0.51  # ...remaining for further processing  : 62
% 0.21/0.51  # Other redundant clauses eliminated   : 0
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 1
% 0.21/0.51  # Backward-rewritten                   : 0
% 0.21/0.51  # Generated clauses                    : 109
% 0.21/0.51  # ...of the previous two non-redundant : 88
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 103
% 0.21/0.51  # Factorizations                       : 2
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 4
% 0.21/0.51  # Total rewrite steps                  : 35
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 61
% 0.21/0.51  #    Positive orientable unit clauses  : 17
% 0.21/0.51  #    Positive unorientable unit clauses: 0
% 0.21/0.51  #    Negative unit clauses             : 8
% 0.21/0.51  #    Non-unit-clauses                  : 36
% 0.21/0.51  # Current number of unprocessed clauses: 79
% 0.21/0.51  # ...number of literals in the above   : 181
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 1
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 188
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 138
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 6
% 0.21/0.51  # Unit Clause-clause subsumption calls : 4
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 1
% 0.21/0.51  # BW rewrite match successes           : 0
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 2183
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.005 s
% 0.21/0.51  # System time              : 0.003 s
% 0.21/0.51  # Total time               : 0.008 s
% 0.21/0.51  # Maximum resident set size: 1780 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.007 s
% 0.21/0.51  # System time              : 0.005 s
% 0.21/0.51  # Total time               : 0.012 s
% 0.21/0.51  # Maximum resident set size: 1724 pages
% 0.21/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------