TSTP Solution File: SET086+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET086+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:15 EDT 2022
% Result : Theorem 7.42s 2.35s
% Output : CNFRefutation 7.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 2 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 9 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_54,negated_conjecture,
( unordered_pair(X1,X1) != esk5_0
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnixg8bu/input.p',i_0_54) ).
cnf(i_0_53,negated_conjecture,
( member(esk6_1(X1),universal_class)
| X1 != esk5_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnixg8bu/input.p',i_0_53) ).
cnf(i_0_52,negated_conjecture,
( unordered_pair(esk6_1(X1),esk6_1(X1)) = esk5_0
| X1 != esk5_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jnixg8bu/input.p',i_0_52) ).
cnf(c_0_58,negated_conjecture,
( unordered_pair(X1,X1) != esk5_0
| ~ member(X1,universal_class) ),
i_0_54 ).
cnf(c_0_59,negated_conjecture,
( member(esk6_1(X1),universal_class)
| X1 != esk5_0 ),
i_0_53 ).
cnf(c_0_60,negated_conjecture,
( unordered_pair(esk6_1(X1),esk6_1(X1)) = esk5_0
| X1 != esk5_0 ),
i_0_52 ).
cnf(c_0_61,negated_conjecture,
X1 != esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET086+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 : Sun Jul 10 10:56:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.42/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.42/2.35 # Version: 2.1pre011
% 7.42/2.35 # Preprocessing time : 0.010 s
% 7.42/2.35
% 7.42/2.35 # Proof found!
% 7.42/2.35 # SZS status Theorem
% 7.42/2.35 # SZS output start CNFRefutation
% See solution above
% 7.42/2.35 # Proof object total steps : 8
% 7.42/2.35 # Proof object clause steps : 5
% 7.42/2.35 # Proof object formula steps : 3
% 7.42/2.35 # Proof object conjectures : 8
% 7.42/2.35 # Proof object clause conjectures : 5
% 7.42/2.35 # Proof object formula conjectures : 3
% 7.42/2.35 # Proof object initial clauses used : 3
% 7.42/2.35 # Proof object initial formulas used : 3
% 7.42/2.35 # Proof object generating inferences : 2
% 7.42/2.35 # Proof object simplifying inferences : 1
% 7.42/2.35 # Training examples: 0 positive, 0 negative
% 7.42/2.35 # Parsed axioms : 84
% 7.42/2.35 # Removed by relevancy pruning/SinE : 0
% 7.42/2.35 # Initial clauses : 84
% 7.42/2.35 # Removed in clause preprocessing : 0
% 7.42/2.35 # Initial clauses in saturation : 84
% 7.42/2.35 # Processed clauses : 97
% 7.42/2.35 # ...of these trivial : 1
% 7.42/2.35 # ...subsumed : 2
% 7.42/2.35 # ...remaining for further processing : 94
% 7.42/2.35 # Other redundant clauses eliminated : 7
% 7.42/2.35 # Clauses deleted for lack of memory : 0
% 7.42/2.35 # Backward-subsumed : 4
% 7.42/2.35 # Backward-rewritten : 1
% 7.42/2.35 # Generated clauses : 410
% 7.42/2.35 # ...of the previous two non-trivial : 379
% 7.42/2.35 # Contextual simplify-reflections : 1
% 7.42/2.35 # Paramodulations : 390
% 7.42/2.35 # Factorizations : 10
% 7.42/2.35 # Equation resolutions : 10
% 7.42/2.35 # Propositional unsat checks : 0
% 7.42/2.35 # Propositional unsat check successes : 0
% 7.42/2.35 # Current number of processed clauses : 85
% 7.42/2.35 # Positive orientable unit clauses : 13
% 7.42/2.35 # Positive unorientable unit clauses: 0
% 7.42/2.35 # Negative unit clauses : 3
% 7.42/2.35 # Non-unit-clauses : 69
% 7.42/2.35 # Current number of unprocessed clauses: 344
% 7.42/2.35 # ...number of literals in the above : 1014
% 7.42/2.35 # Current number of archived formulas : 0
% 7.42/2.35 # Current number of archived clauses : 5
% 7.42/2.35 # Clause-clause subsumption calls (NU) : 1205
% 7.42/2.35 # Rec. Clause-clause subsumption calls : 1105
% 7.42/2.35 # Non-unit clause-clause subsumptions : 7
% 7.42/2.35 # Unit Clause-clause subsumption calls : 302
% 7.42/2.35 # Rewrite failures with RHS unbound : 0
% 7.42/2.35 # BW rewrite match attempts : 15
% 7.42/2.35 # BW rewrite match successes : 1
% 7.42/2.35 # Condensation attempts : 0
% 7.42/2.35 # Condensation successes : 0
% 7.42/2.35 # Termbank termtop insertions : 11773
% 7.42/2.35
% 7.42/2.35 # -------------------------------------------------
% 7.42/2.35 # User time : 0.015 s
% 7.42/2.35 # System time : 0.002 s
% 7.42/2.35 # Total time : 0.017 s
% 7.42/2.35 # ...preprocessing : 0.010 s
% 7.42/2.35 # ...main loop : 0.007 s
% 7.42/2.35 # Maximum resident set size: 7140 pages
% 7.42/2.35
%------------------------------------------------------------------------------