TSTP Solution File: SET101+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET101+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:29 EDT 2022
% Result : Theorem 7.64s 2.41s
% Output : CNFRefutation 7.64s
% 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_88,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mo8jhdb5/input.p',i_0_88) ).
cnf(i_0_68,negated_conjecture,
~ member(unordered_pair(esk6_0,esk6_0),unordered_pair(unordered_pair(esk6_0,esk6_0),unordered_pair(esk6_0,unordered_pair(esk7_0,esk7_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mo8jhdb5/input.p',i_0_68) ).
cnf(i_0_86,plain,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mo8jhdb5/input.p',i_0_86) ).
cnf(c_0_92,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
i_0_88 ).
cnf(c_0_93,negated_conjecture,
~ member(unordered_pair(esk6_0,esk6_0),unordered_pair(unordered_pair(esk6_0,esk6_0),unordered_pair(esk6_0,unordered_pair(esk7_0,esk7_0)))),
i_0_68 ).
cnf(c_0_94,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_92]) ).
cnf(c_0_95,plain,
member(unordered_pair(X1,X2),universal_class),
i_0_86 ).
cnf(c_0_96,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET101+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n029.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 : Mon Jul 11 07:21:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/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
% 7.64/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.64/2.41 # Version: 2.1pre011
% 7.64/2.41 # Preprocessing time : 0.015 s
% 7.64/2.41
% 7.64/2.41 # Proof found!
% 7.64/2.41 # SZS status Theorem
% 7.64/2.41 # SZS output start CNFRefutation
% See solution above
% 7.64/2.41 # Proof object total steps : 8
% 7.64/2.41 # Proof object clause steps : 5
% 7.64/2.41 # Proof object formula steps : 3
% 7.64/2.41 # Proof object conjectures : 3
% 7.64/2.41 # Proof object clause conjectures : 2
% 7.64/2.41 # Proof object formula conjectures : 1
% 7.64/2.41 # Proof object initial clauses used : 3
% 7.64/2.41 # Proof object initial formulas used : 3
% 7.64/2.41 # Proof object generating inferences : 1
% 7.64/2.41 # Proof object simplifying inferences : 3
% 7.64/2.41 # Training examples: 0 positive, 0 negative
% 7.64/2.41 # Parsed axioms : 82
% 7.64/2.41 # Removed by relevancy pruning/SinE : 0
% 7.64/2.41 # Initial clauses : 82
% 7.64/2.41 # Removed in clause preprocessing : 0
% 7.64/2.41 # Initial clauses in saturation : 82
% 7.64/2.41 # Processed clauses : 100
% 7.64/2.41 # ...of these trivial : 2
% 7.64/2.41 # ...subsumed : 2
% 7.64/2.41 # ...remaining for further processing : 96
% 7.64/2.41 # Other redundant clauses eliminated : 5
% 7.64/2.41 # Clauses deleted for lack of memory : 0
% 7.64/2.41 # Backward-subsumed : 0
% 7.64/2.41 # Backward-rewritten : 2
% 7.64/2.41 # Generated clauses : 228
% 7.64/2.41 # ...of the previous two non-trivial : 202
% 7.64/2.41 # Contextual simplify-reflections : 0
% 7.64/2.41 # Paramodulations : 221
% 7.64/2.41 # Factorizations : 0
% 7.64/2.41 # Equation resolutions : 7
% 7.64/2.41 # Propositional unsat checks : 0
% 7.64/2.41 # Propositional unsat check successes : 0
% 7.64/2.41 # Current number of processed clauses : 90
% 7.64/2.41 # Positive orientable unit clauses : 15
% 7.64/2.41 # Positive unorientable unit clauses: 0
% 7.64/2.41 # Negative unit clauses : 2
% 7.64/2.41 # Non-unit-clauses : 73
% 7.64/2.41 # Current number of unprocessed clauses: 178
% 7.64/2.41 # ...number of literals in the above : 493
% 7.64/2.41 # Current number of archived formulas : 0
% 7.64/2.41 # Current number of archived clauses : 2
% 7.64/2.41 # Clause-clause subsumption calls (NU) : 1147
% 7.64/2.41 # Rec. Clause-clause subsumption calls : 1052
% 7.64/2.41 # Non-unit clause-clause subsumptions : 0
% 7.64/2.41 # Unit Clause-clause subsumption calls : 351
% 7.64/2.41 # Rewrite failures with RHS unbound : 0
% 7.64/2.41 # BW rewrite match attempts : 15
% 7.64/2.41 # BW rewrite match successes : 2
% 7.64/2.41 # Condensation attempts : 0
% 7.64/2.41 # Condensation successes : 0
% 7.64/2.41 # Termbank termtop insertions : 7559
% 7.64/2.41
% 7.64/2.41 # -------------------------------------------------
% 7.64/2.41 # User time : 0.018 s
% 7.64/2.41 # System time : 0.005 s
% 7.64/2.41 # Total time : 0.022 s
% 7.64/2.41 # ...preprocessing : 0.015 s
% 7.64/2.41 # ...main loop : 0.007 s
% 7.64/2.41 # Maximum resident set size: 7128 pages
% 7.64/2.41
%------------------------------------------------------------------------------