TSTP Solution File: SET084+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET084+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:13 EDT 2022
% Result : Theorem 7.82s 2.30s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 7 unt; 2 nHn; 10 RR)
% Number of literals : 23 ( 11 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_91,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbddcid6/input.p',i_0_91) ).
cnf(i_0_70,negated_conjecture,
unordered_pair(esk6_0,esk6_0) = unordered_pair(esk7_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbddcid6/input.p',i_0_70) ).
cnf(i_0_89,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbddcid6/input.p',i_0_89) ).
cnf(i_0_69,negated_conjecture,
member(esk7_0,universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbddcid6/input.p',i_0_69) ).
cnf(i_0_68,negated_conjecture,
esk6_0 != esk7_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbddcid6/input.p',i_0_68) ).
cnf(c_0_97,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
i_0_91 ).
cnf(c_0_98,negated_conjecture,
unordered_pair(esk6_0,esk6_0) = unordered_pair(esk7_0,esk7_0),
i_0_70 ).
cnf(c_0_99,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
i_0_89 ).
cnf(c_0_100,negated_conjecture,
( X1 = esk6_0
| ~ member(X1,unordered_pair(esk7_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_101,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_99]) ).
cnf(c_0_102,negated_conjecture,
member(esk7_0,universal_class),
i_0_69 ).
cnf(c_0_103,negated_conjecture,
esk6_0 != esk7_0,
i_0_68 ).
cnf(c_0_104,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102])]),c_0_103]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET084+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n029.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 03:01:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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.82/2.30 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.82/2.30 # Version: 2.1pre011
% 7.82/2.30 # Preprocessing time : 0.011 s
% 7.82/2.30
% 7.82/2.30 # Proof found!
% 7.82/2.30 # SZS status Theorem
% 7.82/2.30 # SZS output start CNFRefutation
% See solution above
% 7.82/2.30 # Proof object total steps : 13
% 7.82/2.30 # Proof object clause steps : 8
% 7.82/2.30 # Proof object formula steps : 5
% 7.82/2.30 # Proof object conjectures : 7
% 7.82/2.30 # Proof object clause conjectures : 4
% 7.82/2.30 # Proof object formula conjectures : 3
% 7.82/2.30 # Proof object initial clauses used : 5
% 7.82/2.30 # Proof object initial formulas used : 5
% 7.82/2.30 # Proof object generating inferences : 2
% 7.82/2.30 # Proof object simplifying inferences : 4
% 7.82/2.30 # Training examples: 0 positive, 0 negative
% 7.82/2.30 # Parsed axioms : 84
% 7.82/2.30 # Removed by relevancy pruning/SinE : 0
% 7.82/2.30 # Initial clauses : 84
% 7.82/2.30 # Removed in clause preprocessing : 0
% 7.82/2.30 # Initial clauses in saturation : 84
% 7.82/2.30 # Processed clauses : 96
% 7.82/2.30 # ...of these trivial : 2
% 7.82/2.30 # ...subsumed : 1
% 7.82/2.30 # ...remaining for further processing : 93
% 7.82/2.30 # Other redundant clauses eliminated : 5
% 7.82/2.30 # Clauses deleted for lack of memory : 0
% 7.82/2.30 # Backward-subsumed : 4
% 7.82/2.30 # Backward-rewritten : 0
% 7.82/2.30 # Generated clauses : 328
% 7.82/2.30 # ...of the previous two non-trivial : 296
% 7.82/2.30 # Contextual simplify-reflections : 0
% 7.82/2.30 # Paramodulations : 321
% 7.82/2.30 # Factorizations : 0
% 7.82/2.30 # Equation resolutions : 7
% 7.82/2.30 # Propositional unsat checks : 0
% 7.82/2.30 # Propositional unsat check successes : 0
% 7.82/2.30 # Current number of processed clauses : 85
% 7.82/2.30 # Positive orientable unit clauses : 16
% 7.82/2.30 # Positive unorientable unit clauses: 0
% 7.82/2.30 # Negative unit clauses : 2
% 7.82/2.30 # Non-unit-clauses : 67
% 7.82/2.30 # Current number of unprocessed clauses: 252
% 7.82/2.30 # ...number of literals in the above : 665
% 7.82/2.30 # Current number of archived formulas : 0
% 7.82/2.30 # Current number of archived clauses : 4
% 7.82/2.30 # Clause-clause subsumption calls (NU) : 1050
% 7.82/2.30 # Rec. Clause-clause subsumption calls : 985
% 7.82/2.30 # Non-unit clause-clause subsumptions : 5
% 7.82/2.30 # Unit Clause-clause subsumption calls : 73
% 7.82/2.30 # Rewrite failures with RHS unbound : 0
% 7.82/2.30 # BW rewrite match attempts : 13
% 7.82/2.30 # BW rewrite match successes : 0
% 7.82/2.30 # Condensation attempts : 0
% 7.82/2.30 # Condensation successes : 0
% 7.82/2.30 # Termbank termtop insertions : 10137
% 7.82/2.30
% 7.82/2.30 # -------------------------------------------------
% 7.82/2.30 # User time : 0.012 s
% 7.82/2.30 # System time : 0.005 s
% 7.82/2.30 # Total time : 0.017 s
% 7.82/2.30 # ...preprocessing : 0.011 s
% 7.82/2.30 # ...main loop : 0.006 s
% 7.82/2.30 # Maximum resident set size: 7136 pages
% 7.82/2.30
%------------------------------------------------------------------------------