TSTP Solution File: LCL753-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL753-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:33 EDT 2024
% Result : Unsatisfiable 1.98s 0.72s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 15 unt; 3 nHn; 12 RR)
% Number of literals : 31 ( 8 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 35 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Lambda_0,axiom,
( c_InductTermi_OIT(c_Lambda_OdB_OAbs(X1))
| ~ c_InductTermi_OIT(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Lambda_0) ).
cnf(cls_subst__Abs_0,axiom,
c_Lambda_Osubst(c_Lambda_OdB_OAbs(X1),X2,X3) = c_Lambda_OdB_OAbs(c_Lambda_Osubst(X1,c_Lambda_Olift(X2,c_HOL_Ozero__class_Ozero(tc_nat)),c_HOL_Oplus__class_Oplus(X3,c_HOL_Oone__class_Oone(tc_nat),tc_nat))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_subst__Abs_0) ).
cnf(cls_Suc__eq__plus1_0,axiom,
c_Suc(X1) = c_HOL_Oplus__class_Oplus(X1,c_HOL_Oone__class_Oone(tc_nat),tc_nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Suc__eq__plus1_0) ).
cnf(cls_lift_Osimps_I1_J_1,axiom,
( c_Lambda_Olift(c_Lambda_OdB_OVar(X1),X2) = c_Lambda_OdB_OVar(c_HOL_Oplus__class_Oplus(X1,c_HOL_Oone__class_Oone(tc_nat),tc_nat))
| c_HOL_Oord__class_Oless(X1,X2,tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_lift_Osimps_I1_J_1) ).
cnf(cls_gr__implies__not0_0,axiom,
~ c_HOL_Oord__class_Oless(X1,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_gr__implies__not0_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_InductTermi_OIT(c_Lambda_Osubst(c_Lambda_OdB_OAbs(v_ra),c_Lambda_OdB_OVar(v_ia),v_ja)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_1,negated_conjecture,
c_InductTermi_OIT(c_Lambda_Osubst(v_ra,c_Lambda_OdB_OVar(X1),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_7,plain,
( c_InductTermi_OIT(c_Lambda_OdB_OAbs(X1))
| ~ c_InductTermi_OIT(X1) ),
inference(fof_simplification,[status(thm)],[cls_Lambda_0]) ).
cnf(c_0_8,axiom,
c_Lambda_Osubst(c_Lambda_OdB_OAbs(X1),X2,X3) = c_Lambda_OdB_OAbs(c_Lambda_Osubst(X1,c_Lambda_Olift(X2,c_HOL_Ozero__class_Ozero(tc_nat)),c_HOL_Oplus__class_Oplus(X3,c_HOL_Oone__class_Oone(tc_nat),tc_nat))),
cls_subst__Abs_0 ).
cnf(c_0_9,axiom,
c_Suc(X1) = c_HOL_Oplus__class_Oplus(X1,c_HOL_Oone__class_Oone(tc_nat),tc_nat),
cls_Suc__eq__plus1_0 ).
cnf(c_0_10,plain,
( c_InductTermi_OIT(c_Lambda_OdB_OAbs(X1))
| ~ c_InductTermi_OIT(X1) ),
c_0_7 ).
cnf(c_0_11,plain,
c_Lambda_OdB_OAbs(c_Lambda_Osubst(X1,c_Lambda_Olift(X2,c_HOL_Ozero__class_Ozero(tc_nat)),c_Suc(X3))) = c_Lambda_Osubst(c_Lambda_OdB_OAbs(X1),X2,X3),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
( c_Lambda_Olift(c_Lambda_OdB_OVar(X1),X2) = c_Lambda_OdB_OVar(c_HOL_Oplus__class_Oplus(X1,c_HOL_Oone__class_Oone(tc_nat),tc_nat))
| c_HOL_Oord__class_Oless(X1,X2,tc_nat) ),
cls_lift_Osimps_I1_J_1 ).
cnf(c_0_13,plain,
~ c_HOL_Oord__class_Oless(X1,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat),
inference(fof_simplification,[status(thm)],[cls_gr__implies__not0_0]) ).
cnf(c_0_14,plain,
( c_InductTermi_OIT(c_Lambda_Osubst(c_Lambda_OdB_OAbs(X1),X2,X3))
| ~ c_InductTermi_OIT(c_Lambda_Osubst(X1,c_Lambda_Olift(X2,c_HOL_Ozero__class_Ozero(tc_nat)),c_Suc(X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( c_Lambda_Olift(c_Lambda_OdB_OVar(X1),X2) = c_Lambda_OdB_OVar(c_Suc(X1))
| c_HOL_Oord__class_Oless(X1,X2,tc_nat) ),
inference(rw,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,plain,
~ c_HOL_Oord__class_Oless(X1,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
~ c_InductTermi_OIT(c_Lambda_Osubst(c_Lambda_OdB_OAbs(v_ra),c_Lambda_OdB_OVar(v_ia),v_ja)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_18,plain,
( c_InductTermi_OIT(c_Lambda_Osubst(c_Lambda_OdB_OAbs(X1),c_Lambda_OdB_OVar(X2),X3))
| ~ c_InductTermi_OIT(c_Lambda_Osubst(X1,c_Lambda_OdB_OVar(c_Suc(X2)),c_Suc(X3))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
c_InductTermi_OIT(c_Lambda_Osubst(v_ra,c_Lambda_OdB_OVar(X1),X2)),
cls_conjecture_1 ).
cnf(c_0_20,negated_conjecture,
~ c_InductTermi_OIT(c_Lambda_Osubst(c_Lambda_OdB_OAbs(v_ra),c_Lambda_OdB_OVar(v_ia),v_ja)),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
c_InductTermi_OIT(c_Lambda_Osubst(c_Lambda_OdB_OAbs(v_ra),c_Lambda_OdB_OVar(X1),X2)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL753-1 : TPTP v8.2.0. Released v4.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n026.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 03:00:22 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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/benchmark/theBenchmark.p
% 1.98/0.72 # Version: 3.1.0
% 1.98/0.72 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.98/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.98/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.98/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.98/0.72 # Starting sh5l with 300s (1) cores
% 1.98/0.72 # new_bool_1 with pid 32301 completed with status 0
% 1.98/0.72 # Result found by new_bool_1
% 1.98/0.72 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.98/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.98/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.98/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.98/0.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.98/0.72 # Search class: FGHSM-FSLM31-MFFFFFNN
% 1.98/0.72 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.98/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 1.98/0.72 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 32304 completed with status 0
% 1.98/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 1.98/0.72 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.98/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/0.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.98/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.98/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.98/0.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.98/0.72 # Search class: FGHSM-FSLM31-MFFFFFNN
% 1.98/0.72 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.98/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 1.98/0.72 # Preprocessing time : 0.003 s
% 1.98/0.72 # Presaturation interreduction done
% 1.98/0.72
% 1.98/0.72 # Proof found!
% 1.98/0.72 # SZS status Unsatisfiable
% 1.98/0.72 # SZS output start CNFRefutation
% See solution above
% 1.98/0.72 # Parsed axioms : 718
% 1.98/0.72 # Removed by relevancy pruning/SinE : 491
% 1.98/0.72 # Initial clauses : 227
% 1.98/0.72 # Removed in clause preprocessing : 0
% 1.98/0.72 # Initial clauses in saturation : 227
% 1.98/0.72 # Processed clauses : 4456
% 1.98/0.72 # ...of these trivial : 117
% 1.98/0.72 # ...subsumed : 3447
% 1.98/0.72 # ...remaining for further processing : 892
% 1.98/0.72 # Other redundant clauses eliminated : 69
% 1.98/0.72 # Clauses deleted for lack of memory : 0
% 1.98/0.72 # Backward-subsumed : 2
% 1.98/0.72 # Backward-rewritten : 10
% 1.98/0.72 # Generated clauses : 18362
% 1.98/0.72 # ...of the previous two non-redundant : 15587
% 1.98/0.72 # ...aggressively subsumed : 0
% 1.98/0.72 # Contextual simplify-reflections : 1
% 1.98/0.72 # Paramodulations : 18274
% 1.98/0.72 # Factorizations : 4
% 1.98/0.72 # NegExts : 0
% 1.98/0.72 # Equation resolutions : 84
% 1.98/0.72 # Disequality decompositions : 0
% 1.98/0.72 # Total rewrite steps : 11546
% 1.98/0.72 # ...of those cached : 9827
% 1.98/0.72 # Propositional unsat checks : 0
% 1.98/0.72 # Propositional check models : 0
% 1.98/0.72 # Propositional check unsatisfiable : 0
% 1.98/0.72 # Propositional clauses : 0
% 1.98/0.72 # Propositional clauses after purity: 0
% 1.98/0.72 # Propositional unsat core size : 0
% 1.98/0.72 # Propositional preprocessing time : 0.000
% 1.98/0.72 # Propositional encoding time : 0.000
% 1.98/0.72 # Propositional solver time : 0.000
% 1.98/0.72 # Success case prop preproc time : 0.000
% 1.98/0.72 # Success case prop encoding time : 0.000
% 1.98/0.72 # Success case prop solver time : 0.000
% 1.98/0.72 # Current number of processed clauses : 714
% 1.98/0.72 # Positive orientable unit clauses : 219
% 1.98/0.72 # Positive unorientable unit clauses: 7
% 1.98/0.72 # Negative unit clauses : 191
% 1.98/0.72 # Non-unit-clauses : 297
% 1.98/0.72 # Current number of unprocessed clauses: 11518
% 1.98/0.72 # ...number of literals in the above : 18030
% 1.98/0.72 # Current number of archived formulas : 0
% 1.98/0.72 # Current number of archived clauses : 178
% 1.98/0.72 # Clause-clause subsumption calls (NU) : 22319
% 1.98/0.72 # Rec. Clause-clause subsumption calls : 13768
% 1.98/0.72 # Non-unit clause-clause subsumptions : 1018
% 1.98/0.72 # Unit Clause-clause subsumption calls : 5544
% 1.98/0.72 # Rewrite failures with RHS unbound : 0
% 1.98/0.72 # BW rewrite match attempts : 754
% 1.98/0.72 # BW rewrite match successes : 118
% 1.98/0.72 # Condensation attempts : 0
% 1.98/0.72 # Condensation successes : 0
% 1.98/0.72 # Termbank termtop insertions : 245281
% 1.98/0.72 # Search garbage collected termcells : 2054
% 1.98/0.72
% 1.98/0.72 # -------------------------------------------------
% 1.98/0.72 # User time : 0.257 s
% 1.98/0.72 # System time : 0.012 s
% 1.98/0.72 # Total time : 0.269 s
% 1.98/0.72 # Maximum resident set size: 2468 pages
% 1.98/0.72
% 1.98/0.72 # -------------------------------------------------
% 1.98/0.72 # User time : 0.269 s
% 1.98/0.72 # System time : 0.013 s
% 1.98/0.72 # Total time : 0.282 s
% 1.98/0.72 # Maximum resident set size: 2168 pages
% 1.98/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------