TSTP Solution File: LCL811-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL811-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Sat May 4 08:24:36 EDT 2024
% Result : Unsatisfiable 44.48s 6.05s
% Output : CNFRefutation 44.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 10 RR)
% Number of literals : 17 ( 7 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 10 con; 0-5 aty)
% Number of variables : 37 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_CHAINED_0,axiom,
c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),v_u____),v_i____)),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_i____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),v_bs____,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
file('/export/starexec/sandbox/tmp/tmp.hD8OnM7fJ5/E---3.1_19570.p',cls_CHAINED_0) ).
cnf(cls_True_0,axiom,
v_n____ = v_i____,
file('/export/starexec/sandbox/tmp/tmp.hD8OnM7fJ5/E---3.1_19570.p',cls_True_0) ).
cnf(cls_COMBC__def_0,axiom,
hAPP(c_COMBC(X1,X2,X3,X4,X5),X6) = hAPP(hAPP(X1,X6),X2),
file('/export/starexec/sandbox/tmp/tmp.hD8OnM7fJ5/E---3.1_19570.p',cls_COMBC__def_0) ).
cnf(cls_map__eq__Cons__conv_3,axiom,
c_List_Omap(X1,c_List_Olist_OCons(X2,X3,X4),X4,X5) = c_List_Olist_OCons(hAPP(X1,X2),c_List_Omap(X1,X3,X4,X5),X5),
file('/export/starexec/sandbox/tmp/tmp.hD8OnM7fJ5/E---3.1_19570.p',cls_map__eq__Cons__conv_3) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_i____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Olist_OCons(v_b____,v_bs____,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),
file('/export/starexec/sandbox/tmp/tmp.hD8OnM7fJ5/E---3.1_19570.p',cls_conjecture_0) ).
cnf(c_0_5,axiom,
c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),v_u____),v_i____)),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_i____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),v_bs____,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
cls_CHAINED_0 ).
cnf(c_0_6,axiom,
v_n____ = v_i____,
cls_True_0 ).
cnf(c_0_7,plain,
c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),v_u____),v_n____)),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_n____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),v_bs____,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_8,axiom,
hAPP(c_COMBC(X1,X2,X3,X4,X5),X6) = hAPP(hAPP(X1,X6),X2),
cls_COMBC__def_0 ).
cnf(c_0_9,axiom,
c_List_Omap(X1,c_List_Olist_OCons(X2,X3,X4),X4,X5) = c_List_Olist_OCons(hAPP(X1,X2),c_List_Omap(X1,X3,X4,X5),X5),
cls_map__eq__Cons__conv_3 ).
cnf(c_0_10,negated_conjecture,
~ c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_i____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Olist_OCons(v_b____,v_bs____,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_11,plain,
c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,hAPP(hAPP(c_COMBC(c_Lambda_Osubst,v_u____,X1,X2,X3),v_b____),v_n____)),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_n____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),v_bs____,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
c_List_Omap(c_COMBC(X1,X2,X3,X4,X5),c_List_Olist_OCons(X6,X7,X8),X8,X9) = c_List_Olist_OCons(hAPP(hAPP(X1,X6),X2),c_List_Omap(c_COMBC(X1,X2,X3,X4,X5),X7,X8,X9),X9),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_i____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Olist_OCons(v_b____,v_bs____,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),
c_0_10 ).
cnf(c_0_14,plain,
c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Olist_OCons(hAPP(hAPP(c_COMBC(c_Lambda_Osubst,v_u____,X1,X2,X3),v_b____),v_n____),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_n____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),v_bs____,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,v_u____,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),v_n____,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Olist_OCons(v_b____,v_bs____,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),
inference(rw,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LCL811-1 : TPTP v8.1.2. Released v4.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Fri May 3 08:55:09 EDT 2024
% 0.11/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/tmp/tmp.hD8OnM7fJ5/E---3.1_19570.p
% 44.48/6.05 # Version: 3.1.0
% 44.48/6.05 # Preprocessing class: FSLMSMSMSSSNFFN.
% 44.48/6.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.48/6.05 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 44.48/6.05 # Starting new_bool_3 with 600s (2) cores
% 44.48/6.05 # Starting new_bool_1 with 300s (1) cores
% 44.48/6.05 # Starting sh5l with 300s (1) cores
% 44.48/6.05 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 19682 completed with status 0
% 44.48/6.05 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 44.48/6.05 # Preprocessing class: FSLMSMSMSSSNFFN.
% 44.48/6.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.48/6.05 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 44.48/6.05 # No SInE strategy applied
% 44.48/6.05 # Search class: FGHSM-FSLM33-DFFFFFNN
% 44.48/6.05 # Scheduled 10 strats onto 4 cores with 1200 seconds (1200 total)
% 44.48/6.05 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 217s (1) cores
% 44.48/6.05 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 44.48/6.05 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 109s (1) cores
% 44.48/6.05 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 44.48/6.05 # G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with pid 19696 completed with status 0
% 44.48/6.05 # Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I
% 44.48/6.05 # Preprocessing class: FSLMSMSMSSSNFFN.
% 44.48/6.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 44.48/6.05 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 44.48/6.05 # No SInE strategy applied
% 44.48/6.05 # Search class: FGHSM-FSLM33-DFFFFFNN
% 44.48/6.05 # Scheduled 10 strats onto 4 cores with 1200 seconds (1200 total)
% 44.48/6.05 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 217s (1) cores
% 44.48/6.05 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 44.48/6.05 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 109s (1) cores
% 44.48/6.05 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 44.48/6.05 # Preprocessing time : 0.005 s
% 44.48/6.05 # Presaturation interreduction done
% 44.48/6.05
% 44.48/6.05 # Proof found!
% 44.48/6.05 # SZS status Unsatisfiable
% 44.48/6.05 # SZS output start CNFRefutation
% See solution above
% 44.48/6.05 # Parsed axioms : 432
% 44.48/6.05 # Removed by relevancy pruning/SinE : 0
% 44.48/6.05 # Initial clauses : 432
% 44.48/6.05 # Removed in clause preprocessing : 2
% 44.48/6.05 # Initial clauses in saturation : 430
% 44.48/6.05 # Processed clauses : 25240
% 44.48/6.05 # ...of these trivial : 115
% 44.48/6.05 # ...subsumed : 19723
% 44.48/6.05 # ...remaining for further processing : 5402
% 44.48/6.05 # Other redundant clauses eliminated : 6261
% 44.48/6.05 # Clauses deleted for lack of memory : 0
% 44.48/6.05 # Backward-subsumed : 181
% 44.48/6.05 # Backward-rewritten : 248
% 44.48/6.05 # Generated clauses : 305020
% 44.48/6.05 # ...of the previous two non-redundant : 282454
% 44.48/6.05 # ...aggressively subsumed : 0
% 44.48/6.05 # Contextual simplify-reflections : 4
% 44.48/6.05 # Paramodulations : 298695
% 44.48/6.05 # Factorizations : 3
% 44.48/6.05 # NegExts : 0
% 44.48/6.05 # Equation resolutions : 6322
% 44.48/6.05 # Disequality decompositions : 0
% 44.48/6.05 # Total rewrite steps : 85949
% 44.48/6.05 # ...of those cached : 69954
% 44.48/6.05 # Propositional unsat checks : 0
% 44.48/6.05 # Propositional check models : 0
% 44.48/6.05 # Propositional check unsatisfiable : 0
% 44.48/6.05 # Propositional clauses : 0
% 44.48/6.05 # Propositional clauses after purity: 0
% 44.48/6.05 # Propositional unsat core size : 0
% 44.48/6.05 # Propositional preprocessing time : 0.000
% 44.48/6.05 # Propositional encoding time : 0.000
% 44.48/6.05 # Propositional solver time : 0.000
% 44.48/6.05 # Success case prop preproc time : 0.000
% 44.48/6.05 # Success case prop encoding time : 0.000
% 44.48/6.05 # Success case prop solver time : 0.000
% 44.48/6.05 # Current number of processed clauses : 4609
% 44.48/6.05 # Positive orientable unit clauses : 586
% 44.48/6.05 # Positive unorientable unit clauses: 157
% 44.48/6.05 # Negative unit clauses : 946
% 44.48/6.05 # Non-unit-clauses : 2920
% 44.48/6.05 # Current number of unprocessed clauses: 257425
% 44.48/6.05 # ...number of literals in the above : 442256
% 44.48/6.05 # Current number of archived formulas : 0
% 44.48/6.05 # Current number of archived clauses : 795
% 44.48/6.05 # Clause-clause subsumption calls (NU) : 1914043
% 44.48/6.05 # Rec. Clause-clause subsumption calls : 1435721
% 44.48/6.05 # Non-unit clause-clause subsumptions : 8044
% 44.48/6.05 # Unit Clause-clause subsumption calls : 449965
% 44.48/6.05 # Rewrite failures with RHS unbound : 675313
% 44.48/6.05 # BW rewrite match attempts : 8163
% 44.48/6.05 # BW rewrite match successes : 2927
% 44.48/6.05 # Condensation attempts : 0
% 44.48/6.05 # Condensation successes : 0
% 44.48/6.05 # Termbank termtop insertions : 4896566
% 44.48/6.05 # Search garbage collected termcells : 673
% 44.48/6.05
% 44.48/6.05 # -------------------------------------------------
% 44.48/6.05 # User time : 5.297 s
% 44.48/6.05 # System time : 0.170 s
% 44.48/6.05 # Total time : 5.468 s
% 44.48/6.05 # Maximum resident set size: 2580 pages
% 44.48/6.05
% 44.48/6.05 # -------------------------------------------------
% 44.48/6.05 # User time : 21.276 s
% 44.48/6.05 # System time : 0.745 s
% 44.48/6.05 # Total time : 22.021 s
% 44.48/6.05 # Maximum resident set size: 2032 pages
% 44.48/6.05 % E---3.1 exiting
% 44.48/6.05 % E exiting
%------------------------------------------------------------------------------