TSTP Solution File: SET093+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET093+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:20 EDT 2022
% Result : Theorem 6.94s 2.32s
% Output : CNFRefutation 6.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 5 RR)
% Number of literals : 7 ( 2 equ; 2 neg)
% Maximal clause size : 1 ( 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 : 4 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_88,plain,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lphv6n5/input.p',i_0_88) ).
cnf(i_0_10,negated_conjecture,
unordered_pair(member_of(esk2_0),member_of(esk2_0)) = esk2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lphv6n5/input.p',i_0_10) ).
cnf(i_0_9,negated_conjecture,
~ member(esk2_0,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lphv6n5/input.p',i_0_9) ).
cnf(c_0_92,plain,
member(unordered_pair(X1,X2),universal_class),
i_0_88 ).
cnf(c_0_93,negated_conjecture,
unordered_pair(member_of(esk2_0),member_of(esk2_0)) = esk2_0,
i_0_10 ).
cnf(c_0_94,negated_conjecture,
~ member(esk2_0,universal_class),
i_0_9 ).
cnf(c_0_95,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET093+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 01:17:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/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
% 6.94/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 6.94/2.32 # Version: 2.1pre011
% 6.94/2.32 # Preprocessing time : 0.011 s
% 6.94/2.32
% 6.94/2.32 # Proof found!
% 6.94/2.32 # SZS status Theorem
% 6.94/2.32 # SZS output start CNFRefutation
% See solution above
% 6.94/2.32 # Proof object total steps : 7
% 6.94/2.32 # Proof object clause steps : 4
% 6.94/2.32 # Proof object formula steps : 3
% 6.94/2.32 # Proof object conjectures : 5
% 6.94/2.32 # Proof object clause conjectures : 3
% 6.94/2.32 # Proof object formula conjectures : 2
% 6.94/2.32 # Proof object initial clauses used : 3
% 6.94/2.32 # Proof object initial formulas used : 3
% 6.94/2.32 # Proof object generating inferences : 1
% 6.94/2.32 # Proof object simplifying inferences : 1
% 6.94/2.32 # Training examples: 0 positive, 0 negative
% 6.94/2.32 # Parsed axioms : 84
% 6.94/2.32 # Removed by relevancy pruning/SinE : 0
% 6.94/2.32 # Initial clauses : 84
% 6.94/2.32 # Removed in clause preprocessing : 0
% 6.94/2.32 # Initial clauses in saturation : 84
% 6.94/2.32 # Processed clauses : 22
% 6.94/2.32 # ...of these trivial : 0
% 6.94/2.32 # ...subsumed : 0
% 6.94/2.32 # ...remaining for further processing : 22
% 6.94/2.32 # Other redundant clauses eliminated : 4
% 6.94/2.32 # Clauses deleted for lack of memory : 0
% 6.94/2.32 # Backward-subsumed : 0
% 6.94/2.32 # Backward-rewritten : 0
% 6.94/2.32 # Generated clauses : 18
% 6.94/2.32 # ...of the previous two non-trivial : 11
% 6.94/2.32 # Contextual simplify-reflections : 0
% 6.94/2.32 # Paramodulations : 6
% 6.94/2.32 # Factorizations : 8
% 6.94/2.32 # Equation resolutions : 4
% 6.94/2.32 # Propositional unsat checks : 0
% 6.94/2.32 # Propositional unsat check successes : 0
% 6.94/2.32 # Current number of processed clauses : 20
% 6.94/2.32 # Positive orientable unit clauses : 10
% 6.94/2.32 # Positive unorientable unit clauses: 0
% 6.94/2.32 # Negative unit clauses : 2
% 6.94/2.32 # Non-unit-clauses : 8
% 6.94/2.32 # Current number of unprocessed clauses: 73
% 6.94/2.32 # ...number of literals in the above : 164
% 6.94/2.32 # Current number of archived formulas : 0
% 6.94/2.32 # Current number of archived clauses : 0
% 6.94/2.32 # Clause-clause subsumption calls (NU) : 4
% 6.94/2.32 # Rec. Clause-clause subsumption calls : 4
% 6.94/2.32 # Non-unit clause-clause subsumptions : 0
% 6.94/2.32 # Unit Clause-clause subsumption calls : 2
% 6.94/2.32 # Rewrite failures with RHS unbound : 0
% 6.94/2.32 # BW rewrite match attempts : 0
% 6.94/2.32 # BW rewrite match successes : 0
% 6.94/2.32 # Condensation attempts : 0
% 6.94/2.32 # Condensation successes : 0
% 6.94/2.32 # Termbank termtop insertions : 2164
% 6.94/2.32
% 6.94/2.32 # -------------------------------------------------
% 6.94/2.32 # User time : 0.008 s
% 6.94/2.32 # System time : 0.003 s
% 6.94/2.32 # Total time : 0.011 s
% 6.94/2.32 # ...preprocessing : 0.011 s
% 6.94/2.32 # ...main loop : 0.001 s
% 6.94/2.32 # Maximum resident set size: 7132 pages
% 6.94/2.32
%------------------------------------------------------------------------------