TSTP Solution File: SET691+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET691+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:13:29 EDT 2022
% Result : Theorem 7.65s 2.36s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 6 unt; 4 nHn; 13 RR)
% Number of literals : 28 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_24,negated_conjecture,
( equal_set(esk4_0,empty_set)
| subset(esk4_0,empty_set) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kt9rr9gh/input.p',i_0_24) ).
cnf(i_0_7,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kt9rr9gh/input.p',i_0_7) ).
cnf(i_0_25,negated_conjecture,
( ~ equal_set(esk4_0,empty_set)
| ~ subset(esk4_0,empty_set) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kt9rr9gh/input.p',i_0_25) ).
cnf(i_0_4,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kt9rr9gh/input.p',i_0_4) ).
cnf(i_0_19,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kt9rr9gh/input.p',i_0_19) ).
cnf(i_0_5,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kt9rr9gh/input.p',i_0_5) ).
cnf(c_0_32,negated_conjecture,
( equal_set(esk4_0,empty_set)
| subset(esk4_0,empty_set) ),
i_0_24 ).
cnf(c_0_33,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
i_0_7 ).
cnf(c_0_34,negated_conjecture,
( ~ equal_set(esk4_0,empty_set)
| ~ subset(esk4_0,empty_set) ),
i_0_25 ).
cnf(c_0_35,negated_conjecture,
subset(esk4_0,empty_set),
inference(csr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
~ member(X1,empty_set),
i_0_4 ).
cnf(c_0_37,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
i_0_19 ).
cnf(c_0_38,negated_conjecture,
~ equal_set(esk4_0,empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_39,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_5 ).
cnf(c_0_40,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_35])]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET691+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 06:12:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.65/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.65/2.36 # Version: 2.1pre011
% 7.65/2.36 # Preprocessing time : 0.016 s
% 7.65/2.36
% 7.65/2.36 # Proof found!
% 7.65/2.36 # SZS status Theorem
% 7.65/2.36 # SZS output start CNFRefutation
% See solution above
% 7.65/2.36 # Proof object total steps : 16
% 7.65/2.36 # Proof object clause steps : 10
% 7.65/2.36 # Proof object formula steps : 6
% 7.65/2.36 # Proof object conjectures : 6
% 7.65/2.36 # Proof object clause conjectures : 4
% 7.65/2.36 # Proof object formula conjectures : 2
% 7.65/2.36 # Proof object initial clauses used : 6
% 7.65/2.36 # Proof object initial formulas used : 6
% 7.65/2.36 # Proof object generating inferences : 2
% 7.65/2.36 # Proof object simplifying inferences : 7
% 7.65/2.36 # Training examples: 0 positive, 0 negative
% 7.65/2.36 # Parsed axioms : 31
% 7.65/2.36 # Removed by relevancy pruning/SinE : 0
% 7.65/2.36 # Initial clauses : 31
% 7.65/2.36 # Removed in clause preprocessing : 0
% 7.65/2.36 # Initial clauses in saturation : 31
% 7.65/2.36 # Processed clauses : 34
% 7.65/2.36 # ...of these trivial : 0
% 7.65/2.36 # ...subsumed : 0
% 7.65/2.36 # ...remaining for further processing : 33
% 7.65/2.36 # Other redundant clauses eliminated : 3
% 7.65/2.36 # Clauses deleted for lack of memory : 0
% 7.65/2.36 # Backward-subsumed : 0
% 7.65/2.36 # Backward-rewritten : 1
% 7.65/2.36 # Generated clauses : 60
% 7.65/2.36 # ...of the previous two non-trivial : 52
% 7.65/2.36 # Contextual simplify-reflections : 1
% 7.65/2.36 # Paramodulations : 57
% 7.65/2.36 # Factorizations : 0
% 7.65/2.36 # Equation resolutions : 3
% 7.65/2.36 # Propositional unsat checks : 0
% 7.65/2.36 # Propositional unsat check successes : 0
% 7.65/2.36 # Current number of processed clauses : 29
% 7.65/2.36 # Positive orientable unit clauses : 2
% 7.65/2.36 # Positive unorientable unit clauses: 0
% 7.65/2.36 # Negative unit clauses : 2
% 7.65/2.36 # Non-unit-clauses : 25
% 7.65/2.36 # Current number of unprocessed clauses: 49
% 7.65/2.36 # ...number of literals in the above : 113
% 7.65/2.36 # Current number of archived formulas : 0
% 7.65/2.36 # Current number of archived clauses : 1
% 7.65/2.36 # Clause-clause subsumption calls (NU) : 171
% 7.65/2.36 # Rec. Clause-clause subsumption calls : 164
% 7.65/2.36 # Non-unit clause-clause subsumptions : 1
% 7.65/2.36 # Unit Clause-clause subsumption calls : 0
% 7.65/2.36 # Rewrite failures with RHS unbound : 0
% 7.65/2.36 # BW rewrite match attempts : 1
% 7.65/2.36 # BW rewrite match successes : 1
% 7.65/2.36 # Condensation attempts : 0
% 7.65/2.36 # Condensation successes : 0
% 7.65/2.36 # Termbank termtop insertions : 1107
% 7.65/2.36
% 7.65/2.36 # -------------------------------------------------
% 7.65/2.36 # User time : 0.016 s
% 7.65/2.36 # System time : 0.002 s
% 7.65/2.36 # Total time : 0.018 s
% 7.65/2.36 # ...preprocessing : 0.016 s
% 7.65/2.36 # ...main loop : 0.002 s
% 7.65/2.36 # Maximum resident set size: 7128 pages
% 7.65/2.36
%------------------------------------------------------------------------------