TSTP Solution File: SET019+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET019+4 : TPTP v8.1.0. Released v2.2.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:11 EDT 2022
% Result : Theorem 7.64s 2.43s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_24,negated_conjecture,
~ equal_set(esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zo9m5kcj/input.p',i_0_24) ).
cnf(i_0_5,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zo9m5kcj/input.p',i_0_5) ).
cnf(i_0_25,negated_conjecture,
subset(esk5_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zo9m5kcj/input.p',i_0_25) ).
cnf(i_0_26,negated_conjecture,
subset(esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zo9m5kcj/input.p',i_0_26) ).
cnf(c_0_31,negated_conjecture,
~ equal_set(esk4_0,esk5_0),
i_0_24 ).
cnf(c_0_32,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_5 ).
cnf(c_0_33,negated_conjecture,
subset(esk5_0,esk4_0),
i_0_25 ).
cnf(c_0_34,negated_conjecture,
subset(esk4_0,esk5_0),
i_0_26 ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET019+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Mon Jul 11 08:39:03 EDT 2022
% 0.13/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
% 7.64/2.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.64/2.43 # Version: 2.1pre011
% 7.64/2.43 # Preprocessing time : 0.016 s
% 7.64/2.43
% 7.64/2.43 # Proof found!
% 7.64/2.43 # SZS status Theorem
% 7.64/2.43 # SZS output start CNFRefutation
% See solution above
% 7.64/2.43 # Proof object total steps : 9
% 7.64/2.43 # Proof object clause steps : 5
% 7.64/2.43 # Proof object formula steps : 4
% 7.64/2.43 # Proof object conjectures : 7
% 7.64/2.43 # Proof object clause conjectures : 4
% 7.64/2.43 # Proof object formula conjectures : 3
% 7.64/2.43 # Proof object initial clauses used : 4
% 7.64/2.43 # Proof object initial formulas used : 4
% 7.64/2.43 # Proof object generating inferences : 1
% 7.64/2.43 # Proof object simplifying inferences : 3
% 7.64/2.43 # Training examples: 0 positive, 0 negative
% 7.64/2.43 # Parsed axioms : 32
% 7.64/2.43 # Removed by relevancy pruning/SinE : 0
% 7.64/2.43 # Initial clauses : 32
% 7.64/2.43 # Removed in clause preprocessing : 0
% 7.64/2.43 # Initial clauses in saturation : 32
% 7.64/2.43 # Processed clauses : 9
% 7.64/2.43 # ...of these trivial : 0
% 7.64/2.43 # ...subsumed : 0
% 7.64/2.43 # ...remaining for further processing : 9
% 7.64/2.43 # Other redundant clauses eliminated : 1
% 7.64/2.43 # Clauses deleted for lack of memory : 0
% 7.64/2.43 # Backward-subsumed : 0
% 7.64/2.43 # Backward-rewritten : 0
% 7.64/2.43 # Generated clauses : 4
% 7.64/2.43 # ...of the previous two non-trivial : 1
% 7.64/2.43 # Contextual simplify-reflections : 0
% 7.64/2.43 # Paramodulations : 3
% 7.64/2.43 # Factorizations : 0
% 7.64/2.43 # Equation resolutions : 1
% 7.64/2.43 # Propositional unsat checks : 0
% 7.64/2.43 # Propositional unsat check successes : 0
% 7.64/2.43 # Current number of processed clauses : 8
% 7.64/2.43 # Positive orientable unit clauses : 2
% 7.64/2.43 # Positive unorientable unit clauses: 0
% 7.64/2.43 # Negative unit clauses : 2
% 7.64/2.43 # Non-unit-clauses : 4
% 7.64/2.43 # Current number of unprocessed clauses: 24
% 7.64/2.43 # ...number of literals in the above : 54
% 7.64/2.43 # Current number of archived formulas : 0
% 7.64/2.43 # Current number of archived clauses : 0
% 7.64/2.43 # Clause-clause subsumption calls (NU) : 2
% 7.64/2.43 # Rec. Clause-clause subsumption calls : 2
% 7.64/2.43 # Non-unit clause-clause subsumptions : 0
% 7.64/2.43 # Unit Clause-clause subsumption calls : 0
% 7.64/2.43 # Rewrite failures with RHS unbound : 0
% 7.64/2.43 # BW rewrite match attempts : 0
% 7.64/2.43 # BW rewrite match successes : 0
% 7.64/2.43 # Condensation attempts : 0
% 7.64/2.43 # Condensation successes : 0
% 7.64/2.43 # Termbank termtop insertions : 449
% 7.64/2.43
% 7.64/2.43 # -------------------------------------------------
% 7.64/2.43 # User time : 0.016 s
% 7.64/2.43 # System time : 0.001 s
% 7.64/2.43 # Total time : 0.017 s
% 7.64/2.43 # ...preprocessing : 0.016 s
% 7.64/2.43 # ...main loop : 0.000 s
% 7.64/2.43 # Maximum resident set size: 7128 pages
% 7.64/2.43
%------------------------------------------------------------------------------