TSTP Solution File: SET791+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET791+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:12 EDT 2022
% Result : Theorem 7.54s 2.34s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 9 unt; 4 nHn; 23 RR)
% Number of literals : 70 ( 5 equ; 42 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 50 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( apply(X1,X2,X3)
| ~ member(X2,X4)
| ~ greatest(X3,X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_3) ).
cnf(i_0_37,negated_conjecture,
greatest(esk10_0,esk8_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_37) ).
cnf(i_0_109,plain,
( X1 = X2
| ~ member(X2,X3)
| ~ member(X1,X3)
| ~ epred1_2(X4,X3)
| ~ apply(X4,X2,X1)
| ~ apply(X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_109) ).
cnf(i_0_25,plain,
( max(X1,X2,X3)
| apply(X2,X1,esk6_3(X2,X3,X1))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_25) ).
cnf(i_0_24,plain,
( max(X1,X2,X3)
| esk6_3(X2,X3,X1) != X1
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_24) ).
cnf(i_0_4,plain,
( member(X1,X2)
| ~ greatest(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_4) ).
cnf(i_0_26,plain,
( max(X1,X2,X3)
| member(esk6_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_26) ).
cnf(i_0_36,negated_conjecture,
~ max(esk10_0,esk8_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_36) ).
cnf(i_0_35,plain,
( epred1_2(X1,X2)
| ~ order(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_35) ).
cnf(i_0_38,negated_conjecture,
order(esk8_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9exoia4/input.p',i_0_38) ).
cnf(c_0_120,plain,
( apply(X1,X2,X3)
| ~ member(X2,X4)
| ~ greatest(X3,X1,X4) ),
i_0_3 ).
cnf(c_0_121,negated_conjecture,
greatest(esk10_0,esk8_0,esk9_0),
i_0_37 ).
cnf(c_0_122,plain,
( X1 = X2
| ~ member(X2,X3)
| ~ member(X1,X3)
| ~ epred1_2(X4,X3)
| ~ apply(X4,X2,X1)
| ~ apply(X4,X1,X2) ),
i_0_109 ).
cnf(c_0_123,negated_conjecture,
( apply(esk8_0,X1,esk10_0)
| ~ member(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_124,plain,
( esk10_0 = X1
| ~ apply(esk8_0,esk10_0,X1)
| ~ member(esk10_0,X2)
| ~ member(X1,esk9_0)
| ~ member(X1,X2)
| ~ epred1_2(esk8_0,X2) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_125,plain,
( max(X1,X2,X3)
| apply(X2,X1,esk6_3(X2,X3,X1))
| ~ member(X1,X3) ),
i_0_25 ).
cnf(c_0_126,plain,
( max(X1,X2,X3)
| esk6_3(X2,X3,X1) != X1
| ~ member(X1,X3) ),
i_0_24 ).
cnf(c_0_127,plain,
( member(X1,X2)
| ~ greatest(X1,X3,X2) ),
i_0_4 ).
cnf(c_0_128,plain,
( max(esk10_0,esk8_0,X1)
| ~ member(esk6_3(esk8_0,X1,esk10_0),esk9_0)
| ~ member(esk6_3(esk8_0,X1,esk10_0),X2)
| ~ member(esk10_0,X2)
| ~ member(esk10_0,X1)
| ~ epred1_2(esk8_0,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]) ).
cnf(c_0_129,plain,
( max(X1,X2,X3)
| member(esk6_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
i_0_26 ).
cnf(c_0_130,negated_conjecture,
member(esk10_0,esk9_0),
inference(spm,[status(thm)],[c_0_127,c_0_121]) ).
cnf(c_0_131,negated_conjecture,
~ max(esk10_0,esk8_0,esk9_0),
i_0_36 ).
cnf(c_0_132,plain,
( epred1_2(X1,X2)
| ~ order(X1,X2) ),
i_0_35 ).
cnf(c_0_133,negated_conjecture,
order(esk8_0,esk9_0),
i_0_38 ).
cnf(c_0_134,plain,
( ~ member(esk6_3(esk8_0,esk9_0,esk10_0),X1)
| ~ member(esk10_0,X1)
| ~ epred1_2(esk8_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_130])]),c_0_131]) ).
cnf(c_0_135,negated_conjecture,
epred1_2(esk8_0,esk9_0),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_136,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_129]),c_0_130]),c_0_135])]),c_0_131]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET791+4 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 11:57:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.54/2.34 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.54/2.34 # Version: 2.1pre011
% 7.54/2.34 # Preprocessing time : 0.020 s
% 7.54/2.34
% 7.54/2.34 # Proof found!
% 7.54/2.34 # SZS status Theorem
% 7.54/2.34 # SZS output start CNFRefutation
% See solution above
% 7.54/2.34 # Proof object total steps : 27
% 7.54/2.34 # Proof object clause steps : 17
% 7.54/2.34 # Proof object formula steps : 10
% 7.54/2.34 # Proof object conjectures : 9
% 7.54/2.34 # Proof object clause conjectures : 6
% 7.54/2.34 # Proof object formula conjectures : 3
% 7.54/2.34 # Proof object initial clauses used : 10
% 7.54/2.34 # Proof object initial formulas used : 10
% 7.54/2.34 # Proof object generating inferences : 7
% 7.54/2.34 # Proof object simplifying inferences : 8
% 7.54/2.34 # Training examples: 0 positive, 0 negative
% 7.54/2.34 # Parsed axioms : 110
% 7.54/2.34 # Removed by relevancy pruning/SinE : 0
% 7.54/2.34 # Initial clauses : 110
% 7.54/2.34 # Removed in clause preprocessing : 0
% 7.54/2.34 # Initial clauses in saturation : 110
% 7.54/2.34 # Processed clauses : 125
% 7.54/2.34 # ...of these trivial : 0
% 7.54/2.34 # ...subsumed : 0
% 7.54/2.34 # ...remaining for further processing : 125
% 7.54/2.34 # Other redundant clauses eliminated : 0
% 7.54/2.34 # Clauses deleted for lack of memory : 0
% 7.54/2.34 # Backward-subsumed : 0
% 7.54/2.34 # Backward-rewritten : 0
% 7.54/2.34 # Generated clauses : 164
% 7.54/2.34 # ...of the previous two non-trivial : 157
% 7.54/2.34 # Contextual simplify-reflections : 2
% 7.54/2.34 # Paramodulations : 164
% 7.54/2.34 # Factorizations : 0
% 7.54/2.34 # Equation resolutions : 0
% 7.54/2.34 # Propositional unsat checks : 0
% 7.54/2.34 # Propositional unsat check successes : 0
% 7.54/2.34 # Current number of processed clauses : 125
% 7.54/2.34 # Positive orientable unit clauses : 5
% 7.54/2.34 # Positive unorientable unit clauses: 0
% 7.54/2.34 # Negative unit clauses : 1
% 7.54/2.34 # Non-unit-clauses : 119
% 7.54/2.34 # Current number of unprocessed clauses: 142
% 7.54/2.34 # ...number of literals in the above : 993
% 7.54/2.34 # Current number of archived formulas : 0
% 7.54/2.34 # Current number of archived clauses : 0
% 7.54/2.34 # Clause-clause subsumption calls (NU) : 4206
% 7.54/2.34 # Rec. Clause-clause subsumption calls : 1843
% 7.54/2.34 # Non-unit clause-clause subsumptions : 2
% 7.54/2.34 # Unit Clause-clause subsumption calls : 115
% 7.54/2.34 # Rewrite failures with RHS unbound : 0
% 7.54/2.34 # BW rewrite match attempts : 0
% 7.54/2.34 # BW rewrite match successes : 0
% 7.54/2.34 # Condensation attempts : 0
% 7.54/2.34 # Condensation successes : 0
% 7.54/2.34 # Termbank termtop insertions : 7561
% 7.54/2.34
% 7.54/2.34 # -------------------------------------------------
% 7.54/2.34 # User time : 0.027 s
% 7.54/2.34 # System time : 0.004 s
% 7.54/2.34 # Total time : 0.031 s
% 7.54/2.34 # ...preprocessing : 0.020 s
% 7.54/2.34 # ...main loop : 0.011 s
% 7.54/2.34 # Maximum resident set size: 7136 pages
% 7.54/2.34
%------------------------------------------------------------------------------