TSTP Solution File: ITP005+5 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ITP005+5 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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:45:45 EDT 2022
% Result : Theorem 0.52s 1.69s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 60 ( 19 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 57 ( 22 ~; 18 |; 3 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2Eset__relation_2Erel__to__reln__inv,conjecture,
! [X9] :
( ne(X9)
=> ! [X11] :
( ne(X11)
=> ! [X178] :
( mem(X178,arr(X9,arr(X11,bool)))
=> ap(c_2Eset__relation_2Ereln__to__rel(X9,X11),ap(c_2Eset__relation_2Erel__to__reln(X9,X11),X178)) = X178 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj_thm_2Eset__relation_2Erel__to__reln__inv) ).
fof(conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY,axiom,
! [X9] :
( ne(X9)
=> ! [X11] :
( ne(X11)
=> c_2Eset__relation_2Erel__to__reln(X9,X11) = c_2Epair_2EUNCURRY(X9,X11,bool) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY) ).
fof(conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY,axiom,
! [X9] :
( ne(X9)
=> ! [X11] :
( ne(X11)
=> c_2Eset__relation_2Ereln__to__rel(X9,X11) = c_2Epair_2ECURRY(X9,X11,bool) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY) ).
fof(conj_thm_2Epair_2ECURRY__UNCURRY__THM,axiom,
! [X9] :
( ne(X9)
=> ! [X11] :
( ne(X11)
=> ! [X59] :
( ne(X59)
=> ! [X19] :
( mem(X19,arr(X9,arr(X11,X59)))
=> ap(c_2Epair_2ECURRY(X9,X11,X59),ap(c_2Epair_2EUNCURRY(X9,X11,X59),X19)) = X19 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP014+5.ax',conj_thm_2Epair_2ECURRY__UNCURRY__THM) ).
fof(bool_ne,axiom,
ne(bool),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',bool_ne) ).
fof(c_0_5,negated_conjecture,
~ ! [X9] :
( ne(X9)
=> ! [X11] :
( ne(X11)
=> ! [X178] :
( mem(X178,arr(X9,arr(X11,bool)))
=> ap(c_2Eset__relation_2Ereln__to__rel(X9,X11),ap(c_2Eset__relation_2Erel__to__reln(X9,X11),X178)) = X178 ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Eset__relation_2Erel__to__reln__inv]) ).
fof(c_0_6,plain,
! [X12,X13] :
( ~ ne(X12)
| ~ ne(X13)
| c_2Eset__relation_2Erel__to__reln(X12,X13) = c_2Epair_2EUNCURRY(X12,X13,bool) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY])])])])]) ).
fof(c_0_7,negated_conjecture,
( ne(esk1_0)
& ne(esk2_0)
& mem(esk3_0,arr(esk1_0,arr(esk2_0,bool)))
& ap(c_2Eset__relation_2Ereln__to__rel(esk1_0,esk2_0),ap(c_2Eset__relation_2Erel__to__reln(esk1_0,esk2_0),esk3_0)) != esk3_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_8,plain,
( c_2Eset__relation_2Erel__to__reln(X1,X2) = c_2Epair_2EUNCURRY(X1,X2,bool)
| ~ ne(X2)
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
ne(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X12,X13] :
( ~ ne(X12)
| ~ ne(X13)
| c_2Eset__relation_2Ereln__to__rel(X12,X13) = c_2Epair_2ECURRY(X12,X13,bool) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY])])])])]) ).
cnf(c_0_11,negated_conjecture,
( c_2Eset__relation_2Erel__to__reln(X1,esk2_0) = c_2Epair_2EUNCURRY(X1,esk2_0,bool)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
ne(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( c_2Eset__relation_2Ereln__to__rel(X1,X2) = c_2Epair_2ECURRY(X1,X2,bool)
| ~ ne(X2)
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X60,X61,X62,X63] :
( ~ ne(X60)
| ~ ne(X61)
| ~ ne(X62)
| ~ mem(X63,arr(X60,arr(X61,X62)))
| ap(c_2Epair_2ECURRY(X60,X61,X62),ap(c_2Epair_2EUNCURRY(X60,X61,X62),X63)) = X63 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Epair_2ECURRY__UNCURRY__THM])])])])]) ).
cnf(c_0_15,negated_conjecture,
ap(c_2Eset__relation_2Ereln__to__rel(esk1_0,esk2_0),ap(c_2Eset__relation_2Erel__to__reln(esk1_0,esk2_0),esk3_0)) != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
c_2Eset__relation_2Erel__to__reln(esk1_0,esk2_0) = c_2Epair_2EUNCURRY(esk1_0,esk2_0,bool),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( c_2Eset__relation_2Ereln__to__rel(X1,esk2_0) = c_2Epair_2ECURRY(X1,esk2_0,bool)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_18,plain,
( ap(c_2Epair_2ECURRY(X1,X2,X3),ap(c_2Epair_2EUNCURRY(X1,X2,X3),X4)) = X4
| ~ mem(X4,arr(X1,arr(X2,X3)))
| ~ ne(X3)
| ~ ne(X2)
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
mem(esk3_0,arr(esk1_0,arr(esk2_0,bool))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
ne(bool),
inference(split_conjunct,[status(thm)],[bool_ne]) ).
cnf(c_0_21,negated_conjecture,
ap(c_2Eset__relation_2Ereln__to__rel(esk1_0,esk2_0),ap(c_2Epair_2EUNCURRY(esk1_0,esk2_0,bool),esk3_0)) != esk3_0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
c_2Eset__relation_2Ereln__to__rel(esk1_0,esk2_0) = c_2Epair_2ECURRY(esk1_0,esk2_0,bool),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
ap(c_2Epair_2ECURRY(esk1_0,esk2_0,bool),ap(c_2Epair_2EUNCURRY(esk1_0,esk2_0,bool),esk3_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_9]),c_0_12])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ITP005+5 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n022.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 : Thu Jun 2 11:40:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.52/1.69 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.52/1.69 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.52/1.69 # Preprocessing time : 0.216 s
% 0.52/1.69
% 0.52/1.69 # Proof found!
% 0.52/1.69 # SZS status Theorem
% 0.52/1.69 # SZS output start CNFRefutation
% See solution above
% 0.52/1.69 # Proof object total steps : 25
% 0.52/1.69 # Proof object clause steps : 15
% 0.52/1.69 # Proof object formula steps : 10
% 0.52/1.69 # Proof object conjectures : 14
% 0.52/1.69 # Proof object clause conjectures : 11
% 0.52/1.69 # Proof object formula conjectures : 3
% 0.52/1.69 # Proof object initial clauses used : 8
% 0.52/1.69 # Proof object initial formulas used : 5
% 0.52/1.69 # Proof object generating inferences : 5
% 0.52/1.69 # Proof object simplifying inferences : 8
% 0.52/1.69 # Training examples: 0 positive, 0 negative
% 0.52/1.69 # Parsed axioms : 3163
% 0.52/1.69 # Removed by relevancy pruning/SinE : 2965
% 0.52/1.69 # Initial clauses : 1168
% 0.52/1.69 # Removed in clause preprocessing : 787
% 0.52/1.69 # Initial clauses in saturation : 381
% 0.52/1.69 # Processed clauses : 755
% 0.52/1.69 # ...of these trivial : 0
% 0.52/1.69 # ...subsumed : 28
% 0.52/1.69 # ...remaining for further processing : 727
% 0.52/1.69 # Other redundant clauses eliminated : 4
% 0.52/1.69 # Clauses deleted for lack of memory : 0
% 0.52/1.69 # Backward-subsumed : 0
% 0.52/1.69 # Backward-rewritten : 3
% 0.52/1.69 # Generated clauses : 11578
% 0.52/1.69 # ...of the previous two non-trivial : 11578
% 0.52/1.69 # Contextual simplify-reflections : 40
% 0.52/1.69 # Paramodulations : 11568
% 0.52/1.69 # Factorizations : 0
% 0.52/1.69 # Equation resolutions : 10
% 0.52/1.69 # Current number of processed clauses : 720
% 0.52/1.69 # Positive orientable unit clauses : 286
% 0.52/1.69 # Positive unorientable unit clauses: 0
% 0.52/1.69 # Negative unit clauses : 1
% 0.52/1.69 # Non-unit-clauses : 433
% 0.52/1.69 # Current number of unprocessed clauses: 11171
% 0.52/1.69 # ...number of literals in the above : 20901
% 0.52/1.69 # Current number of archived formulas : 0
% 0.52/1.69 # Current number of archived clauses : 3
% 0.52/1.69 # Clause-clause subsumption calls (NU) : 38767
% 0.52/1.69 # Rec. Clause-clause subsumption calls : 890
% 0.52/1.69 # Non-unit clause-clause subsumptions : 66
% 0.52/1.69 # Unit Clause-clause subsumption calls : 3259
% 0.52/1.69 # Rewrite failures with RHS unbound : 0
% 0.52/1.69 # BW rewrite match attempts : 5506
% 0.52/1.69 # BW rewrite match successes : 3
% 0.52/1.69 # Condensation attempts : 0
% 0.52/1.69 # Condensation successes : 0
% 0.52/1.69 # Termbank termtop insertions : 571337
% 0.52/1.69
% 0.52/1.69 # -------------------------------------------------
% 0.52/1.69 # User time : 0.350 s
% 0.52/1.69 # System time : 0.014 s
% 0.52/1.69 # Total time : 0.364 s
% 0.52/1.69 # Maximum resident set size: 24812 pages
%------------------------------------------------------------------------------