TSTP Solution File: SET097+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET097+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:09:25 EDT 2022
% Result : Theorem 11.52s 2.82s
% Output : CNFRefutation 11.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 10 unt; 15 nHn; 30 RR)
% Number of literals : 101 ( 29 equ; 47 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_53,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(X2,intersection(complement(unordered_pair(X1,X1)),esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_53) ).
cnf(i_0_48,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_48) ).
cnf(i_0_74,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_74) ).
cnf(i_0_4,plain,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_4) ).
cnf(i_0_5,plain,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_5) ).
cnf(i_0_91,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_91) ).
cnf(i_0_63,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_63) ).
cnf(i_0_55,negated_conjecture,
esk5_0 != null_class,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_55) ).
cnf(i_0_73,plain,
( subclass(X1,X2)
| member(esk7_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_73) ).
cnf(i_0_72,plain,
( subclass(X1,X2)
| ~ member(esk7_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_72) ).
cnf(i_0_26,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_26) ).
cnf(i_0_54,negated_conjecture,
unordered_pair(X1,X1) != esk5_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_54) ).
cnf(i_0_90,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_90) ).
cnf(i_0_52,plain,
~ member(X1,null_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8k2zg40v/input.p',i_0_52) ).
cnf(c_0_106,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(X2,intersection(complement(unordered_pair(X1,X1)),esk5_0)) ),
i_0_53 ).
cnf(c_0_107,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
i_0_48 ).
cnf(c_0_108,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
i_0_74 ).
cnf(c_0_109,plain,
subclass(X1,universal_class),
i_0_4 ).
cnf(c_0_110,negated_conjecture,
( ~ member(X1,complement(unordered_pair(X2,X2)))
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_111,plain,
( member(X1,X2)
| member(X1,complement(X2))
| ~ member(X1,universal_class) ),
i_0_5 ).
cnf(c_0_112,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_113,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
i_0_91 ).
cnf(c_0_114,plain,
( member(X1,unordered_pair(X2,X2))
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]) ).
cnf(c_0_115,plain,
( X1 = X2
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_116,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
i_0_63 ).
cnf(c_0_117,negated_conjecture,
esk5_0 != null_class,
i_0_55 ).
cnf(c_0_118,plain,
( X1 = esk6_1(esk5_0)
| ~ member(X1,esk5_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117]) ).
cnf(c_0_119,plain,
( subclass(X1,X2)
| member(esk7_2(X1,X2),X1) ),
i_0_73 ).
cnf(c_0_120,plain,
( esk6_1(unordered_pair(X1,X2)) = X1
| esk6_1(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_113,c_0_116]) ).
cnf(c_0_121,plain,
( subclass(X1,X2)
| ~ member(esk7_2(X1,X2),X2) ),
i_0_72 ).
cnf(c_0_122,plain,
( esk7_2(esk5_0,X1) = esk6_1(esk5_0)
| subclass(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_123,plain,
( esk6_1(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_120])]) ).
cnf(c_0_124,plain,
( subclass(esk5_0,X1)
| ~ member(esk6_1(esk5_0),X1) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_125,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,unordered_pair(X1,X1)) ),
inference(spm,[status(thm)],[c_0_116,c_0_123]) ).
cnf(c_0_126,plain,
( esk7_2(unordered_pair(X1,X2),X3) = X1
| esk7_2(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_113,c_0_119]) ).
cnf(c_0_127,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
i_0_26 ).
cnf(c_0_128,plain,
( unordered_pair(esk6_1(esk5_0),esk6_1(esk5_0)) = null_class
| subclass(esk5_0,unordered_pair(esk6_1(esk5_0),esk6_1(esk5_0))) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_129,negated_conjecture,
unordered_pair(X1,X1) != esk5_0,
i_0_54 ).
cnf(c_0_130,plain,
( esk7_2(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_126])]) ).
cnf(c_0_131,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
i_0_90 ).
cnf(c_0_132,plain,
( unordered_pair(esk6_1(esk5_0),esk6_1(esk5_0)) = null_class
| ~ subclass(unordered_pair(esk6_1(esk5_0),esk6_1(esk5_0)),esk5_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]) ).
cnf(c_0_133,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_121,c_0_130]) ).
cnf(c_0_134,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_131]) ).
cnf(c_0_135,plain,
( unordered_pair(esk6_1(esk5_0),esk6_1(esk5_0)) = null_class
| ~ member(esk6_1(esk5_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_136,plain,
~ member(X1,null_class),
i_0_52 ).
cnf(c_0_137,plain,
~ member(esk6_1(esk5_0),esk5_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]),c_0_112]) ).
cnf(c_0_138,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_116]),c_0_117]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET097+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 20:25:24 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.46 # 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
% 11.52/2.82 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 11.52/2.82 # Version: 2.1pre011
% 11.52/2.82 # Preprocessing time : 0.019 s
% 11.52/2.82
% 11.52/2.82 # Proof found!
% 11.52/2.82 # SZS status Theorem
% 11.52/2.82 # SZS output start CNFRefutation
% See solution above
% 11.52/2.82 # Proof object total steps : 47
% 11.52/2.82 # Proof object clause steps : 33
% 11.52/2.82 # Proof object formula steps : 14
% 11.52/2.82 # Proof object conjectures : 7
% 11.52/2.82 # Proof object clause conjectures : 4
% 11.52/2.82 # Proof object formula conjectures : 3
% 11.52/2.82 # Proof object initial clauses used : 14
% 11.52/2.82 # Proof object initial formulas used : 14
% 11.52/2.82 # Proof object generating inferences : 18
% 11.52/2.82 # Proof object simplifying inferences : 9
% 11.52/2.82 # Training examples: 0 positive, 0 negative
% 11.52/2.82 # Parsed axioms : 84
% 11.52/2.82 # Removed by relevancy pruning/SinE : 0
% 11.52/2.82 # Initial clauses : 84
% 11.52/2.82 # Removed in clause preprocessing : 0
% 11.52/2.82 # Initial clauses in saturation : 84
% 11.52/2.82 # Processed clauses : 1708
% 11.52/2.82 # ...of these trivial : 12
% 11.52/2.82 # ...subsumed : 813
% 11.52/2.82 # ...remaining for further processing : 883
% 11.52/2.82 # Other redundant clauses eliminated : 25
% 11.52/2.82 # Clauses deleted for lack of memory : 0
% 11.52/2.82 # Backward-subsumed : 32
% 11.52/2.82 # Backward-rewritten : 27
% 11.52/2.82 # Generated clauses : 25169
% 11.52/2.82 # ...of the previous two non-trivial : 20524
% 11.52/2.82 # Contextual simplify-reflections : 348
% 11.52/2.82 # Paramodulations : 25092
% 11.52/2.82 # Factorizations : 43
% 11.52/2.82 # Equation resolutions : 27
% 11.52/2.82 # Propositional unsat checks : 0
% 11.52/2.82 # Propositional unsat check successes : 0
% 11.52/2.82 # Current number of processed clauses : 813
% 11.52/2.82 # Positive orientable unit clauses : 74
% 11.52/2.82 # Positive unorientable unit clauses: 0
% 11.52/2.82 # Negative unit clauses : 15
% 11.52/2.82 # Non-unit-clauses : 724
% 11.52/2.82 # Current number of unprocessed clauses: 18237
% 11.52/2.82 # ...number of literals in the above : 64084
% 11.52/2.82 # Current number of archived formulas : 0
% 11.52/2.82 # Current number of archived clauses : 66
% 11.52/2.82 # Clause-clause subsumption calls (NU) : 99123
% 11.52/2.82 # Rec. Clause-clause subsumption calls : 73856
% 11.52/2.82 # Non-unit clause-clause subsumptions : 822
% 11.52/2.82 # Unit Clause-clause subsumption calls : 4567
% 11.52/2.82 # Rewrite failures with RHS unbound : 0
% 11.52/2.82 # BW rewrite match attempts : 68
% 11.52/2.82 # BW rewrite match successes : 7
% 11.52/2.82 # Condensation attempts : 0
% 11.52/2.82 # Condensation successes : 0
% 11.52/2.82 # Termbank termtop insertions : 715094
% 11.52/2.82
% 11.52/2.82 # -------------------------------------------------
% 11.52/2.82 # User time : 0.488 s
% 11.52/2.82 # System time : 0.013 s
% 11.52/2.82 # Total time : 0.501 s
% 11.52/2.82 # ...preprocessing : 0.019 s
% 11.52/2.82 # ...main loop : 0.482 s
% 11.52/2.82 # Maximum resident set size: 26624 pages
% 11.52/2.82
%------------------------------------------------------------------------------