TSTP Solution File: SET017+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET017+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:08:06 EDT 2022
% Result : Theorem 7.61s 2.26s
% Output : CNFRefutation 7.61s
% 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/sandbox/tmp/enigma-theBenchmark.p-mmkash_x/input.p',i_0_92) ).
cnf(i_0_53,negated_conjecture,
unordered_pair(esk5_0,esk7_0) = unordered_pair(esk5_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mmkash_x/input.p',i_0_53) ).
cnf(i_0_90,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mmkash_x/input.p',i_0_90) ).
cnf(i_0_55,negated_conjecture,
member(esk6_0,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mmkash_x/input.p',i_0_55) ).
cnf(i_0_52,negated_conjecture,
esk7_0 != esk6_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mmkash_x/input.p',i_0_52) ).
cnf(i_0_54,negated_conjecture,
member(esk7_0,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mmkash_x/input.p',i_0_54) ).
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(esk5_0,esk7_0) = unordered_pair(esk5_0,esk6_0),
i_0_53 ).
cnf(c_0_101,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
i_0_90 ).
cnf(c_0_102,negated_conjecture,
( X1 = esk5_0
| X1 = esk7_0
| ~ member(X1,unordered_pair(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_101]) ).
cnf(c_0_104,negated_conjecture,
member(esk6_0,universal_class),
i_0_55 ).
cnf(c_0_105,negated_conjecture,
esk7_0 != esk6_0,
i_0_52 ).
cnf(c_0_106,plain,
esk5_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(esk6_0,esk7_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_54 ).
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.12 % Problem : SET017+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 16:40:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.61/2.26 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.61/2.26 # Version: 2.1pre011
% 7.61/2.26 # Preprocessing time : 0.011 s
% 7.61/2.26
% 7.61/2.26 # Proof found!
% 7.61/2.26 # SZS status Theorem
% 7.61/2.26 # SZS output start CNFRefutation
% See solution above
% 7.61/2.26 # Proof object total steps : 18
% 7.61/2.26 # Proof object clause steps : 12
% 7.61/2.26 # Proof object formula steps : 6
% 7.61/2.26 # Proof object conjectures : 10
% 7.61/2.26 # Proof object clause conjectures : 6
% 7.61/2.26 # Proof object formula conjectures : 4
% 7.61/2.26 # Proof object initial clauses used : 6
% 7.61/2.26 # Proof object initial formulas used : 6
% 7.61/2.26 # Proof object generating inferences : 4
% 7.61/2.26 # Proof object simplifying inferences : 9
% 7.61/2.26 # Training examples: 0 positive, 0 negative
% 7.61/2.26 # Parsed axioms : 85
% 7.61/2.26 # Removed by relevancy pruning/SinE : 0
% 7.61/2.26 # Initial clauses : 85
% 7.61/2.26 # Removed in clause preprocessing : 0
% 7.61/2.26 # Initial clauses in saturation : 85
% 7.61/2.26 # Processed clauses : 116
% 7.61/2.26 # ...of these trivial : 2
% 7.61/2.26 # ...subsumed : 3
% 7.61/2.26 # ...remaining for further processing : 111
% 7.61/2.26 # Other redundant clauses eliminated : 7
% 7.61/2.26 # Clauses deleted for lack of memory : 0
% 7.61/2.26 # Backward-subsumed : 4
% 7.61/2.26 # Backward-rewritten : 4
% 7.61/2.26 # Generated clauses : 315
% 7.61/2.26 # ...of the previous two non-trivial : 274
% 7.61/2.26 # Contextual simplify-reflections : 1
% 7.61/2.26 # Paramodulations : 304
% 7.61/2.26 # Factorizations : 2
% 7.61/2.26 # Equation resolutions : 9
% 7.61/2.26 # Propositional unsat checks : 0
% 7.61/2.26 # Propositional unsat check successes : 0
% 7.61/2.26 # Current number of processed clauses : 99
% 7.61/2.26 # Positive orientable unit clauses : 25
% 7.61/2.26 # Positive unorientable unit clauses: 0
% 7.61/2.26 # Negative unit clauses : 2
% 7.61/2.26 # Non-unit-clauses : 72
% 7.61/2.26 # Current number of unprocessed clauses: 203
% 7.61/2.26 # ...number of literals in the above : 563
% 7.61/2.26 # Current number of archived formulas : 0
% 7.61/2.26 # Current number of archived clauses : 8
% 7.61/2.26 # Clause-clause subsumption calls (NU) : 1121
% 7.61/2.26 # Rec. Clause-clause subsumption calls : 1032
% 7.61/2.26 # Non-unit clause-clause subsumptions : 7
% 7.61/2.26 # Unit Clause-clause subsumption calls : 420
% 7.61/2.26 # Rewrite failures with RHS unbound : 0
% 7.61/2.26 # BW rewrite match attempts : 16
% 7.61/2.26 # BW rewrite match successes : 3
% 7.61/2.26 # Condensation attempts : 0
% 7.61/2.26 # Condensation successes : 0
% 7.61/2.26 # Termbank termtop insertions : 8443
% 7.61/2.26
% 7.61/2.26 # -------------------------------------------------
% 7.61/2.26 # User time : 0.015 s
% 7.61/2.26 # System time : 0.002 s
% 7.61/2.26 # Total time : 0.017 s
% 7.61/2.26 # ...preprocessing : 0.011 s
% 7.61/2.26 # ...main loop : 0.006 s
% 7.61/2.26 # Maximum resident set size: 7124 pages
% 7.61/2.26
%------------------------------------------------------------------------------