TSTP Solution File: LCL850-1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n024.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 : Tue May 21 00:03:57 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    ~ c_Type_Otyping(c_Type_Oshift(v_ea____,c_HOL_Ozero__class_Ozero(tc_nat),c_Type_Otype_OFun(v_Ta____,v_U____),tc_Type_Otype),c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat)),c_Type_Otype_OFun(v_Ta____,v_U____)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_typing_OVar_0,axiom,
    c_Type_Otyping(X1,c_Lambda_OdB_OVar(X2),hAPP(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_typing_OVar_0) ).

cnf(cls_shift__eq_0,axiom,
    hAPP(c_Type_Oshift(X1,X2,X3,X4),X2) = X3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_shift__eq_0) ).

cnf(c_0_3,negated_conjecture,
    ~ c_Type_Otyping(c_Type_Oshift(v_ea____,c_HOL_Ozero__class_Ozero(tc_nat),c_Type_Otype_OFun(v_Ta____,v_U____),tc_Type_Otype),c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat)),c_Type_Otype_OFun(v_Ta____,v_U____)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_4,axiom,
    c_Type_Otyping(X1,c_Lambda_OdB_OVar(X2),hAPP(X1,X2)),
    cls_typing_OVar_0 ).

cnf(c_0_5,axiom,
    hAPP(c_Type_Oshift(X1,X2,X3,X4),X2) = X3,
    cls_shift__eq_0 ).

cnf(c_0_6,negated_conjecture,
    ~ c_Type_Otyping(c_Type_Oshift(v_ea____,c_HOL_Ozero__class_Ozero(tc_nat),c_Type_Otype_OFun(v_Ta____,v_U____),tc_Type_Otype),c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat)),c_Type_Otype_OFun(v_Ta____,v_U____)),
    c_0_3 ).

cnf(c_0_7,plain,
    c_Type_Otyping(c_Type_Oshift(X1,X2,X3,X4),c_Lambda_OdB_OVar(X2),X3),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : LCL850-1 : TPTP v8.2.0. Released v4.1.0.
% 0.10/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon May 20 01:53:53 EDT 2024
% 0.13/0.33  % CPUTime    : 
% 0.20/0.45  Running first-order model finding
% 0.20/0.45  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.60  # Version: 3.1.0
% 0.20/0.60  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.60  # Starting new_bool_3 with 600s (2) cores
% 0.20/0.60  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.60  # Starting sh5l with 300s (1) cores
% 0.20/0.60  # new_bool_1 with pid 11946 completed with status 0
% 0.20/0.60  # Result found by new_bool_1
% 0.20/0.60  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.60  # Starting new_bool_3 with 600s (2) cores
% 0.20/0.60  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.60  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.60  # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.20/0.60  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.60  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.20/0.60  # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 11954 completed with status 0
% 0.20/0.60  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.20/0.60  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.60  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.60  # Starting new_bool_3 with 600s (2) cores
% 0.20/0.60  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.60  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.60  # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.20/0.60  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.60  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.20/0.60  # Preprocessing time       : 0.011 s
% 0.20/0.60  
% 0.20/0.60  # Proof found!
% 0.20/0.60  # SZS status Unsatisfiable
% 0.20/0.60  # SZS output start CNFRefutation
% See solution above
% 0.20/0.60  # Parsed axioms                        : 902
% 0.20/0.60  # Removed by relevancy pruning/SinE    : 579
% 0.20/0.60  # Initial clauses                      : 323
% 0.20/0.60  # Removed in clause preprocessing      : 0
% 0.20/0.60  # Initial clauses in saturation        : 323
% 0.20/0.60  # Processed clauses                    : 686
% 0.20/0.60  # ...of these trivial                  : 31
% 0.20/0.60  # ...subsumed                          : 301
% 0.20/0.60  # ...remaining for further processing  : 354
% 0.20/0.60  # Other redundant clauses eliminated   : 3
% 0.20/0.60  # Clauses deleted for lack of memory   : 0
% 0.20/0.60  # Backward-subsumed                    : 9
% 0.20/0.60  # Backward-rewritten                   : 7
% 0.20/0.60  # Generated clauses                    : 6321
% 0.20/0.60  # ...of the previous two non-redundant : 5366
% 0.20/0.60  # ...aggressively subsumed             : 0
% 0.20/0.60  # Contextual simplify-reflections      : 3
% 0.20/0.60  # Paramodulations                      : 6290
% 0.20/0.60  # Factorizations                       : 4
% 0.20/0.60  # NegExts                              : 0
% 0.20/0.60  # Equation resolutions                 : 27
% 0.20/0.60  # Disequality decompositions           : 0
% 0.20/0.60  # Total rewrite steps                  : 3399
% 0.20/0.60  # ...of those cached                   : 2696
% 0.20/0.60  # Propositional unsat checks           : 0
% 0.20/0.60  #    Propositional check models        : 0
% 0.20/0.60  #    Propositional check unsatisfiable : 0
% 0.20/0.60  #    Propositional clauses             : 0
% 0.20/0.60  #    Propositional clauses after purity: 0
% 0.20/0.60  #    Propositional unsat core size     : 0
% 0.20/0.60  #    Propositional preprocessing time  : 0.000
% 0.20/0.60  #    Propositional encoding time       : 0.000
% 0.20/0.60  #    Propositional solver time         : 0.000
% 0.20/0.60  #    Success case prop preproc time    : 0.000
% 0.20/0.60  #    Success case prop encoding time   : 0.000
% 0.20/0.60  #    Success case prop solver time     : 0.000
% 0.20/0.60  # Current number of processed clauses  : 338
% 0.20/0.60  #    Positive orientable unit clauses  : 74
% 0.20/0.60  #    Positive unorientable unit clauses: 3
% 0.20/0.60  #    Negative unit clauses             : 31
% 0.20/0.60  #    Non-unit-clauses                  : 230
% 0.20/0.60  # Current number of unprocessed clauses: 4991
% 0.20/0.60  # ...number of literals in the above   : 12647
% 0.20/0.60  # Current number of archived formulas  : 0
% 0.20/0.60  # Current number of archived clauses   : 16
% 0.20/0.60  # Clause-clause subsumption calls (NU) : 10194
% 0.20/0.60  # Rec. Clause-clause subsumption calls : 9566
% 0.20/0.60  # Non-unit clause-clause subsumptions  : 150
% 0.20/0.60  # Unit Clause-clause subsumption calls : 959
% 0.20/0.60  # Rewrite failures with RHS unbound    : 0
% 0.20/0.60  # BW rewrite match attempts            : 75
% 0.20/0.60  # BW rewrite match successes           : 31
% 0.20/0.60  # Condensation attempts                : 0
% 0.20/0.60  # Condensation successes               : 0
% 0.20/0.60  # Termbank termtop insertions          : 132799
% 0.20/0.60  # Search garbage collected termcells   : 2606
% 0.20/0.60  
% 0.20/0.60  # -------------------------------------------------
% 0.20/0.60  # User time                : 0.107 s
% 0.20/0.60  # System time              : 0.011 s
% 0.20/0.60  # Total time               : 0.119 s
% 0.20/0.60  # Maximum resident set size: 2788 pages
% 0.20/0.60  
% 0.20/0.60  # -------------------------------------------------
% 0.20/0.60  # User time                : 0.123 s
% 0.20/0.60  # System time              : 0.013 s
% 0.20/0.60  # Total time               : 0.136 s
% 0.20/0.60  # Maximum resident set size: 2316 pages
% 0.20/0.60  % E---3.1 exiting
%------------------------------------------------------------------------------