TSTP Solution File: SET027+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET027+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:21 EDT 2022
% Result : Theorem 8.99s 2.59s
% Output : CNFRefutation 8.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 7 unt; 3 nHn; 14 RR)
% Number of literals : 29 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cntnctev/input.p',i_0_20) ).
cnf(i_0_25,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cntnctev/input.p',i_0_25) ).
cnf(i_0_26,negated_conjecture,
subset(esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cntnctev/input.p',i_0_26) ).
cnf(i_0_18,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cntnctev/input.p',i_0_18) ).
cnf(i_0_19,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cntnctev/input.p',i_0_19) ).
cnf(i_0_24,negated_conjecture,
~ subset(esk4_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cntnctev/input.p',i_0_24) ).
cnf(c_0_33,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
i_0_20 ).
cnf(c_0_34,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_25 ).
cnf(c_0_35,negated_conjecture,
subset(esk4_0,esk5_0),
i_0_26 ).
cnf(c_0_36,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
i_0_18 ).
cnf(c_0_37,negated_conjecture,
( member(X1,esk6_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( member(X1,esk5_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_39,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
i_0_19 ).
cnf(c_0_40,plain,
( subset(X1,esk6_0)
| ~ member(esk2_2(X1,esk6_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( member(esk2_2(esk4_0,X1),esk5_0)
| subset(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
~ subset(esk4_0,esk6_0),
i_0_24 ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET027+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n014.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 08:51:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.99/2.59 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.99/2.59 # Version: 2.1pre011
% 8.99/2.59 # Preprocessing time : 0.011 s
% 8.99/2.59
% 8.99/2.59 # Proof found!
% 8.99/2.59 # SZS status Theorem
% 8.99/2.59 # SZS output start CNFRefutation
% See solution above
% 8.99/2.59 # Proof object total steps : 17
% 8.99/2.59 # Proof object clause steps : 11
% 8.99/2.59 # Proof object formula steps : 6
% 8.99/2.59 # Proof object conjectures : 8
% 8.99/2.59 # Proof object clause conjectures : 5
% 8.99/2.59 # Proof object formula conjectures : 3
% 8.99/2.59 # Proof object initial clauses used : 6
% 8.99/2.59 # Proof object initial formulas used : 6
% 8.99/2.59 # Proof object generating inferences : 5
% 8.99/2.59 # Proof object simplifying inferences : 1
% 8.99/2.59 # Training examples: 0 positive, 0 negative
% 8.99/2.59 # Parsed axioms : 32
% 8.99/2.59 # Removed by relevancy pruning/SinE : 0
% 8.99/2.59 # Initial clauses : 32
% 8.99/2.59 # Removed in clause preprocessing : 0
% 8.99/2.59 # Initial clauses in saturation : 32
% 8.99/2.59 # Processed clauses : 50
% 8.99/2.59 # ...of these trivial : 0
% 8.99/2.59 # ...subsumed : 1
% 8.99/2.59 # ...remaining for further processing : 49
% 8.99/2.59 # Other redundant clauses eliminated : 3
% 8.99/2.59 # Clauses deleted for lack of memory : 0
% 8.99/2.59 # Backward-subsumed : 0
% 8.99/2.59 # Backward-rewritten : 0
% 8.99/2.59 # Generated clauses : 107
% 8.99/2.59 # ...of the previous two non-trivial : 93
% 8.99/2.59 # Contextual simplify-reflections : 0
% 8.99/2.59 # Paramodulations : 104
% 8.99/2.59 # Factorizations : 0
% 8.99/2.59 # Equation resolutions : 3
% 8.99/2.59 # Propositional unsat checks : 0
% 8.99/2.59 # Propositional unsat check successes : 0
% 8.99/2.59 # Current number of processed clauses : 46
% 8.99/2.59 # Positive orientable unit clauses : 8
% 8.99/2.59 # Positive unorientable unit clauses: 0
% 8.99/2.59 # Negative unit clauses : 5
% 8.99/2.59 # Non-unit-clauses : 33
% 8.99/2.59 # Current number of unprocessed clauses: 73
% 8.99/2.59 # ...number of literals in the above : 156
% 8.99/2.59 # Current number of archived formulas : 0
% 8.99/2.59 # Current number of archived clauses : 0
% 8.99/2.59 # Clause-clause subsumption calls (NU) : 101
% 8.99/2.59 # Rec. Clause-clause subsumption calls : 98
% 8.99/2.59 # Non-unit clause-clause subsumptions : 0
% 8.99/2.59 # Unit Clause-clause subsumption calls : 31
% 8.99/2.59 # Rewrite failures with RHS unbound : 0
% 8.99/2.59 # BW rewrite match attempts : 11
% 8.99/2.59 # BW rewrite match successes : 0
% 8.99/2.59 # Condensation attempts : 0
% 8.99/2.59 # Condensation successes : 0
% 8.99/2.59 # Termbank termtop insertions : 1572
% 8.99/2.59
% 8.99/2.59 # -------------------------------------------------
% 8.99/2.59 # User time : 0.010 s
% 8.99/2.59 # System time : 0.002 s
% 8.99/2.59 # Total time : 0.012 s
% 8.99/2.59 # ...preprocessing : 0.011 s
% 8.99/2.59 # ...main loop : 0.002 s
% 8.99/2.59 # Maximum resident set size: 7132 pages
% 8.99/2.59
%------------------------------------------------------------------------------