%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET347+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:11:08 EDT 2022
% Result : Theorem 6.52s 2.28s
% Output : CNFRefutation 6.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 8 unt; 2 nHn; 11 RR)
% Number of literals : 24 ( 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 : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 17 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lr0n8b7k/input.p',i_0_4) ).
cnf(i_0_23,plain,
( member(esk3_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lr0n8b7k/input.p',i_0_23) ).
cnf(i_0_24,negated_conjecture,
~ equal_set(sum(empty_set),empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lr0n8b7k/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-lr0n8b7k/input.p',i_0_5) ).
cnf(i_0_19,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lr0n8b7k/input.p',i_0_19) ).
cnf(c_0_30,plain,
~ member(X1,empty_set),
i_0_4 ).
cnf(c_0_31,plain,
( member(esk3_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
i_0_23 ).
cnf(c_0_32,negated_conjecture,
~ equal_set(sum(empty_set),empty_set),
i_0_24 ).
cnf(c_0_33,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_5 ).
cnf(c_0_34,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
i_0_19 ).
cnf(c_0_35,plain,
~ member(X1,sum(empty_set)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( ~ subset(empty_set,sum(empty_set))
| ~ subset(sum(empty_set),empty_set) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_30,c_0_34]) ).
cnf(c_0_38,plain,
subset(sum(empty_set),X1),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET347+4 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n013.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 03:07:16 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # 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
% 6.52/2.28 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.52/2.28 # Version: 2.1pre011
% 6.52/2.28 # Preprocessing time : 0.009 s
% 6.52/2.28
% 6.52/2.28 # Proof found!
% 6.52/2.28 # SZS status Theorem
% 6.52/2.28 # SZS output start CNFRefutation
% See solution above
% 6.52/2.28 # Proof object total steps : 15
% 6.52/2.28 # Proof object clause steps : 10
% 6.52/2.28 # Proof object formula steps : 5
% 6.52/2.28 # Proof object conjectures : 4
% 6.52/2.28 # Proof object clause conjectures : 3
% 6.52/2.28 # Proof object formula conjectures : 1
% 6.52/2.28 # Proof object initial clauses used : 5
% 6.52/2.28 # Proof object initial formulas used : 5
% 6.52/2.28 # Proof object generating inferences : 4
% 6.52/2.28 # Proof object simplifying inferences : 4
% 6.52/2.28 # Training examples: 0 positive, 0 negative
% 6.52/2.28 # Parsed axioms : 30
% 6.52/2.28 # Removed by relevancy pruning/SinE : 0
% 6.52/2.28 # Initial clauses : 30
% 6.52/2.28 # Removed in clause preprocessing : 0
% 6.52/2.28 # Initial clauses in saturation : 30
% 6.52/2.28 # Processed clauses : 37
% 6.52/2.28 # ...of these trivial : 0
% 6.52/2.28 # ...subsumed : 0
% 6.52/2.28 # ...remaining for further processing : 36
% 6.52/2.28 # Other redundant clauses eliminated : 3
% 6.52/2.28 # Clauses deleted for lack of memory : 0
% 6.52/2.28 # Backward-subsumed : 0
% 6.52/2.28 # Backward-rewritten : 1
% 6.52/2.28 # Generated clauses : 90
% 6.52/2.28 # ...of the previous two non-trivial : 82
% 6.52/2.28 # Contextual simplify-reflections : 0
% 6.52/2.28 # Paramodulations : 87
% 6.52/2.28 # Factorizations : 0
% 6.52/2.28 # Equation resolutions : 3
% 6.52/2.28 # Propositional unsat checks : 0
% 6.52/2.28 # Propositional unsat check successes : 0
% 6.52/2.28 # Current number of processed clauses : 32
% 6.52/2.28 # Positive orientable unit clauses : 2
% 6.52/2.28 # Positive unorientable unit clauses: 0
% 6.52/2.28 # Negative unit clauses : 3
% 6.52/2.28 # Non-unit-clauses : 27
% 6.52/2.28 # Current number of unprocessed clauses: 75
% 6.52/2.28 # ...number of literals in the above : 180
% 6.52/2.28 # Current number of archived formulas : 0
% 6.52/2.28 # Current number of archived clauses : 1
% 6.52/2.28 # Clause-clause subsumption calls (NU) : 96
% 6.52/2.28 # Rec. Clause-clause subsumption calls : 89
% 6.52/2.28 # Non-unit clause-clause subsumptions : 0
% 6.52/2.28 # Unit Clause-clause subsumption calls : 6
% 6.52/2.28 # Rewrite failures with RHS unbound : 0
% 6.52/2.28 # BW rewrite match attempts : 1
% 6.52/2.28 # BW rewrite match successes : 1
% 6.52/2.28 # Condensation attempts : 0
% 6.52/2.28 # Condensation successes : 0
% 6.52/2.28 # Termbank termtop insertions : 1388
% 6.52/2.28
% 6.52/2.28 # -------------------------------------------------
% 6.52/2.28 # User time : 0.009 s
% 6.52/2.28 # System time : 0.002 s
% 6.52/2.28 # Total time : 0.011 s
% 6.52/2.28 # ...preprocessing : 0.009 s
% 6.52/2.28 # ...main loop : 0.001 s
% 6.52/2.28 # Maximum resident set size: 7128 pages
% 6.52/2.28
%------------------------------------------------------------------------------