TSTP Solution File: SWV372+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV372+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:00 EDT 2022
% Result : Theorem 7.26s 2.37s
% Output : CNFRefutation 7.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 11 unt; 6 nHn; 16 RR)
% Number of literals : 42 ( 14 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 51 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,plain,
~ ok(triple(X1,X2,bad)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_40) ).
cnf(i_0_86,lemma,
( ok(triple(X1,X2,X3))
| ~ phi(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_86) ).
cnf(i_0_47,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_47) ).
cnf(i_0_81,negated_conjecture,
~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_81) ).
cnf(i_0_51,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_51) ).
cnf(i_0_85,lemma,
( contains_pq(i(triple(X1,X2,X3)),X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_85) ).
cnf(i_0_38,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_38) ).
cnf(i_0_82,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_82) ).
cnf(i_0_46,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qyq0un7/input.p',i_0_46) ).
cnf(c_0_96,plain,
~ ok(triple(X1,X2,bad)),
i_0_40 ).
cnf(c_0_97,lemma,
( ok(triple(X1,X2,X3))
| ~ phi(triple(X1,X2,X3)) ),
i_0_86 ).
cnf(c_0_98,plain,
~ phi(triple(X1,X2,bad)),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_99,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2)) ),
i_0_47 ).
cnf(c_0_100,negated_conjecture,
~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
i_0_81 ).
cnf(c_0_101,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
i_0_51 ).
cnf(c_0_102,lemma,
( contains_pq(i(triple(X1,X2,X3)),X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
i_0_85 ).
cnf(c_0_103,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
i_0_38 ).
cnf(c_0_104,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| ~ phi(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_105,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
i_0_82 ).
cnf(c_0_106,negated_conjecture,
( esk6_0 = create_slb
| ~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_107,lemma,
( contains_pq(i(triple(X1,X2,X3)),X4)
| ~ contains_slb(X2,X4) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,negated_conjecture,
( esk6_0 = create_slb
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_109,negated_conjecture,
esk6_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]) ).
cnf(c_0_110,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
i_0_46 ).
cnf(c_0_111,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_109]),c_0_110]),c_0_98]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV372+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Tue Jun 14 15:10:11 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.26/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.26/2.37 # Version: 2.1pre011
% 7.26/2.37 # Preprocessing time : 0.012 s
% 7.26/2.37
% 7.26/2.37 # Proof found!
% 7.26/2.37 # SZS status Theorem
% 7.26/2.37 # SZS output start CNFRefutation
% See solution above
% 7.26/2.37 # Proof object total steps : 25
% 7.26/2.37 # Proof object clause steps : 16
% 7.26/2.37 # Proof object formula steps : 9
% 7.26/2.37 # Proof object conjectures : 8
% 7.26/2.37 # Proof object clause conjectures : 6
% 7.26/2.37 # Proof object formula conjectures : 2
% 7.26/2.37 # Proof object initial clauses used : 9
% 7.26/2.37 # Proof object initial formulas used : 9
% 7.26/2.37 # Proof object generating inferences : 6
% 7.26/2.37 # Proof object simplifying inferences : 4
% 7.26/2.37 # Training examples: 0 positive, 0 negative
% 7.26/2.37 # Parsed axioms : 90
% 7.26/2.37 # Removed by relevancy pruning/SinE : 0
% 7.26/2.37 # Initial clauses : 90
% 7.26/2.37 # Removed in clause preprocessing : 0
% 7.26/2.37 # Initial clauses in saturation : 90
% 7.26/2.37 # Processed clauses : 111
% 7.26/2.37 # ...of these trivial : 0
% 7.26/2.37 # ...subsumed : 2
% 7.26/2.37 # ...remaining for further processing : 109
% 7.26/2.37 # Other redundant clauses eliminated : 4
% 7.26/2.37 # Clauses deleted for lack of memory : 0
% 7.26/2.37 # Backward-subsumed : 0
% 7.26/2.37 # Backward-rewritten : 4
% 7.26/2.37 # Generated clauses : 238
% 7.26/2.37 # ...of the previous two non-trivial : 209
% 7.26/2.37 # Contextual simplify-reflections : 3
% 7.26/2.37 # Paramodulations : 233
% 7.26/2.37 # Factorizations : 2
% 7.26/2.37 # Equation resolutions : 4
% 7.26/2.37 # Propositional unsat checks : 0
% 7.26/2.37 # Propositional unsat check successes : 0
% 7.26/2.37 # Current number of processed clauses : 102
% 7.26/2.37 # Positive orientable unit clauses : 19
% 7.26/2.37 # Positive unorientable unit clauses: 2
% 7.26/2.37 # Negative unit clauses : 9
% 7.26/2.37 # Non-unit-clauses : 72
% 7.26/2.37 # Current number of unprocessed clauses: 184
% 7.26/2.37 # ...number of literals in the above : 531
% 7.26/2.37 # Current number of archived formulas : 0
% 7.26/2.37 # Current number of archived clauses : 4
% 7.26/2.37 # Clause-clause subsumption calls (NU) : 552
% 7.26/2.37 # Rec. Clause-clause subsumption calls : 440
% 7.26/2.37 # Non-unit clause-clause subsumptions : 4
% 7.26/2.37 # Unit Clause-clause subsumption calls : 183
% 7.26/2.37 # Rewrite failures with RHS unbound : 0
% 7.26/2.37 # BW rewrite match attempts : 5
% 7.26/2.37 # BW rewrite match successes : 1
% 7.26/2.37 # Condensation attempts : 0
% 7.26/2.37 # Condensation successes : 0
% 7.26/2.37 # Termbank termtop insertions : 4706
% 7.26/2.37
% 7.26/2.37 # -------------------------------------------------
% 7.26/2.37 # User time : 0.014 s
% 7.26/2.37 # System time : 0.005 s
% 7.26/2.37 # Total time : 0.019 s
% 7.26/2.37 # ...preprocessing : 0.012 s
% 7.26/2.37 # ...main loop : 0.007 s
% 7.26/2.37 # Maximum resident set size: 7140 pages
% 7.26/2.37
%------------------------------------------------------------------------------