TSTP Solution File: LCL848-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL848-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:05 EDT 2023
% Result : Timeout 0.73s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-5 aty)
% Number of variables : 4 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB))),
file('/export/starexec/sandbox/tmp/tmp.LNLHYuBzNR/E---3.1_4543.p',cls_conjecture_0) ).
cnf(cls_IT_OVar_0,axiom,
( hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(X1),X2,tc_Lambda_OdB,tc_Lambda_OdB)))
| ~ c_List_Olistsp(c_InductTermi_OIT,X2,tc_Lambda_OdB) ),
file('/export/starexec/sandbox/tmp/tmp.LNLHYuBzNR/E---3.1_4543.p',cls_IT_OVar_0) ).
cnf(cls_CHAINED_0,axiom,
c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
file('/export/starexec/sandbox/tmp/tmp.LNLHYuBzNR/E---3.1_4543.p',cls_CHAINED_0) ).
cnf(c_0_3,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB))),
cls_conjecture_0 ).
cnf(c_0_4,axiom,
( hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_OdB_OVar(X1),X2,tc_Lambda_OdB,tc_Lambda_OdB)))
| ~ c_List_Olistsp(c_InductTermi_OIT,X2,tc_Lambda_OdB) ),
cls_IT_OVar_0 ).
cnf(c_0_5,axiom,
c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
cls_CHAINED_0 ).
cnf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.16 % Problem : LCL848-1 : TPTP v8.1.2. Released v4.1.0.
% 0.09/0.17 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n004.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 12:37:00 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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.LNLHYuBzNR/E---3.1_4543.p
% 0.73/300.13 # Version: 3.1pre001
% 0.73/300.13 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/300.13 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.73/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.73/300.13 # Starting sh5l with 300s (1) cores
% 0.73/300.13 # new_bool_1 with pid 4652 completed with status 0
% 0.73/300.13 # Result found by new_bool_1
% 0.73/300.13 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/300.13 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.73/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.73/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.73/300.13 # Search class: FGHSM-FSLS32-MFFFFFNN
% 0.73/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.73/300.13 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 150s (1) cores
% 0.73/300.13 # G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with pid 4658 completed with status 0
% 0.73/300.13 # Result found by G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V
% 0.73/300.13 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/300.13 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.73/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.73/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.73/300.13 # Search class: FGHSM-FSLS32-MFFFFFNN
% 0.73/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.73/300.13 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 150s (1) cores
% 0.73/300.13 # Preprocessing time : 0.004 s
% 0.73/300.13
% 0.73/300.13 # Proof found!
% 0.73/300.13 # SZS status Unsatisfiable
% 0.73/300.13 # SZS output start CNFRefutation
% See solution above
% 0.73/300.13 # Parsed axioms : 723
% 0.73/300.13 # Removed by relevancy pruning/SinE : 425
% 0.73/300.13 # Initial clauses : 298
% 0.73/300.13 # Removed in clause preprocessing : 0
% 0.73/300.13 # Initial clauses in saturation : 298
% 0.73/300.13 # Processed clauses : 79
% 0.73/300.13 # ...of these trivial : 3
% 0.73/300.13 # ...subsumed : 17
% 0.73/300.13 # ...remaining for further processing : 59
% 0.73/300.13 # Other redundant clauses eliminated : 0
% 0.73/300.13 # Clauses deleted for lack of memory : 0
% 0.73/300.13 # Backward-subsumed : 1
% 0.73/300.13 # Backward-rewritten : 2
% 0.73/300.13 # Generated clauses : 24
% 0.73/300.13 # ...of the previous two non-redundant : 13
% 0.73/300.13 # ...aggressively subsumed : 0
% 0.73/300.13 # Contextual simplify-reflections : 0
% 0.73/300.13 # Paramodulations : 21
% 0.73/300.13 # Factorizations : 0
% 0.73/300.13 # NegExts : 0
% 0.73/300.13 # Equation resolutions : 3
% 0.73/300.13 # Total rewrite steps : 11
% 0.73/300.13 # Propositional unsat checks : 0
% 0.73/300.13 # Propositional check models : 0
% 0.73/300.13 # Propositional check unsatisfiable : 0
% 0.73/300.13 # Propositional clauses : 0
% 0.73/300.13 # Propositional clauses after purity: 0
% 0.73/300.13 # Propositional unsat core size : 0
% 0.73/300.13 # Propositional preprocessing time : 0.000
% 0.73/300.13 # Propositional encoding time : 0.000
% 0.73/300.13 # Propositional solver time : 0.000
% 0.73/300.13 # Success case prop preproc time : 0.000
% 0.73/300.13 # Success case prop encoding time : 0.000
% 0.73/300.13 # Success case prop solver time : 0.000
% 0.73/300.13 # Current number of processed clauses : 56
% 0.73/300.13 # Positive orientable unit clauses : 18
% 0.73/300.13 # Positive unorientable unit clauses: 0
% 0.73/300.13 # Negative unit clauses : 15
% 0.73/300.13 # Non-unit-clauses : 23
% 0.73/300.13 # Current number of unprocessed clauses: 232
% 0.73/300.13 # ...number of literals in the above : 444
% 0.73/300.13 # Current number of archived formulas : 0
% 0.73/300.13 # Current number of archived clauses : 3
% 0.73/300.13 # Clause-clause subsumption calls (NU) : 122
% 0.73/300.13 # Rec. Clause-clause subsumption calls : 116
% 0.73/300.13 # Non-unit clause-clause subsumptions : 4
% 0.73/300.13 # Unit Clause-clause subsumption calls : 25
% 0.73/300.13 # Rewrite failures with RHS unbound : 0
% 0.73/300.13 # BW rewrite match attempts : 6
% 0.73/300.13 # BW rewrite match successes : 2
% 0.73/300.13 # Condensation attempts : 79
% 0.73/300.13 # Condensation successes : 0
% 0.73/300.13 # Termbank termtop insertions : 9635
% 0.73/300.13
% 0.73/300.13 # -------------------------------------------------
% 0.73/300.13 # User time : 0.012 s
% 0.73/300.13 # System time : 0.003 s
% 0.73/300.13 # Total time : 0.015 s
% 0.73/300.13 # Maximum resident set size: 2624 pages
% 0.73/300.13
% 0.73/300.13 # -------------------------------------------------
% 0.73/300.13 # User time : 0.029 s
% 0.73/300.13 # System time : 0.004 s
% 0.73/300.13 # Total time : 0.033 s
% 0.73/300.13 # Maximum resident set size: 2204 pages
% 0.73/300.13 % E---3.1 exiting
% 0.73/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------