TSTP Solution File: ITP004+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ITP004+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 : Sat Jul 16 22:33:57 EDT 2022
% Result : Theorem 9.66s 2.53s
% Output : CNFRefutation 9.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 11 unt; 8 nHn; 34 RR)
% Number of literals : 96 ( 2 equ; 57 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| p(ap(ap(c_2Ebool_2EIN(X1),esk2_3(X1,X2,X3)),X2))
| ~ ne(X1)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_18) ).
cnf(i_0_28,negated_conjecture,
mem(esk4_0,arr(esk3_0,bool)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_28) ).
cnf(i_0_29,negated_conjecture,
ne(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_29) ).
cnf(i_0_1,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_1) ).
cnf(i_0_43,plain,
( mem(c_2Epred__set_2EREST(X1),arr(arr(X1,bool),arr(X1,bool)))
| ~ ne(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_43) ).
cnf(i_0_19,plain,
( mem(esk2_3(X1,X2,X3),X1)
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| ~ ne(X1)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_19) ).
cnf(i_0_41,plain,
( mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1))
| ~ ne(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_41) ).
cnf(i_0_26,plain,
( p(ap(ap(c_2Ebool_2EIN(X1),X2),X3))
| ~ ne(X1)
| ~ mem(X4,X1)
| ~ mem(X2,X1)
| ~ mem(X3,arr(X1,bool))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_26) ).
cnf(i_0_16,plain,
( ap(ap(c_2Epred__set_2EDELETE(X1),X2),ap(c_2Epred__set_2ECHOICE(X1),X2)) = ap(c_2Epred__set_2EREST(X1),X2)
| ~ ne(X1)
| ~ mem(X2,arr(X1,bool)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_16) ).
cnf(i_0_27,negated_conjecture,
~ p(ap(ap(c_2Epred__set_2ESUBSET(esk3_0),ap(c_2Epred__set_2EREST(esk3_0),esk4_0)),esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_27) ).
cnf(i_0_17,plain,
( p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| ~ ne(X1)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),esk2_3(X1,X2,X3)),X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-on6yiti_/input.p',i_0_17) ).
cnf(c_0_55,plain,
( p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| p(ap(ap(c_2Ebool_2EIN(X1),esk2_3(X1,X2,X3)),X2))
| ~ ne(X1)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool)) ),
i_0_18 ).
cnf(c_0_56,negated_conjecture,
mem(esk4_0,arr(esk3_0,bool)),
i_0_28 ).
cnf(c_0_57,negated_conjecture,
ne(esk3_0),
i_0_29 ).
cnf(c_0_58,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
i_0_1 ).
cnf(c_0_59,plain,
( mem(c_2Epred__set_2EREST(X1),arr(arr(X1,bool),arr(X1,bool)))
| ~ ne(X1) ),
i_0_43 ).
cnf(c_0_60,plain,
( mem(esk2_3(X1,X2,X3),X1)
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| ~ ne(X1)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool)) ),
i_0_19 ).
cnf(c_0_61,plain,
( mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1))
| ~ ne(X1) ),
i_0_41 ).
cnf(c_0_62,negated_conjecture,
( p(ap(ap(c_2Ebool_2EIN(esk3_0),esk2_3(esk3_0,X1,esk4_0)),X1))
| p(ap(ap(c_2Epred__set_2ESUBSET(esk3_0),X1),esk4_0))
| ~ mem(X1,arr(esk3_0,bool)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_63,plain,
( mem(ap(c_2Epred__set_2EREST(X1),X2),arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( p(ap(ap(c_2Epred__set_2ESUBSET(esk3_0),X1),esk4_0))
| mem(esk2_3(esk3_0,X1,esk4_0),esk3_0)
| ~ mem(X1,arr(esk3_0,bool)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_56]),c_0_57])]) ).
cnf(c_0_65,plain,
( p(ap(ap(c_2Ebool_2EIN(X1),X2),X3))
| ~ ne(X1)
| ~ mem(X4,X1)
| ~ mem(X2,X1)
| ~ mem(X3,arr(X1,bool))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4))) ),
i_0_26 ).
cnf(c_0_66,plain,
( ap(ap(c_2Epred__set_2EDELETE(X1),X2),ap(c_2Epred__set_2ECHOICE(X1),X2)) = ap(c_2Epred__set_2EREST(X1),X2)
| ~ ne(X1)
| ~ mem(X2,arr(X1,bool)) ),
i_0_16 ).
cnf(c_0_67,plain,
( mem(ap(c_2Epred__set_2ECHOICE(X1),X2),X1)
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_61]) ).
cnf(c_0_68,plain,
( p(ap(ap(c_2Ebool_2EIN(esk3_0),esk2_3(esk3_0,ap(c_2Epred__set_2EREST(esk3_0),X1),esk4_0)),ap(c_2Epred__set_2EREST(esk3_0),X1)))
| p(ap(ap(c_2Epred__set_2ESUBSET(esk3_0),ap(c_2Epred__set_2EREST(esk3_0),X1)),esk4_0))
| ~ mem(X1,arr(esk3_0,bool)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_57])]) ).
cnf(c_0_69,negated_conjecture,
~ p(ap(ap(c_2Epred__set_2ESUBSET(esk3_0),ap(c_2Epred__set_2EREST(esk3_0),esk4_0)),esk4_0)),
i_0_27 ).
cnf(c_0_70,plain,
( p(ap(ap(c_2Epred__set_2ESUBSET(esk3_0),ap(c_2Epred__set_2EREST(esk3_0),X1)),esk4_0))
| mem(esk2_3(esk3_0,ap(c_2Epred__set_2EREST(esk3_0),X1),esk4_0),esk3_0)
| ~ mem(X1,arr(esk3_0,bool)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_63]),c_0_57])]) ).
cnf(c_0_71,plain,
( p(ap(ap(c_2Ebool_2EIN(X1),X2),X3))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(c_2Epred__set_2EREST(X1),X3)))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,X1)
| ~ ne(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_72,negated_conjecture,
p(ap(ap(c_2Ebool_2EIN(esk3_0),esk2_3(esk3_0,ap(c_2Epred__set_2EREST(esk3_0),esk4_0),esk4_0)),ap(c_2Epred__set_2EREST(esk3_0),esk4_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_56]),c_0_69]) ).
cnf(c_0_73,negated_conjecture,
mem(esk2_3(esk3_0,ap(c_2Epred__set_2EREST(esk3_0),esk4_0),esk4_0),esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_56]),c_0_69]) ).
cnf(c_0_74,plain,
( p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| ~ ne(X1)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),esk2_3(X1,X2,X3)),X3)) ),
i_0_17 ).
cnf(c_0_75,plain,
p(ap(ap(c_2Ebool_2EIN(esk3_0),esk2_3(esk3_0,ap(c_2Epred__set_2EREST(esk3_0),esk4_0),esk4_0)),esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_56]),c_0_73]),c_0_57])]) ).
cnf(c_0_76,plain,
~ mem(ap(c_2Epred__set_2EREST(esk3_0),esk4_0),arr(esk3_0,bool)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_56]),c_0_57])]),c_0_69]) ).
cnf(c_0_77,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_63]),c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : ITP004+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.00/0.07 % Command : enigmatic-eprover.py %s %d 1
% 0.06/0.25 % Computer : n027.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Fri Jun 3 02:26:52 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.10/0.35 # ENIGMATIC: Selected SinE mode:
% 0.10/0.36 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.10/0.36 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.10/0.36 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.66/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.66/2.53 # Version: 2.1pre011
% 9.66/2.53 # Preprocessing time : 0.012 s
% 9.66/2.53
% 9.66/2.53 # Proof found!
% 9.66/2.53 # SZS status Theorem
% 9.66/2.53 # SZS output start CNFRefutation
% See solution above
% 9.66/2.53 # Proof object total steps : 34
% 9.66/2.53 # Proof object clause steps : 23
% 9.66/2.53 # Proof object formula steps : 11
% 9.66/2.53 # Proof object conjectures : 10
% 9.66/2.53 # Proof object clause conjectures : 7
% 9.66/2.53 # Proof object formula conjectures : 3
% 9.66/2.53 # Proof object initial clauses used : 11
% 9.66/2.53 # Proof object initial formulas used : 11
% 9.66/2.53 # Proof object generating inferences : 12
% 9.66/2.53 # Proof object simplifying inferences : 22
% 9.66/2.53 # Training examples: 0 positive, 0 negative
% 9.66/2.53 # Parsed axioms : 44
% 9.66/2.53 # Removed by relevancy pruning/SinE : 0
% 9.66/2.53 # Initial clauses : 44
% 9.66/2.53 # Removed in clause preprocessing : 0
% 9.66/2.53 # Initial clauses in saturation : 44
% 9.66/2.53 # Processed clauses : 800
% 9.66/2.53 # ...of these trivial : 4
% 9.66/2.53 # ...subsumed : 154
% 9.66/2.53 # ...remaining for further processing : 642
% 9.66/2.53 # Other redundant clauses eliminated : 4
% 9.66/2.53 # Clauses deleted for lack of memory : 0
% 9.66/2.53 # Backward-subsumed : 45
% 9.66/2.53 # Backward-rewritten : 31
% 9.66/2.53 # Generated clauses : 5676
% 9.66/2.53 # ...of the previous two non-trivial : 5385
% 9.66/2.53 # Contextual simplify-reflections : 105
% 9.66/2.53 # Paramodulations : 5581
% 9.66/2.53 # Factorizations : 84
% 9.66/2.53 # Equation resolutions : 11
% 9.66/2.53 # Propositional unsat checks : 0
% 9.66/2.53 # Propositional unsat check successes : 0
% 9.66/2.53 # Current number of processed clauses : 564
% 9.66/2.53 # Positive orientable unit clauses : 15
% 9.66/2.53 # Positive unorientable unit clauses: 0
% 9.66/2.53 # Negative unit clauses : 2
% 9.66/2.53 # Non-unit-clauses : 547
% 9.66/2.53 # Current number of unprocessed clauses: 4426
% 9.66/2.53 # ...number of literals in the above : 20709
% 9.66/2.53 # Current number of archived formulas : 0
% 9.66/2.53 # Current number of archived clauses : 76
% 9.66/2.53 # Clause-clause subsumption calls (NU) : 28713
% 9.66/2.53 # Rec. Clause-clause subsumption calls : 5531
% 9.66/2.53 # Non-unit clause-clause subsumptions : 286
% 9.66/2.53 # Unit Clause-clause subsumption calls : 287
% 9.66/2.53 # Rewrite failures with RHS unbound : 0
% 9.66/2.53 # BW rewrite match attempts : 122
% 9.66/2.53 # BW rewrite match successes : 5
% 9.66/2.53 # Condensation attempts : 0
% 9.66/2.53 # Condensation successes : 0
% 9.66/2.53 # Termbank termtop insertions : 206584
% 9.66/2.53
% 9.66/2.53 # -------------------------------------------------
% 9.66/2.53 # User time : 0.175 s
% 9.66/2.53 # System time : 0.007 s
% 9.66/2.53 # Total time : 0.182 s
% 9.66/2.53 # ...preprocessing : 0.012 s
% 9.66/2.53 # ...main loop : 0.170 s
% 9.66/2.53 # Maximum resident set size: 10520 pages
% 9.66/2.53
%------------------------------------------------------------------------------