TSTP Solution File: SET102+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET102+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:30 EDT 2022
% Result : Theorem 7.93s 2.33s
% Output : CNFRefutation 7.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 3 RR)
% Number of literals : 13 ( 2 equ; 7 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_86,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x061lei8/input.p',i_0_86) ).
cnf(i_0_90,negated_conjecture,
~ member(unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x061lei8/input.p',i_0_90) ).
cnf(i_0_85,plain,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x061lei8/input.p',i_0_85) ).
cnf(c_0_94,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
i_0_86 ).
cnf(c_0_95,negated_conjecture,
~ member(unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)))),
i_0_90 ).
cnf(c_0_96,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_94]) ).
cnf(c_0_97,plain,
member(unordered_pair(X1,X2),universal_class),
i_0_85 ).
cnf(c_0_98,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET102+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 19:40:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # 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.93/2.33 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.93/2.33 # Version: 2.1pre011
% 7.93/2.33 # Preprocessing time : 0.016 s
% 7.93/2.33
% 7.93/2.33 # Proof found!
% 7.93/2.33 # SZS status Theorem
% 7.93/2.33 # SZS output start CNFRefutation
% See solution above
% 7.93/2.33 # Proof object total steps : 8
% 7.93/2.33 # Proof object clause steps : 5
% 7.93/2.33 # Proof object formula steps : 3
% 7.93/2.33 # Proof object conjectures : 3
% 7.93/2.33 # Proof object clause conjectures : 2
% 7.93/2.33 # Proof object formula conjectures : 1
% 7.93/2.33 # Proof object initial clauses used : 3
% 7.93/2.33 # Proof object initial formulas used : 3
% 7.93/2.33 # Proof object generating inferences : 1
% 7.93/2.33 # Proof object simplifying inferences : 3
% 7.93/2.33 # Training examples: 0 positive, 0 negative
% 7.93/2.33 # Parsed axioms : 82
% 7.93/2.33 # Removed by relevancy pruning/SinE : 0
% 7.93/2.33 # Initial clauses : 82
% 7.93/2.33 # Removed in clause preprocessing : 0
% 7.93/2.33 # Initial clauses in saturation : 82
% 7.93/2.33 # Processed clauses : 94
% 7.93/2.33 # ...of these trivial : 2
% 7.93/2.33 # ...subsumed : 1
% 7.93/2.33 # ...remaining for further processing : 91
% 7.93/2.33 # Other redundant clauses eliminated : 5
% 7.93/2.33 # Clauses deleted for lack of memory : 0
% 7.93/2.33 # Backward-subsumed : 0
% 7.93/2.33 # Backward-rewritten : 2
% 7.93/2.33 # Generated clauses : 221
% 7.93/2.33 # ...of the previous two non-trivial : 196
% 7.93/2.33 # Contextual simplify-reflections : 0
% 7.93/2.33 # Paramodulations : 214
% 7.93/2.33 # Factorizations : 0
% 7.93/2.33 # Equation resolutions : 7
% 7.93/2.33 # Propositional unsat checks : 0
% 7.93/2.33 # Propositional unsat check successes : 0
% 7.93/2.33 # Current number of processed clauses : 85
% 7.93/2.33 # Positive orientable unit clauses : 15
% 7.93/2.33 # Positive unorientable unit clauses: 0
% 7.93/2.33 # Negative unit clauses : 2
% 7.93/2.33 # Non-unit-clauses : 68
% 7.93/2.33 # Current number of unprocessed clauses: 178
% 7.93/2.33 # ...number of literals in the above : 490
% 7.93/2.33 # Current number of archived formulas : 0
% 7.93/2.33 # Current number of archived clauses : 2
% 7.93/2.33 # Clause-clause subsumption calls (NU) : 1166
% 7.93/2.33 # Rec. Clause-clause subsumption calls : 1066
% 7.93/2.33 # Non-unit clause-clause subsumptions : 0
% 7.93/2.33 # Unit Clause-clause subsumption calls : 357
% 7.93/2.33 # Rewrite failures with RHS unbound : 0
% 7.93/2.33 # BW rewrite match attempts : 15
% 7.93/2.33 # BW rewrite match successes : 2
% 7.93/2.33 # Condensation attempts : 0
% 7.93/2.33 # Condensation successes : 0
% 7.93/2.33 # Termbank termtop insertions : 7323
% 7.93/2.33
% 7.93/2.33 # -------------------------------------------------
% 7.93/2.33 # User time : 0.015 s
% 7.93/2.33 # System time : 0.007 s
% 7.93/2.33 # Total time : 0.022 s
% 7.93/2.33 # ...preprocessing : 0.016 s
% 7.93/2.33 # ...main loop : 0.005 s
% 7.93/2.33 # Maximum resident set size: 7128 pages
% 7.93/2.33
%------------------------------------------------------------------------------