TSTP Solution File: SET027+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET027+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:08:20 EDT 2022
% Result : Theorem 6.71s 2.33s
% Output : CNFRefutation 6.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 7 unt; 2 nHn; 15 RR)
% Number of literals : 29 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_71,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0qbuk12t/input.p',i_0_71) ).
cnf(i_0_83,negated_conjecture,
subclass(esk9_0,esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0qbuk12t/input.p',i_0_83) ).
cnf(i_0_69,plain,
( subclass(X1,X2)
| ~ member(esk6_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0qbuk12t/input.p',i_0_69) ).
cnf(i_0_84,negated_conjecture,
subclass(esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0qbuk12t/input.p',i_0_84) ).
cnf(i_0_70,plain,
( subclass(X1,X2)
| member(esk6_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0qbuk12t/input.p',i_0_70) ).
cnf(i_0_82,negated_conjecture,
~ subclass(esk8_0,esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0qbuk12t/input.p',i_0_82) ).
cnf(c_0_91,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
i_0_71 ).
cnf(c_0_92,negated_conjecture,
subclass(esk9_0,esk10_0),
i_0_83 ).
cnf(c_0_93,plain,
( subclass(X1,X2)
| ~ member(esk6_2(X1,X2),X2) ),
i_0_69 ).
cnf(c_0_94,negated_conjecture,
( member(X1,esk10_0)
| ~ member(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,negated_conjecture,
subclass(esk8_0,esk9_0),
i_0_84 ).
cnf(c_0_96,plain,
( subclass(X1,esk10_0)
| ~ member(esk6_2(X1,esk10_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_97,negated_conjecture,
( member(X1,esk9_0)
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_91,c_0_95]) ).
cnf(c_0_98,plain,
( subclass(X1,esk10_0)
| ~ member(esk6_2(X1,esk10_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_99,plain,
( subclass(X1,X2)
| member(esk6_2(X1,X2),X1) ),
i_0_70 ).
cnf(c_0_100,negated_conjecture,
~ subclass(esk8_0,esk10_0),
i_0_82 ).
cnf(c_0_101,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET027+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 20:15:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/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
% 6.71/2.33 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.71/2.33 # Version: 2.1pre011
% 6.71/2.33 # Preprocessing time : 0.011 s
% 6.71/2.33
% 6.71/2.33 # Proof found!
% 6.71/2.33 # SZS status Theorem
% 6.71/2.33 # SZS output start CNFRefutation
% See solution above
% 6.71/2.33 # Proof object total steps : 17
% 6.71/2.33 # Proof object clause steps : 11
% 6.71/2.33 # Proof object formula steps : 6
% 6.71/2.33 # Proof object conjectures : 8
% 6.71/2.33 # Proof object clause conjectures : 5
% 6.71/2.33 # Proof object formula conjectures : 3
% 6.71/2.33 # Proof object initial clauses used : 6
% 6.71/2.33 # Proof object initial formulas used : 6
% 6.71/2.33 # Proof object generating inferences : 5
% 6.71/2.33 # Proof object simplifying inferences : 1
% 6.71/2.33 # Training examples: 0 positive, 0 negative
% 6.71/2.33 # Parsed axioms : 84
% 6.71/2.33 # Removed by relevancy pruning/SinE : 0
% 6.71/2.33 # Initial clauses : 84
% 6.71/2.33 # Removed in clause preprocessing : 0
% 6.71/2.33 # Initial clauses in saturation : 84
% 6.71/2.33 # Processed clauses : 134
% 6.71/2.33 # ...of these trivial : 3
% 6.71/2.33 # ...subsumed : 8
% 6.71/2.33 # ...remaining for further processing : 123
% 6.71/2.33 # Other redundant clauses eliminated : 5
% 6.71/2.33 # Clauses deleted for lack of memory : 0
% 6.71/2.33 # Backward-subsumed : 2
% 6.71/2.33 # Backward-rewritten : 1
% 6.71/2.33 # Generated clauses : 302
% 6.71/2.33 # ...of the previous two non-trivial : 267
% 6.71/2.33 # Contextual simplify-reflections : 1
% 6.71/2.33 # Paramodulations : 295
% 6.71/2.33 # Factorizations : 0
% 6.71/2.33 # Equation resolutions : 7
% 6.71/2.33 # Propositional unsat checks : 0
% 6.71/2.33 # Propositional unsat check successes : 0
% 6.71/2.33 # Current number of processed clauses : 116
% 6.71/2.33 # Positive orientable unit clauses : 21
% 6.71/2.33 # Positive unorientable unit clauses: 0
% 6.71/2.33 # Negative unit clauses : 2
% 6.71/2.33 # Non-unit-clauses : 93
% 6.71/2.33 # Current number of unprocessed clauses: 206
% 6.71/2.33 # ...number of literals in the above : 564
% 6.71/2.33 # Current number of archived formulas : 0
% 6.71/2.33 # Current number of archived clauses : 3
% 6.71/2.33 # Clause-clause subsumption calls (NU) : 1115
% 6.71/2.33 # Rec. Clause-clause subsumption calls : 964
% 6.71/2.33 # Non-unit clause-clause subsumptions : 3
% 6.71/2.33 # Unit Clause-clause subsumption calls : 94
% 6.71/2.33 # Rewrite failures with RHS unbound : 0
% 6.71/2.33 # BW rewrite match attempts : 19
% 6.71/2.33 # BW rewrite match successes : 1
% 6.71/2.33 # Condensation attempts : 0
% 6.71/2.33 # Condensation successes : 0
% 6.71/2.33 # Termbank termtop insertions : 8656
% 6.71/2.33
% 6.71/2.33 # -------------------------------------------------
% 6.71/2.33 # User time : 0.014 s
% 6.71/2.33 # System time : 0.004 s
% 6.71/2.33 # Total time : 0.018 s
% 6.71/2.33 # ...preprocessing : 0.011 s
% 6.71/2.33 # ...main loop : 0.007 s
% 6.71/2.33 # Maximum resident set size: 7128 pages
% 6.71/2.33
%------------------------------------------------------------------------------