TSTP Solution File: SWV408+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV408+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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 : 600s
% DateTime : Wed Jul 20 17:47:08 EDT 2022
% Result : Theorem 8.60s 2.55s
% Output : CNFRefutation 8.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 14 unt; 6 nHn; 19 RR)
% Number of literals : 44 ( 7 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 30 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_45,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk1_0),X1)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_45) ).
cnf(i_0_50,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| pair_in_list(update_slb(X1,X2),X3,esk5_3(X1,X3,X2))
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_50) ).
cnf(i_0_48,negated_conjecture,
contains_slb(esk2_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_48) ).
cnf(i_0_46,negated_conjecture,
~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_46) ).
cnf(i_0_49,lemma,
( less_than(X1,esk5_3(X2,X3,X1))
| pair_in_list(update_slb(X2,X1),X3,X1)
| ~ contains_slb(X2,X3)
| ~ strictly_less_than(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_49) ).
cnf(i_0_53,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_53) ).
cnf(i_0_47,negated_conjecture,
strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_47) ).
cnf(i_0_41,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_41) ).
cnf(i_0_40,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_40) ).
cnf(i_0_44,plain,
less_than(bottom,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4g6teri/input.p',i_0_44) ).
cnf(c_0_64,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk1_0),X1)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1) ),
i_0_45 ).
cnf(c_0_65,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| pair_in_list(update_slb(X1,X2),X3,esk5_3(X1,X3,X2))
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,X2) ),
i_0_50 ).
cnf(c_0_66,negated_conjecture,
contains_slb(esk2_0,esk4_0),
i_0_48 ).
cnf(c_0_67,negated_conjecture,
~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0)),
i_0_46 ).
cnf(c_0_68,negated_conjecture,
( ~ strictly_less_than(esk4_0,findmin_pqp_res(esk1_0))
| ~ less_than(findmin_pqp_res(esk1_0),esk5_3(esk2_0,esk4_0,findmin_pqp_res(esk1_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),c_0_67]) ).
cnf(c_0_69,lemma,
( less_than(X1,esk5_3(X2,X3,X1))
| pair_in_list(update_slb(X2,X1),X3,X1)
| ~ contains_slb(X2,X3)
| ~ strictly_less_than(X3,X1) ),
i_0_49 ).
cnf(c_0_70,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
i_0_53 ).
cnf(c_0_71,negated_conjecture,
strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
i_0_47 ).
cnf(c_0_72,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
i_0_41 ).
cnf(c_0_73,lemma,
~ strictly_less_than(esk4_0,findmin_pqp_res(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_66])]),c_0_67]) ).
cnf(c_0_74,negated_conjecture,
~ less_than(findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)),esk4_0),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
esk2_0 = create_slb,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_76,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
i_0_40 ).
cnf(c_0_77,plain,
less_than(bottom,X1),
i_0_44 ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV408+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 23:34:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.60/2.55 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.60/2.55 # Version: 2.1pre011
% 8.60/2.55 # Preprocessing time : 0.019 s
% 8.60/2.55
% 8.60/2.55 # Proof found!
% 8.60/2.55 # SZS status Theorem
% 8.60/2.55 # SZS output start CNFRefutation
% See solution above
% 8.60/2.55 # Proof object total steps : 25
% 8.60/2.55 # Proof object clause steps : 15
% 8.60/2.55 # Proof object formula steps : 10
% 8.60/2.55 # Proof object conjectures : 12
% 8.60/2.55 # Proof object clause conjectures : 8
% 8.60/2.55 # Proof object formula conjectures : 4
% 8.60/2.55 # Proof object initial clauses used : 10
% 8.60/2.55 # Proof object initial formulas used : 10
% 8.60/2.55 # Proof object generating inferences : 4
% 8.60/2.55 # Proof object simplifying inferences : 11
% 8.60/2.55 # Training examples: 0 positive, 0 negative
% 8.60/2.55 # Parsed axioms : 54
% 8.60/2.55 # Removed by relevancy pruning/SinE : 0
% 8.60/2.55 # Initial clauses : 54
% 8.60/2.55 # Removed in clause preprocessing : 0
% 8.60/2.55 # Initial clauses in saturation : 54
% 8.60/2.55 # Processed clauses : 63
% 8.60/2.55 # ...of these trivial : 0
% 8.60/2.55 # ...subsumed : 2
% 8.60/2.55 # ...remaining for further processing : 61
% 8.60/2.55 # Other redundant clauses eliminated : 3
% 8.60/2.55 # Clauses deleted for lack of memory : 0
% 8.60/2.55 # Backward-subsumed : 0
% 8.60/2.55 # Backward-rewritten : 7
% 8.60/2.55 # Generated clauses : 110
% 8.60/2.55 # ...of the previous two non-trivial : 97
% 8.60/2.55 # Contextual simplify-reflections : 2
% 8.60/2.55 # Paramodulations : 106
% 8.60/2.55 # Factorizations : 2
% 8.60/2.55 # Equation resolutions : 3
% 8.60/2.55 # Propositional unsat checks : 0
% 8.60/2.55 # Propositional unsat check successes : 0
% 8.60/2.55 # Current number of processed clauses : 52
% 8.60/2.55 # Positive orientable unit clauses : 13
% 8.60/2.55 # Positive unorientable unit clauses: 0
% 8.60/2.55 # Negative unit clauses : 5
% 8.60/2.55 # Non-unit-clauses : 34
% 8.60/2.55 # Current number of unprocessed clauses: 82
% 8.60/2.55 # ...number of literals in the above : 272
% 8.60/2.55 # Current number of archived formulas : 0
% 8.60/2.55 # Current number of archived clauses : 7
% 8.60/2.55 # Clause-clause subsumption calls (NU) : 202
% 8.60/2.55 # Rec. Clause-clause subsumption calls : 117
% 8.60/2.55 # Non-unit clause-clause subsumptions : 3
% 8.60/2.55 # Unit Clause-clause subsumption calls : 19
% 8.60/2.55 # Rewrite failures with RHS unbound : 0
% 8.60/2.55 # BW rewrite match attempts : 2
% 8.60/2.55 # BW rewrite match successes : 1
% 8.60/2.55 # Condensation attempts : 0
% 8.60/2.55 # Condensation successes : 0
% 8.60/2.55 # Termbank termtop insertions : 2598
% 8.60/2.55
% 8.60/2.55 # -------------------------------------------------
% 8.60/2.55 # User time : 0.016 s
% 8.60/2.55 # System time : 0.007 s
% 8.60/2.55 # Total time : 0.023 s
% 8.60/2.55 # ...preprocessing : 0.019 s
% 8.60/2.55 # ...main loop : 0.004 s
% 8.60/2.55 # Maximum resident set size: 7128 pages
% 8.60/2.55
%------------------------------------------------------------------------------