TSTP Solution File: LCL837-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL837-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:22:03 EDT 2023
% Result : Timeout 1.21s 300.09s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 14 unt; 0 nHn; 7 RR)
% Number of literals : 20 ( 10 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 11 con; 0-5 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Suc__eq__plus1_0,axiom,
c_Suc(X1) = hAPP(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),X1),c_HOL_Oone__class_Oone(tc_nat)),
file('/export/starexec/sandbox2/tmp/tmp.ib5THrxnmM/E---3.1_22469.p',cls_Suc__eq__plus1_0) ).
cnf(cls_One__nat__def_0,axiom,
c_HOL_Oone__class_Oone(tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
file('/export/starexec/sandbox2/tmp/tmp.ib5THrxnmM/E---3.1_22469.p',cls_One__nat__def_0) ).
cnf(cls_subst__subst_0,axiom,
( hAPP(hAPP(hAPP(c_Lambda_Osubst,hAPP(hAPP(hAPP(c_Lambda_Osubst,X1),hAPP(hAPP(c_Lambda_Olift,X2),X3)),c_Suc(X4))),hAPP(hAPP(hAPP(c_Lambda_Osubst,X5),X2),X4)),X3) = hAPP(hAPP(hAPP(c_Lambda_Osubst,hAPP(hAPP(hAPP(c_Lambda_Osubst,X1),X5),X3)),X2),X4)
| ~ c_HOL_Oord__class_Oless(X3,hAPP(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),X4),c_HOL_Oone__class_Oone(tc_nat)),tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.ib5THrxnmM/E---3.1_22469.p',cls_subst__subst_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(hAPP(c_Lambda_Osubst,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_r____),hAPP(hAPP(c_Lambda_Olift,v_u____),c_HOL_Ozero__class_Ozero(tc_nat))),c_Suc(v_i____))),hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),v_u____),v_i____)),c_HOL_Ozero__class_Ozero(tc_nat)),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_as____,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB))),
file('/export/starexec/sandbox2/tmp/tmp.ib5THrxnmM/E---3.1_22469.p',cls_conjecture_0) ).
cnf(cls_subst__map_0,axiom,
hAPP(hAPP(hAPP(c_Lambda_Osubst,c_List_Ofoldl(c_Lambda_OdB_OApp,X1,X2,tc_Lambda_OdB,tc_Lambda_OdB)),X3),X4) = c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(hAPP(c_Lambda_Osubst,X1),X3),X4),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,X3,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),X4,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),X2,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),
file('/export/starexec/sandbox2/tmp/tmp.ib5THrxnmM/E---3.1_22469.p',cls_subst__map_0) ).
cnf(cls_CHAINED_0,axiom,
hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_r____),v_a____),c_HOL_Ozero__class_Ozero(tc_nat)),v_as____,tc_Lambda_OdB,tc_Lambda_OdB)),v_u____),v_i____))),
file('/export/starexec/sandbox2/tmp/tmp.ib5THrxnmM/E---3.1_22469.p',cls_CHAINED_0) ).
cnf(cls_zero__less__Suc_0,axiom,
c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(X1),tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.ib5THrxnmM/E---3.1_22469.p',cls_zero__less__Suc_0) ).
cnf(c_0_7,axiom,
c_Suc(X1) = hAPP(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),X1),c_HOL_Oone__class_Oone(tc_nat)),
cls_Suc__eq__plus1_0 ).
cnf(c_0_8,axiom,
c_HOL_Oone__class_Oone(tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
cls_One__nat__def_0 ).
cnf(c_0_9,axiom,
( hAPP(hAPP(hAPP(c_Lambda_Osubst,hAPP(hAPP(hAPP(c_Lambda_Osubst,X1),hAPP(hAPP(c_Lambda_Olift,X2),X3)),c_Suc(X4))),hAPP(hAPP(hAPP(c_Lambda_Osubst,X5),X2),X4)),X3) = hAPP(hAPP(hAPP(c_Lambda_Osubst,hAPP(hAPP(hAPP(c_Lambda_Osubst,X1),X5),X3)),X2),X4)
| ~ c_HOL_Oord__class_Oless(X3,hAPP(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),X4),c_HOL_Oone__class_Oone(tc_nat)),tc_nat) ),
cls_subst__subst_0 ).
cnf(c_0_10,plain,
hAPP(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),X1),c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))) = c_Suc(X1),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(hAPP(c_Lambda_Osubst,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_r____),hAPP(hAPP(c_Lambda_Olift,v_u____),c_HOL_Ozero__class_Ozero(tc_nat))),c_Suc(v_i____))),hAPP(hAPP(hAPP(c_Lambda_Osubst,v_a____),v_u____),v_i____)),c_HOL_Ozero__class_Ozero(tc_nat)),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_as____,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB))),
cls_conjecture_0 ).
cnf(c_0_12,plain,
( hAPP(hAPP(hAPP(c_Lambda_Osubst,hAPP(hAPP(hAPP(c_Lambda_Osubst,X1),hAPP(hAPP(c_Lambda_Olift,X2),X3)),c_Suc(X4))),hAPP(hAPP(hAPP(c_Lambda_Osubst,X5),X2),X4)),X3) = hAPP(hAPP(hAPP(c_Lambda_Osubst,hAPP(hAPP(hAPP(c_Lambda_Osubst,X1),X5),X3)),X2),X4)
| ~ c_HOL_Oord__class_Oless(X3,c_Suc(X4),tc_nat) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_10]) ).
cnf(c_0_13,axiom,
hAPP(hAPP(hAPP(c_Lambda_Osubst,c_List_Ofoldl(c_Lambda_OdB_OApp,X1,X2,tc_Lambda_OdB,tc_Lambda_OdB)),X3),X4) = c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(hAPP(c_Lambda_Osubst,X1),X3),X4),c_List_Omap(c_COMBC(c_COMBC(c_Lambda_Osubst,X3,tc_Lambda_OdB,tc_Lambda_OdB,tc_fun(tc_nat,tc_Lambda_OdB)),X4,tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),X2,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),
cls_subst__map_0 ).
cnf(c_0_14,axiom,
hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_r____),v_a____),c_HOL_Ozero__class_Ozero(tc_nat)),v_as____,tc_Lambda_OdB,tc_Lambda_OdB)),v_u____),v_i____))),
cls_CHAINED_0 ).
cnf(c_0_15,axiom,
c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(X1),tc_nat),
cls_zero__less__Suc_0 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : LCL837-1 : TPTP v8.1.2. Released v4.1.0.
% 0.11/0.16 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 11:58:38 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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/tmp/tmp.ib5THrxnmM/E---3.1_22469.p
% 1.21/300.09 # Version: 3.1pre001
% 1.21/300.09 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.21/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/300.09 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.21/300.09 # Starting new_bool_3 with 300s (1) cores
% 1.21/300.09 # Starting new_bool_1 with 300s (1) cores
% 1.21/300.09 # Starting sh5l with 300s (1) cores
% 1.21/300.09 # new_bool_1 with pid 22557 completed with status 0
% 1.21/300.09 # Result found by new_bool_1
% 1.21/300.09 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.21/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/300.09 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.21/300.09 # Starting new_bool_3 with 300s (1) cores
% 1.21/300.09 # Starting new_bool_1 with 300s (1) cores
% 1.21/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.21/300.09 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.21/300.09 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.21/300.09 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.21/300.09 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 22559 completed with status 0
% 1.21/300.09 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 1.21/300.09 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.21/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/300.09 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.21/300.09 # Starting new_bool_3 with 300s (1) cores
% 1.21/300.09 # Starting new_bool_1 with 300s (1) cores
% 1.21/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.21/300.09 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.21/300.09 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.21/300.09 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.21/300.09 # Preprocessing time : 0.058 s
% 1.21/300.09
% 1.21/300.09 # Proof found!
% 1.21/300.09 # SZS status Unsatisfiable
% 1.21/300.09 # SZS output start CNFRefutation
% See solution above
% 1.21/300.09 # Parsed axioms : 657
% 1.21/300.09 # Removed by relevancy pruning/SinE : 230
% 1.21/300.09 # Initial clauses : 427
% 1.21/300.09 # Removed in clause preprocessing : 0
% 1.21/300.09 # Initial clauses in saturation : 427
% 1.21/300.09 # Processed clauses : 334
% 1.21/300.09 # ...of these trivial : 25
% 1.21/300.09 # ...subsumed : 61
% 1.21/300.09 # ...remaining for further processing : 248
% 1.21/300.09 # Other redundant clauses eliminated : 3
% 1.21/300.09 # Clauses deleted for lack of memory : 0
% 1.21/300.09 # Backward-subsumed : 3
% 1.21/300.09 # Backward-rewritten : 9
% 1.21/300.09 # Generated clauses : 2150
% 1.21/300.09 # ...of the previous two non-redundant : 1698
% 1.21/300.09 # ...aggressively subsumed : 0
% 1.21/300.09 # Contextual simplify-reflections : 0
% 1.21/300.09 # Paramodulations : 2127
% 1.21/300.09 # Factorizations : 2
% 1.21/300.09 # NegExts : 0
% 1.21/300.09 # Equation resolutions : 21
% 1.21/300.09 # Total rewrite steps : 1887
% 1.21/300.09 # Propositional unsat checks : 0
% 1.21/300.09 # Propositional check models : 0
% 1.21/300.09 # Propositional check unsatisfiable : 0
% 1.21/300.09 # Propositional clauses : 0
% 1.21/300.09 # Propositional clauses after purity: 0
% 1.21/300.09 # Propositional unsat core size : 0
% 1.21/300.09 # Propositional preprocessing time : 0.000
% 1.21/300.09 # Propositional encoding time : 0.000
% 1.21/300.09 # Propositional solver time : 0.000
% 1.21/300.09 # Success case prop preproc time : 0.000
% 1.21/300.09 # Success case prop encoding time : 0.000
% 1.21/300.09 # Success case prop solver time : 0.000
% 1.21/300.09 # Current number of processed clauses : 236
% 1.21/300.09 # Positive orientable unit clauses : 50
% 1.21/300.09 # Positive unorientable unit clauses: 2
% 1.21/300.09 # Negative unit clauses : 13
% 1.21/300.09 # Non-unit-clauses : 171
% 1.21/300.09 # Current number of unprocessed clauses: 1783
% 1.21/300.09 # ...number of literals in the above : 4213
% 1.21/300.09 # Current number of archived formulas : 0
% 1.21/300.09 # Current number of archived clauses : 12
% 1.21/300.09 # Clause-clause subsumption calls (NU) : 4779
% 1.21/300.09 # Rec. Clause-clause subsumption calls : 3943
% 1.21/300.09 # Non-unit clause-clause subsumptions : 54
% 1.21/300.09 # Unit Clause-clause subsumption calls : 46
% 1.21/300.09 # Rewrite failures with RHS unbound : 0
% 1.21/300.09 # BW rewrite match attempts : 83
% 1.21/300.09 # BW rewrite match successes : 37
% 1.21/300.09 # Condensation attempts : 0
% 1.21/300.09 # Condensation successes : 0
% 1.21/300.09 # Termbank termtop insertions : 45758
% 1.21/300.09
% 1.21/300.09 # -------------------------------------------------
% 1.21/300.09 # User time : 0.097 s
% 1.21/300.09 # System time : 0.014 s
% 1.21/300.09 # Total time : 0.111 s
% 1.21/300.09 # Maximum resident set size: 2768 pages
% 1.21/300.09
% 1.21/300.09 # -------------------------------------------------
% 1.21/300.09 # User time : 0.114 s
% 1.21/300.09 # System time : 0.017 s
% 1.21/300.09 # Total time : 0.131 s
% 1.21/300.09 # Maximum resident set size: 2168 pages
% 1.21/300.09 % E---3.1 exiting
% 1.21/300.09 % E---3.1 exiting
%------------------------------------------------------------------------------