TSTP Solution File: SET062+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET062+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:50 EDT 2022
% Result : Theorem 5.06s 2.27s
% Output : CNFRefutation 5.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 2 nHn; 5 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yk9x9muj/input.p',i_0_4) ).
cnf(i_0_19,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yk9x9muj/input.p',i_0_19) ).
cnf(i_0_24,negated_conjecture,
~ subset(empty_set,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yk9x9muj/input.p',i_0_24) ).
cnf(c_0_28,plain,
~ member(X1,empty_set),
i_0_4 ).
cnf(c_0_29,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
i_0_19 ).
cnf(c_0_30,negated_conjecture,
~ subset(empty_set,esk4_0),
i_0_24 ).
cnf(c_0_31,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET062+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n009.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 : Sun Jul 10 10:19:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.06/2.27 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.06/2.27 # Version: 2.1pre011
% 5.06/2.27 # Preprocessing time : 0.017 s
% 5.06/2.27
% 5.06/2.27 # Proof found!
% 5.06/2.27 # SZS status Theorem
% 5.06/2.27 # SZS output start CNFRefutation
% See solution above
% 5.06/2.27 # Proof object total steps : 8
% 5.06/2.27 # Proof object clause steps : 5
% 5.06/2.27 # Proof object formula steps : 3
% 5.06/2.27 # Proof object conjectures : 3
% 5.06/2.27 # Proof object clause conjectures : 2
% 5.06/2.27 # Proof object formula conjectures : 1
% 5.06/2.27 # Proof object initial clauses used : 3
% 5.06/2.27 # Proof object initial formulas used : 3
% 5.06/2.27 # Proof object generating inferences : 1
% 5.06/2.27 # Proof object simplifying inferences : 2
% 5.06/2.27 # Training examples: 0 positive, 0 negative
% 5.06/2.27 # Parsed axioms : 30
% 5.06/2.27 # Removed by relevancy pruning/SinE : 0
% 5.06/2.27 # Initial clauses : 30
% 5.06/2.27 # Removed in clause preprocessing : 0
% 5.06/2.27 # Initial clauses in saturation : 30
% 5.06/2.27 # Processed clauses : 33
% 5.06/2.27 # ...of these trivial : 0
% 5.06/2.27 # ...subsumed : 0
% 5.06/2.27 # ...remaining for further processing : 33
% 5.06/2.27 # Other redundant clauses eliminated : 3
% 5.06/2.27 # Clauses deleted for lack of memory : 0
% 5.06/2.27 # Backward-subsumed : 0
% 5.06/2.27 # Backward-rewritten : 1
% 5.06/2.27 # Generated clauses : 64
% 5.06/2.27 # ...of the previous two non-trivial : 54
% 5.06/2.27 # Contextual simplify-reflections : 0
% 5.06/2.27 # Paramodulations : 61
% 5.06/2.27 # Factorizations : 0
% 5.06/2.27 # Equation resolutions : 3
% 5.06/2.27 # Propositional unsat checks : 0
% 5.06/2.27 # Propositional unsat check successes : 0
% 5.06/2.27 # Current number of processed clauses : 29
% 5.06/2.27 # Positive orientable unit clauses : 1
% 5.06/2.27 # Positive unorientable unit clauses: 0
% 5.06/2.27 # Negative unit clauses : 3
% 5.06/2.27 # Non-unit-clauses : 25
% 5.06/2.27 # Current number of unprocessed clauses: 51
% 5.06/2.27 # ...number of literals in the above : 114
% 5.06/2.27 # Current number of archived formulas : 0
% 5.06/2.27 # Current number of archived clauses : 1
% 5.06/2.27 # Clause-clause subsumption calls (NU) : 78
% 5.06/2.27 # Rec. Clause-clause subsumption calls : 75
% 5.06/2.27 # Non-unit clause-clause subsumptions : 0
% 5.06/2.27 # Unit Clause-clause subsumption calls : 5
% 5.06/2.27 # Rewrite failures with RHS unbound : 0
% 5.06/2.27 # BW rewrite match attempts : 1
% 5.06/2.27 # BW rewrite match successes : 1
% 5.06/2.27 # Condensation attempts : 0
% 5.06/2.27 # Condensation successes : 0
% 5.06/2.27 # Termbank termtop insertions : 1100
% 5.06/2.27
% 5.06/2.27 # -------------------------------------------------
% 5.06/2.27 # User time : 0.014 s
% 5.06/2.27 # System time : 0.005 s
% 5.06/2.27 # Total time : 0.019 s
% 5.06/2.27 # ...preprocessing : 0.017 s
% 5.06/2.27 # ...main loop : 0.002 s
% 5.06/2.27 # Maximum resident set size: 7132 pages
% 5.06/2.27
%------------------------------------------------------------------------------