TSTP Solution File: LCL776-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL776-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:49 EDT 2023
% Result : Unsatisfiable 0.41s 1.17s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 10 unt; 0 nHn; 11 RR)
% Number of literals : 19 ( 2 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-5 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Beta_0,axiom,
( hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OAbs(X1)),X2),X3,tc_Lambda_OdB,tc_Lambda_OdB)))
| ~ hBOOL(hAPP(c_InductTermi_OIT,X2))
| ~ hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_Osubst(X1,X2,c_HOL_Ozero__class_Ozero(tc_nat)),X3,tc_Lambda_OdB,tc_Lambda_OdB))) ),
file('/export/starexec/sandbox/tmp/tmp.gBSgWPDD7u/E---3.1_9381.p',cls_Beta_0) ).
cnf(cls_app__last_0,axiom,
hAPP(hAPP(c_Lambda_OdB_OApp,c_List_Ofoldl(c_Lambda_OdB_OApp,X1,X2,tc_Lambda_OdB,tc_Lambda_OdB)),X3) = c_List_Ofoldl(c_Lambda_OdB_OApp,X1,c_List_Oappend(X2,c_List_Olist_OCons(X3,c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),
file('/export/starexec/sandbox/tmp/tmp.gBSgWPDD7u/E---3.1_9381.p',cls_app__last_0) ).
cnf(cls_conjecture_4,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OAbs(v_r)),v_s),c_List_Oappend(v_ss,c_List_Olist_OCons(c_Lambda_OdB_OVar(v_i),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB))),
file('/export/starexec/sandbox/tmp/tmp.gBSgWPDD7u/E---3.1_9381.p',cls_conjecture_4) ).
cnf(cls_conjecture_1,negated_conjecture,
hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(c_Lambda_OdB_OApp,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_Osubst(v_r,v_s,c_HOL_Ozero__class_Ozero(tc_nat)),v_ss,tc_Lambda_OdB,tc_Lambda_OdB)),c_Lambda_OdB_OVar(v_i)))),
file('/export/starexec/sandbox/tmp/tmp.gBSgWPDD7u/E---3.1_9381.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
hBOOL(hAPP(c_InductTermi_OIT,v_s)),
file('/export/starexec/sandbox/tmp/tmp.gBSgWPDD7u/E---3.1_9381.p',cls_conjecture_2) ).
cnf(c_0_5,axiom,
( hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OAbs(X1)),X2),X3,tc_Lambda_OdB,tc_Lambda_OdB)))
| ~ hBOOL(hAPP(c_InductTermi_OIT,X2))
| ~ hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_Osubst(X1,X2,c_HOL_Ozero__class_Ozero(tc_nat)),X3,tc_Lambda_OdB,tc_Lambda_OdB))) ),
cls_Beta_0 ).
cnf(c_0_6,axiom,
hAPP(hAPP(c_Lambda_OdB_OApp,c_List_Ofoldl(c_Lambda_OdB_OApp,X1,X2,tc_Lambda_OdB,tc_Lambda_OdB)),X3) = c_List_Ofoldl(c_Lambda_OdB_OApp,X1,c_List_Oappend(X2,c_List_Olist_OCons(X3,c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),
cls_app__last_0 ).
cnf(c_0_7,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OAbs(v_r)),v_s),c_List_Oappend(v_ss,c_List_Olist_OCons(c_Lambda_OdB_OVar(v_i),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB))),
cls_conjecture_4 ).
cnf(c_0_8,plain,
( hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(c_Lambda_OdB_OApp,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OAbs(X1)),X2),X3,tc_Lambda_OdB,tc_Lambda_OdB)),X4)))
| ~ hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(c_Lambda_OdB_OApp,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_Osubst(X1,X2,c_HOL_Ozero__class_Ozero(tc_nat)),X3,tc_Lambda_OdB,tc_Lambda_OdB)),X4)))
| ~ hBOOL(hAPP(c_InductTermi_OIT,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,negated_conjecture,
hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(c_Lambda_OdB_OApp,c_List_Ofoldl(c_Lambda_OdB_OApp,c_Lambda_Osubst(v_r,v_s,c_HOL_Ozero__class_Ozero(tc_nat)),v_ss,tc_Lambda_OdB,tc_Lambda_OdB)),c_Lambda_OdB_OVar(v_i)))),
cls_conjecture_1 ).
cnf(c_0_10,negated_conjecture,
hBOOL(hAPP(c_InductTermi_OIT,v_s)),
cls_conjecture_2 ).
cnf(c_0_11,negated_conjecture,
~ hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(c_Lambda_OdB_OApp,c_List_Ofoldl(c_Lambda_OdB_OApp,hAPP(hAPP(c_Lambda_OdB_OApp,c_Lambda_OdB_OAbs(v_r)),v_s),v_ss,tc_Lambda_OdB,tc_Lambda_OdB)),c_Lambda_OdB_OVar(v_i)))),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL776-1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 12:23:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.57 Running first-order model finding
% 0.21/0.57 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.gBSgWPDD7u/E---3.1_9381.p
% 0.41/1.17 # Version: 3.1pre001
% 0.41/1.17 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.41/1.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/1.17 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.41/1.17 # Starting new_bool_3 with 600s (2) cores
% 0.41/1.17 # Starting new_bool_1 with 300s (1) cores
% 0.41/1.17 # Starting sh5l with 300s (1) cores
% 0.41/1.17 # sh5l with pid 9476 completed with status 0
% 0.41/1.17 # Result found by sh5l
% 0.41/1.17 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.41/1.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/1.17 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.41/1.17 # Starting new_bool_3 with 600s (2) cores
% 0.41/1.17 # Starting new_bool_1 with 300s (1) cores
% 0.41/1.17 # Starting sh5l with 300s (1) cores
% 0.41/1.17 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.41/1.17 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.41/1.17 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.41/1.17 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.41/1.17 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 9480 completed with status 0
% 0.41/1.17 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.41/1.17 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.41/1.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/1.17 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.41/1.17 # Starting new_bool_3 with 600s (2) cores
% 0.41/1.17 # Starting new_bool_1 with 300s (1) cores
% 0.41/1.17 # Starting sh5l with 300s (1) cores
% 0.41/1.17 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.41/1.17 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.41/1.17 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.41/1.17 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.41/1.17 # Preprocessing time : 0.093 s
% 0.41/1.17
% 0.41/1.17 # Proof found!
% 0.41/1.17 # SZS status Unsatisfiable
% 0.41/1.17 # SZS output start CNFRefutation
% See solution above
% 0.41/1.17 # Parsed axioms : 871
% 0.41/1.17 # Removed by relevancy pruning/SinE : 180
% 0.41/1.17 # Initial clauses : 691
% 0.41/1.17 # Removed in clause preprocessing : 0
% 0.41/1.17 # Initial clauses in saturation : 691
% 0.41/1.17 # Processed clauses : 2340
% 0.41/1.17 # ...of these trivial : 84
% 0.41/1.17 # ...subsumed : 1284
% 0.41/1.17 # ...remaining for further processing : 972
% 0.41/1.17 # Other redundant clauses eliminated : 4
% 0.41/1.17 # Clauses deleted for lack of memory : 0
% 0.41/1.17 # Backward-subsumed : 20
% 0.41/1.17 # Backward-rewritten : 16
% 0.41/1.17 # Generated clauses : 15826
% 0.41/1.17 # ...of the previous two non-redundant : 14146
% 0.41/1.17 # ...aggressively subsumed : 0
% 0.41/1.17 # Contextual simplify-reflections : 5
% 0.41/1.17 # Paramodulations : 15779
% 0.41/1.17 # Factorizations : 10
% 0.41/1.17 # NegExts : 0
% 0.41/1.17 # Equation resolutions : 37
% 0.41/1.17 # Total rewrite steps : 6016
% 0.41/1.17 # Propositional unsat checks : 0
% 0.41/1.17 # Propositional check models : 0
% 0.41/1.17 # Propositional check unsatisfiable : 0
% 0.41/1.17 # Propositional clauses : 0
% 0.41/1.17 # Propositional clauses after purity: 0
% 0.41/1.17 # Propositional unsat core size : 0
% 0.41/1.17 # Propositional preprocessing time : 0.000
% 0.41/1.17 # Propositional encoding time : 0.000
% 0.41/1.17 # Propositional solver time : 0.000
% 0.41/1.17 # Success case prop preproc time : 0.000
% 0.41/1.17 # Success case prop encoding time : 0.000
% 0.41/1.17 # Success case prop solver time : 0.000
% 0.41/1.17 # Current number of processed clauses : 936
% 0.41/1.17 # Positive orientable unit clauses : 160
% 0.41/1.17 # Positive unorientable unit clauses: 14
% 0.41/1.17 # Negative unit clauses : 90
% 0.41/1.17 # Non-unit-clauses : 672
% 0.41/1.17 # Current number of unprocessed clauses: 12461
% 0.41/1.17 # ...number of literals in the above : 35669
% 0.41/1.17 # Current number of archived formulas : 0
% 0.41/1.17 # Current number of archived clauses : 36
% 0.41/1.17 # Clause-clause subsumption calls (NU) : 86479
% 0.41/1.17 # Rec. Clause-clause subsumption calls : 55471
% 0.41/1.17 # Non-unit clause-clause subsumptions : 526
% 0.41/1.17 # Unit Clause-clause subsumption calls : 20009
% 0.41/1.17 # Rewrite failures with RHS unbound : 4
% 0.41/1.17 # BW rewrite match attempts : 631
% 0.41/1.17 # BW rewrite match successes : 40
% 0.41/1.17 # Condensation attempts : 0
% 0.41/1.17 # Condensation successes : 0
% 0.41/1.17 # Termbank termtop insertions : 292564
% 0.41/1.17
% 0.41/1.17 # -------------------------------------------------
% 0.41/1.17 # User time : 0.513 s
% 0.41/1.17 # System time : 0.042 s
% 0.41/1.17 # Total time : 0.555 s
% 0.41/1.17 # Maximum resident set size: 3272 pages
% 0.41/1.17
% 0.41/1.17 # -------------------------------------------------
% 0.41/1.17 # User time : 0.528 s
% 0.41/1.17 # System time : 0.044 s
% 0.41/1.17 # Total time : 0.572 s
% 0.41/1.17 # Maximum resident set size: 2348 pages
% 0.41/1.17 % E---3.1 exiting
%------------------------------------------------------------------------------