TSTP Solution File: SET090+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET090+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:17 EDT 2022
% Result : Theorem 8.43s 2.46s
% Output : CNFRefutation 8.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 15 unt; 5 nHn; 19 RR)
% Number of literals : 50 ( 24 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_90,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_90) ).
cnf(i_0_92,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_92) ).
cnf(i_0_71,plain,
( member_of(X1) = X1
| unordered_pair(member_of(X1),member_of(X1)) = X1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_71) ).
cnf(i_0_50,negated_conjecture,
unordered_pair(esk6_0,esk6_0) = esk5_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_50) ).
cnf(i_0_51,negated_conjecture,
member(esk6_0,universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_51) ).
cnf(i_0_49,negated_conjecture,
member_of(esk5_0) != esk6_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_49) ).
cnf(i_0_91,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_91) ).
cnf(i_0_52,plain,
( unordered_pair(member_of(unordered_pair(X1,X1)),member_of(unordered_pair(X1,X1))) = unordered_pair(X1,X1)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_52) ).
cnf(i_0_89,plain,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ltnjfpgh/input.p',i_0_89) ).
cnf(c_0_102,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
i_0_90 ).
cnf(c_0_103,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
i_0_92 ).
cnf(c_0_104,plain,
( member_of(X1) = X1
| unordered_pair(member_of(X1),member_of(X1)) = X1 ),
i_0_71 ).
cnf(c_0_105,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_102]) ).
cnf(c_0_106,negated_conjecture,
unordered_pair(esk6_0,esk6_0) = esk5_0,
i_0_50 ).
cnf(c_0_107,negated_conjecture,
member(esk6_0,universal_class),
i_0_51 ).
cnf(c_0_108,plain,
( member_of(X1) = X1
| X2 = member_of(X1)
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_109,negated_conjecture,
member(esk6_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107])]) ).
cnf(c_0_110,negated_conjecture,
member_of(esk5_0) != esk6_0,
i_0_49 ).
cnf(c_0_111,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
i_0_91 ).
cnf(c_0_112,plain,
( unordered_pair(member_of(unordered_pair(X1,X1)),member_of(unordered_pair(X1,X1))) = unordered_pair(X1,X1)
| ~ member(X1,universal_class) ),
i_0_52 ).
cnf(c_0_113,negated_conjecture,
member_of(esk5_0) = esk5_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]) ).
cnf(c_0_114,plain,
member(unordered_pair(X1,X2),universal_class),
i_0_89 ).
cnf(c_0_115,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_111]) ).
cnf(c_0_116,negated_conjecture,
unordered_pair(esk5_0,esk5_0) = esk5_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_106]),c_0_107])]),c_0_113]),c_0_113]) ).
cnf(c_0_117,negated_conjecture,
member(esk5_0,universal_class),
inference(spm,[status(thm)],[c_0_114,c_0_106]) ).
cnf(c_0_118,negated_conjecture,
( X1 = esk6_0
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_103,c_0_106]) ).
cnf(c_0_119,plain,
member(esk5_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117])]) ).
cnf(c_0_120,negated_conjecture,
esk5_0 != esk6_0,
inference(rw,[status(thm)],[c_0_110,c_0_113]) ).
cnf(c_0_121,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET090+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.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 : Sat Jul 9 22:01:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/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.43/2.46 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.43/2.46 # Version: 2.1pre011
% 8.43/2.46 # Preprocessing time : 0.014 s
% 8.43/2.46
% 8.43/2.46 # Proof found!
% 8.43/2.46 # SZS status Theorem
% 8.43/2.46 # SZS output start CNFRefutation
% See solution above
% 8.43/2.46 # Proof object total steps : 29
% 8.43/2.46 # Proof object clause steps : 20
% 8.43/2.46 # Proof object formula steps : 9
% 8.43/2.46 # Proof object conjectures : 13
% 8.43/2.46 # Proof object clause conjectures : 10
% 8.43/2.46 # Proof object formula conjectures : 3
% 8.43/2.46 # Proof object initial clauses used : 9
% 8.43/2.46 # Proof object initial formulas used : 9
% 8.43/2.46 # Proof object generating inferences : 8
% 8.43/2.46 # Proof object simplifying inferences : 13
% 8.43/2.46 # Training examples: 0 positive, 0 negative
% 8.43/2.46 # Parsed axioms : 85
% 8.43/2.46 # Removed by relevancy pruning/SinE : 0
% 8.43/2.46 # Initial clauses : 85
% 8.43/2.46 # Removed in clause preprocessing : 0
% 8.43/2.46 # Initial clauses in saturation : 85
% 8.43/2.46 # Processed clauses : 200
% 8.43/2.46 # ...of these trivial : 5
% 8.43/2.46 # ...subsumed : 15
% 8.43/2.46 # ...remaining for further processing : 180
% 8.43/2.46 # Other redundant clauses eliminated : 7
% 8.43/2.46 # Clauses deleted for lack of memory : 0
% 8.43/2.46 # Backward-subsumed : 12
% 8.43/2.46 # Backward-rewritten : 15
% 8.43/2.46 # Generated clauses : 1270
% 8.43/2.46 # ...of the previous two non-trivial : 1182
% 8.43/2.46 # Contextual simplify-reflections : 8
% 8.43/2.46 # Paramodulations : 1254
% 8.43/2.46 # Factorizations : 7
% 8.43/2.46 # Equation resolutions : 9
% 8.43/2.46 # Propositional unsat checks : 0
% 8.43/2.46 # Propositional unsat check successes : 0
% 8.43/2.46 # Current number of processed clauses : 149
% 8.43/2.46 # Positive orientable unit clauses : 28
% 8.43/2.46 # Positive unorientable unit clauses: 0
% 8.43/2.46 # Negative unit clauses : 2
% 8.43/2.46 # Non-unit-clauses : 119
% 8.43/2.46 # Current number of unprocessed clauses: 642
% 8.43/2.46 # ...number of literals in the above : 1947
% 8.43/2.46 # Current number of archived formulas : 0
% 8.43/2.46 # Current number of archived clauses : 27
% 8.43/2.46 # Clause-clause subsumption calls (NU) : 3261
% 8.43/2.46 # Rec. Clause-clause subsumption calls : 2717
% 8.43/2.46 # Non-unit clause-clause subsumptions : 27
% 8.43/2.46 # Unit Clause-clause subsumption calls : 751
% 8.43/2.46 # Rewrite failures with RHS unbound : 0
% 8.43/2.46 # BW rewrite match attempts : 21
% 8.43/2.46 # BW rewrite match successes : 7
% 8.43/2.46 # Condensation attempts : 0
% 8.43/2.46 # Condensation successes : 0
% 8.43/2.46 # Termbank termtop insertions : 27611
% 8.43/2.46
% 8.43/2.46 # -------------------------------------------------
% 8.43/2.46 # User time : 0.025 s
% 8.43/2.46 # System time : 0.008 s
% 8.43/2.46 # Total time : 0.034 s
% 8.43/2.46 # ...preprocessing : 0.014 s
% 8.43/2.46 # ...main loop : 0.020 s
% 8.43/2.46 # Maximum resident set size: 7132 pages
% 8.43/2.46
%------------------------------------------------------------------------------