TSTP Solution File: SET072+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET072+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:02 EDT 2022
% Result : Theorem 8.06s 2.47s
% Output : CNFRefutation 8.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 12 unt; 3 nHn; 15 RR)
% Number of literals : 29 ( 14 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_92,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1qtrkt4o/input.p',i_0_92) ).
cnf(i_0_65,negated_conjecture,
unordered_pair(esk7_0,esk8_0) = unordered_pair(esk6_0,esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1qtrkt4o/input.p',i_0_65) ).
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-1qtrkt4o/input.p',i_0_91) ).
cnf(i_0_67,negated_conjecture,
member(esk6_0,universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1qtrkt4o/input.p',i_0_67) ).
cnf(i_0_64,negated_conjecture,
esk7_0 != esk6_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1qtrkt4o/input.p',i_0_64) ).
cnf(i_0_66,negated_conjecture,
member(esk7_0,universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1qtrkt4o/input.p',i_0_66) ).
cnf(c_0_99,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
i_0_92 ).
cnf(c_0_100,negated_conjecture,
unordered_pair(esk7_0,esk8_0) = unordered_pair(esk6_0,esk8_0),
i_0_65 ).
cnf(c_0_101,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
i_0_91 ).
cnf(c_0_102,negated_conjecture,
( X1 = esk7_0
| X1 = esk8_0
| ~ member(X1,unordered_pair(esk6_0,esk8_0)) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_101]) ).
cnf(c_0_104,negated_conjecture,
member(esk6_0,universal_class),
i_0_67 ).
cnf(c_0_105,negated_conjecture,
esk7_0 != esk6_0,
i_0_64 ).
cnf(c_0_106,plain,
esk8_0 = esk6_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104])]),c_0_105]) ).
cnf(c_0_107,negated_conjecture,
unordered_pair(esk7_0,esk6_0) = unordered_pair(esk6_0,esk6_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_106]),c_0_106]) ).
cnf(c_0_108,negated_conjecture,
member(esk7_0,universal_class),
i_0_66 ).
cnf(c_0_109,plain,
member(esk7_0,unordered_pair(esk6_0,esk6_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_107]),c_0_108])]) ).
cnf(c_0_110,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_109]),c_0_105]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET072+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 : n009.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 01:08:38 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected SinE mode:
% 0.21/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.06/2.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.06/2.47 # Version: 2.1pre011
% 8.06/2.47 # Preprocessing time : 0.011 s
% 8.06/2.47
% 8.06/2.47 # Proof found!
% 8.06/2.47 # SZS status Theorem
% 8.06/2.47 # SZS output start CNFRefutation
% See solution above
% 8.06/2.47 # Proof object total steps : 18
% 8.06/2.47 # Proof object clause steps : 12
% 8.06/2.47 # Proof object formula steps : 6
% 8.06/2.47 # Proof object conjectures : 10
% 8.06/2.47 # Proof object clause conjectures : 6
% 8.06/2.47 # Proof object formula conjectures : 4
% 8.06/2.47 # Proof object initial clauses used : 6
% 8.06/2.47 # Proof object initial formulas used : 6
% 8.06/2.47 # Proof object generating inferences : 4
% 8.06/2.47 # Proof object simplifying inferences : 9
% 8.06/2.47 # Training examples: 0 positive, 0 negative
% 8.06/2.47 # Parsed axioms : 85
% 8.06/2.47 # Removed by relevancy pruning/SinE : 0
% 8.06/2.47 # Initial clauses : 85
% 8.06/2.47 # Removed in clause preprocessing : 0
% 8.06/2.47 # Initial clauses in saturation : 85
% 8.06/2.47 # Processed clauses : 106
% 8.06/2.47 # ...of these trivial : 2
% 8.06/2.47 # ...subsumed : 1
% 8.06/2.47 # ...remaining for further processing : 103
% 8.06/2.47 # Other redundant clauses eliminated : 5
% 8.06/2.47 # Clauses deleted for lack of memory : 0
% 8.06/2.47 # Backward-subsumed : 4
% 8.06/2.47 # Backward-rewritten : 3
% 8.06/2.47 # Generated clauses : 280
% 8.06/2.47 # ...of the previous two non-trivial : 245
% 8.06/2.47 # Contextual simplify-reflections : 0
% 8.06/2.47 # Paramodulations : 273
% 8.06/2.47 # Factorizations : 0
% 8.06/2.47 # Equation resolutions : 7
% 8.06/2.47 # Propositional unsat checks : 0
% 8.06/2.47 # Propositional unsat check successes : 0
% 8.06/2.47 # Current number of processed clauses : 92
% 8.06/2.47 # Positive orientable unit clauses : 22
% 8.06/2.47 # Positive unorientable unit clauses: 0
% 8.06/2.47 # Negative unit clauses : 2
% 8.06/2.47 # Non-unit-clauses : 68
% 8.06/2.47 # Current number of unprocessed clauses: 189
% 8.06/2.47 # ...number of literals in the above : 520
% 8.06/2.47 # Current number of archived formulas : 0
% 8.06/2.47 # Current number of archived clauses : 7
% 8.06/2.47 # Clause-clause subsumption calls (NU) : 1088
% 8.06/2.47 # Rec. Clause-clause subsumption calls : 1010
% 8.06/2.47 # Non-unit clause-clause subsumptions : 5
% 8.06/2.47 # Unit Clause-clause subsumption calls : 220
% 8.06/2.47 # Rewrite failures with RHS unbound : 0
% 8.06/2.47 # BW rewrite match attempts : 15
% 8.06/2.47 # BW rewrite match successes : 2
% 8.06/2.47 # Condensation attempts : 0
% 8.06/2.47 # Condensation successes : 0
% 8.06/2.47 # Termbank termtop insertions : 8119
% 8.06/2.47
% 8.06/2.47 # -------------------------------------------------
% 8.06/2.47 # User time : 0.013 s
% 8.06/2.47 # System time : 0.004 s
% 8.06/2.47 # Total time : 0.017 s
% 8.06/2.47 # ...preprocessing : 0.011 s
% 8.06/2.47 # ...main loop : 0.005 s
% 8.06/2.47 # Maximum resident set size: 7132 pages
% 8.06/2.47
%------------------------------------------------------------------------------