TSTP Solution File: SET108+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET108+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:34 EDT 2022
% Result : Theorem 9.60s 2.68s
% Output : CNFRefutation 9.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 2 unt; 0 nHn; 11 RR)
% Number of literals : 28 ( 19 equ; 21 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_29,negated_conjecture,
( unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) != esk3_0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mm3ruajt/input.p',i_0_29) ).
cnf(i_0_26,negated_conjecture,
( unordered_pair(unordered_pair(esk4_2(X1,X2),esk4_2(X1,X2)),unordered_pair(esk4_2(X1,X2),unordered_pair(esk5_2(X1,X2),esk5_2(X1,X2)))) = esk3_0
| X2 != esk3_0
| X1 != esk3_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mm3ruajt/input.p',i_0_26) ).
cnf(i_0_28,negated_conjecture,
( member(esk4_2(X1,X2),universal_class)
| X2 != esk3_0
| X1 != esk3_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mm3ruajt/input.p',i_0_28) ).
cnf(i_0_27,negated_conjecture,
( member(esk5_2(X1,X2),universal_class)
| X2 != esk3_0
| X1 != esk3_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mm3ruajt/input.p',i_0_27) ).
cnf(c_0_34,negated_conjecture,
( unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) != esk3_0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
i_0_29 ).
cnf(c_0_35,negated_conjecture,
( unordered_pair(unordered_pair(esk4_2(X1,X2),esk4_2(X1,X2)),unordered_pair(esk4_2(X1,X2),unordered_pair(esk5_2(X1,X2),esk5_2(X1,X2)))) = esk3_0
| X2 != esk3_0
| X1 != esk3_0 ),
i_0_26 ).
cnf(c_0_36,negated_conjecture,
( member(esk4_2(X1,X2),universal_class)
| X2 != esk3_0
| X1 != esk3_0 ),
i_0_28 ).
cnf(c_0_37,negated_conjecture,
( member(esk5_2(X1,X2),universal_class)
| X2 != esk3_0
| X1 != esk3_0 ),
i_0_27 ).
cnf(c_0_38,negated_conjecture,
( X1 != esk3_0
| X2 != esk3_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]) ).
cnf(c_0_39,negated_conjecture,
X1 != esk3_0,
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 11 09:49:03 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected SinE mode:
% 0.17/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.60/2.68 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 9.60/2.68 # Version: 2.1pre011
% 9.60/2.68 # Preprocessing time : 0.015 s
% 9.60/2.68
% 9.60/2.68 # Proof found!
% 9.60/2.68 # SZS status Theorem
% 9.60/2.68 # SZS output start CNFRefutation
% See solution above
% 9.60/2.68 # Proof object total steps : 11
% 9.60/2.68 # Proof object clause steps : 7
% 9.60/2.68 # Proof object formula steps : 4
% 9.60/2.68 # Proof object conjectures : 11
% 9.60/2.68 # Proof object clause conjectures : 7
% 9.60/2.68 # Proof object formula conjectures : 4
% 9.60/2.68 # Proof object initial clauses used : 4
% 9.60/2.68 # Proof object initial formulas used : 4
% 9.60/2.68 # Proof object generating inferences : 3
% 9.60/2.68 # Proof object simplifying inferences : 2
% 9.60/2.68 # Training examples: 0 positive, 0 negative
% 9.60/2.68 # Parsed axioms : 85
% 9.60/2.68 # Removed by relevancy pruning/SinE : 0
% 9.60/2.68 # Initial clauses : 85
% 9.60/2.68 # Removed in clause preprocessing : 0
% 9.60/2.68 # Initial clauses in saturation : 85
% 9.60/2.68 # Processed clauses : 106
% 9.60/2.68 # ...of these trivial : 2
% 9.60/2.68 # ...subsumed : 2
% 9.60/2.68 # ...remaining for further processing : 102
% 9.60/2.68 # Other redundant clauses eliminated : 7
% 9.60/2.68 # Clauses deleted for lack of memory : 0
% 9.60/2.68 # Backward-subsumed : 7
% 9.60/2.68 # Backward-rewritten : 1
% 9.60/2.68 # Generated clauses : 307
% 9.60/2.68 # ...of the previous two non-trivial : 273
% 9.60/2.68 # Contextual simplify-reflections : 2
% 9.60/2.68 # Paramodulations : 294
% 9.60/2.68 # Factorizations : 2
% 9.60/2.68 # Equation resolutions : 11
% 9.60/2.68 # Propositional unsat checks : 0
% 9.60/2.68 # Propositional unsat check successes : 0
% 9.60/2.68 # Current number of processed clauses : 90
% 9.60/2.68 # Positive orientable unit clauses : 17
% 9.60/2.68 # Positive unorientable unit clauses: 0
% 9.60/2.68 # Negative unit clauses : 2
% 9.60/2.68 # Non-unit-clauses : 71
% 9.60/2.68 # Current number of unprocessed clauses: 186
% 9.60/2.68 # ...number of literals in the above : 516
% 9.60/2.68 # Current number of archived formulas : 0
% 9.60/2.68 # Current number of archived clauses : 8
% 9.60/2.68 # Clause-clause subsumption calls (NU) : 830
% 9.60/2.68 # Rec. Clause-clause subsumption calls : 739
% 9.60/2.68 # Non-unit clause-clause subsumptions : 11
% 9.60/2.68 # Unit Clause-clause subsumption calls : 93
% 9.60/2.68 # Rewrite failures with RHS unbound : 0
% 9.60/2.68 # BW rewrite match attempts : 14
% 9.60/2.68 # BW rewrite match successes : 1
% 9.60/2.68 # Condensation attempts : 0
% 9.60/2.68 # Condensation successes : 0
% 9.60/2.68 # Termbank termtop insertions : 8875
% 9.60/2.68
% 9.60/2.68 # -------------------------------------------------
% 9.60/2.68 # User time : 0.021 s
% 9.60/2.68 # System time : 0.000 s
% 9.60/2.68 # Total time : 0.021 s
% 9.60/2.68 # ...preprocessing : 0.015 s
% 9.60/2.68 # ...main loop : 0.006 s
% 9.60/2.68 # Maximum resident set size: 7132 pages
% 9.60/2.68
%------------------------------------------------------------------------------