TSTP Solution File: SET789+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET789+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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 : Tue Jul 19 00:14:11 EDT 2022
% Result : Theorem 8.63s 2.38s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 12 unt; 0 nHn; 24 RR)
% Number of literals : 51 ( 5 equ; 30 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( apply(X1,X2,X3)
| ~ member(X2,X4)
| ~ greatest(X3,X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc0f114c/input.p',i_0_3) ).
cnf(i_0_37,negated_conjecture,
greatest(esk11_0,esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc0f114c/input.p',i_0_37) ).
cnf(i_0_110,plain,
( X1 = X2
| ~ member(X2,X3)
| ~ member(X1,X3)
| ~ epred1_2(X4,X3)
| ~ apply(X4,X2,X1)
| ~ apply(X4,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc0f114c/input.p',i_0_110) ).
cnf(i_0_38,negated_conjecture,
greatest(esk10_0,esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc0f114c/input.p',i_0_38) ).
cnf(i_0_4,plain,
( member(X1,X2)
| ~ greatest(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc0f114c/input.p',i_0_4) ).
cnf(i_0_36,negated_conjecture,
esk11_0 != esk10_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc0f114c/input.p',i_0_36) ).
cnf(i_0_35,plain,
( epred1_2(X1,X2)
| ~ order(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc0f114c/input.p',i_0_35) ).
cnf(i_0_39,negated_conjecture,
order(esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc0f114c/input.p',i_0_39) ).
cnf(c_0_119,plain,
( apply(X1,X2,X3)
| ~ member(X2,X4)
| ~ greatest(X3,X1,X4) ),
i_0_3 ).
cnf(c_0_120,negated_conjecture,
greatest(esk11_0,esk8_0,esk9_0),
i_0_37 ).
cnf(c_0_121,plain,
( X1 = X2
| ~ member(X2,X3)
| ~ member(X1,X3)
| ~ epred1_2(X4,X3)
| ~ apply(X4,X2,X1)
| ~ apply(X4,X1,X2) ),
i_0_110 ).
cnf(c_0_122,negated_conjecture,
( apply(esk8_0,X1,esk11_0)
| ~ member(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_123,negated_conjecture,
greatest(esk10_0,esk8_0,esk9_0),
i_0_38 ).
cnf(c_0_124,plain,
( member(X1,X2)
| ~ greatest(X1,X3,X2) ),
i_0_4 ).
cnf(c_0_125,plain,
( esk11_0 = X1
| ~ apply(esk8_0,esk11_0,X1)
| ~ member(esk11_0,X2)
| ~ member(X1,esk9_0)
| ~ member(X1,X2)
| ~ epred1_2(esk8_0,X2) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_126,negated_conjecture,
( apply(esk8_0,X1,esk10_0)
| ~ member(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_119,c_0_123]) ).
cnf(c_0_127,negated_conjecture,
member(esk10_0,esk9_0),
inference(spm,[status(thm)],[c_0_124,c_0_123]) ).
cnf(c_0_128,negated_conjecture,
member(esk11_0,esk9_0),
inference(spm,[status(thm)],[c_0_124,c_0_120]) ).
cnf(c_0_129,negated_conjecture,
esk11_0 != esk10_0,
i_0_36 ).
cnf(c_0_130,plain,
( epred1_2(X1,X2)
| ~ order(X1,X2) ),
i_0_35 ).
cnf(c_0_131,negated_conjecture,
order(esk8_0,esk9_0),
i_0_39 ).
cnf(c_0_132,negated_conjecture,
( ~ member(esk11_0,X1)
| ~ member(esk10_0,X1)
| ~ epred1_2(esk8_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]),c_0_128])]),c_0_129]) ).
cnf(c_0_133,negated_conjecture,
epred1_2(esk8_0,esk9_0),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_134,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_128]),c_0_127])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET789+4 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 04:45:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.63/2.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.63/2.38 # Version: 2.1pre011
% 8.63/2.38 # Preprocessing time : 0.014 s
% 8.63/2.38
% 8.63/2.38 # Proof found!
% 8.63/2.38 # SZS status Theorem
% 8.63/2.38 # SZS output start CNFRefutation
% See solution above
% 8.63/2.38 # Proof object total steps : 24
% 8.63/2.38 # Proof object clause steps : 16
% 8.63/2.38 # Proof object formula steps : 8
% 8.63/2.38 # Proof object conjectures : 15
% 8.63/2.38 # Proof object clause conjectures : 11
% 8.63/2.38 # Proof object formula conjectures : 4
% 8.63/2.38 # Proof object initial clauses used : 8
% 8.63/2.38 # Proof object initial formulas used : 8
% 8.63/2.38 # Proof object generating inferences : 8
% 8.63/2.38 # Proof object simplifying inferences : 7
% 8.63/2.38 # Training examples: 0 positive, 0 negative
% 8.63/2.38 # Parsed axioms : 111
% 8.63/2.38 # Removed by relevancy pruning/SinE : 0
% 8.63/2.38 # Initial clauses : 111
% 8.63/2.38 # Removed in clause preprocessing : 0
% 8.63/2.38 # Initial clauses in saturation : 111
% 8.63/2.38 # Processed clauses : 125
% 8.63/2.38 # ...of these trivial : 0
% 8.63/2.38 # ...subsumed : 0
% 8.63/2.38 # ...remaining for further processing : 125
% 8.63/2.38 # Other redundant clauses eliminated : 0
% 8.63/2.38 # Clauses deleted for lack of memory : 0
% 8.63/2.38 # Backward-subsumed : 0
% 8.63/2.38 # Backward-rewritten : 0
% 8.63/2.38 # Generated clauses : 137
% 8.63/2.38 # ...of the previous two non-trivial : 131
% 8.63/2.38 # Contextual simplify-reflections : 0
% 8.63/2.38 # Paramodulations : 137
% 8.63/2.38 # Factorizations : 0
% 8.63/2.38 # Equation resolutions : 0
% 8.63/2.38 # Propositional unsat checks : 0
% 8.63/2.38 # Propositional unsat check successes : 0
% 8.63/2.38 # Current number of processed clauses : 125
% 8.63/2.38 # Positive orientable unit clauses : 7
% 8.63/2.38 # Positive unorientable unit clauses: 0
% 8.63/2.38 # Negative unit clauses : 1
% 8.63/2.38 # Non-unit-clauses : 117
% 8.63/2.38 # Current number of unprocessed clauses: 117
% 8.63/2.38 # ...number of literals in the above : 827
% 8.63/2.38 # Current number of archived formulas : 0
% 8.63/2.38 # Current number of archived clauses : 0
% 8.63/2.38 # Clause-clause subsumption calls (NU) : 4269
% 8.63/2.38 # Rec. Clause-clause subsumption calls : 1889
% 8.63/2.38 # Non-unit clause-clause subsumptions : 0
% 8.63/2.38 # Unit Clause-clause subsumption calls : 128
% 8.63/2.38 # Rewrite failures with RHS unbound : 0
% 8.63/2.38 # BW rewrite match attempts : 0
% 8.63/2.38 # BW rewrite match successes : 0
% 8.63/2.38 # Condensation attempts : 0
% 8.63/2.38 # Condensation successes : 0
% 8.63/2.38 # Termbank termtop insertions : 7054
% 8.63/2.38
% 8.63/2.38 # -------------------------------------------------
% 8.63/2.38 # User time : 0.016 s
% 8.63/2.38 # System time : 0.004 s
% 8.63/2.38 # Total time : 0.021 s
% 8.63/2.38 # ...preprocessing : 0.014 s
% 8.63/2.38 # ...main loop : 0.006 s
% 8.63/2.38 # Maximum resident set size: 7128 pages
% 8.63/2.38
%------------------------------------------------------------------------------