TSTP Solution File: ITP005+5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP005+5 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : 300s
% DateTime : Sat May 4 08:06:14 EDT 2024
% Result : Theorem 5.63s 2.11s
% Output : CNFRefutation 5.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 54 ( 15 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 54 ( 21 ~; 16 |; 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 : 30 ( 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/tmp/tmp.DTBSMSUTaE/E---3.1_6567.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/tmp/tmp.DTBSMSUTaE/E---3.1_6567.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/tmp/tmp.DTBSMSUTaE/E---3.1_6567.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/tmp/tmp.DTBSMSUTaE/E---3.1_6567.p',conj_thm_2Epair_2ECURRY__UNCURRY__THM) ).
fof(bool_ne,axiom,
ne(bool),
file('/export/starexec/sandbox/tmp/tmp.DTBSMSUTaE/E---3.1_6567.p',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,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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X559,X560] :
( ~ ne(X559)
| ~ ne(X560)
| c_2Eset__relation_2Erel__to__reln(X559,X560) = c_2Epair_2EUNCURRY(X559,X560,bool) ),
inference(fof_nnf,[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])])])]) ).
cnf(c_0_8,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_6]) ).
cnf(c_0_9,plain,
( c_2Eset__relation_2Erel__to__reln(X1,X2) = c_2Epair_2EUNCURRY(X1,X2,bool)
| ~ ne(X1)
| ~ ne(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
ne(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
ne(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X568,X569] :
( ~ ne(X568)
| ~ ne(X569)
| c_2Eset__relation_2Ereln__to__rel(X568,X569) = c_2Epair_2ECURRY(X568,X569,bool) ),
inference(fof_nnf,[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_13,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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_14,plain,
( c_2Eset__relation_2Ereln__to__rel(X1,X2) = c_2Epair_2ECURRY(X1,X2,bool)
| ~ ne(X1)
| ~ ne(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X1272,X1273,X1274,X1275] :
( ~ ne(X1272)
| ~ ne(X1273)
| ~ ne(X1274)
| ~ mem(X1275,arr(X1272,arr(X1273,X1274)))
| ap(c_2Epair_2ECURRY(X1272,X1273,X1274),ap(c_2Epair_2EUNCURRY(X1272,X1273,X1274),X1275)) = X1275 ),
inference(fof_nnf,[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_16,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(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10]),c_0_11])]) ).
cnf(c_0_17,plain,
( ap(c_2Epair_2ECURRY(X1,X2,X3),ap(c_2Epair_2EUNCURRY(X1,X2,X3),X4)) = X4
| ~ ne(X1)
| ~ ne(X2)
| ~ ne(X3)
| ~ mem(X4,arr(X1,arr(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
mem(esk3_0,arr(esk1_0,arr(esk2_0,bool))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
ne(bool),
inference(split_conjunct,[status(thm)],[bool_ne]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.47 % Problem : ITP005+5 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.47/0.48 % Command : run_E %s %d THM
% 0.51/0.69 % Computer : n024.cluster.edu
% 0.51/0.69 % Model : x86_64 x86_64
% 0.51/0.69 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.51/0.69 % Memory : 8042.1875MB
% 0.51/0.69 % OS : Linux 3.10.0-693.el7.x86_64
% 0.51/0.69 % CPULimit : 300
% 0.51/0.69 % WCLimit : 300
% 0.51/0.69 % DateTime : Fri May 3 12:03:06 EDT 2024
% 0.51/0.69 % CPUTime :
% 1.13/1.33 Running first-order theorem proving
% 1.13/1.34 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.DTBSMSUTaE/E---3.1_6567.p
% 5.63/2.11 # Version: 3.1.0
% 5.63/2.11 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.63/2.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.63/2.11 # Starting new_bool_3 with 900s (3) cores
% 5.63/2.11 # Starting new_bool_1 with 900s (3) cores
% 5.63/2.11 # Starting sh5l with 300s (1) cores
% 5.63/2.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 5.63/2.11 # new_bool_3 with pid 6645 completed with status 0
% 5.63/2.11 # Result found by new_bool_3
% 5.63/2.11 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.63/2.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.63/2.11 # Starting new_bool_3 with 900s (3) cores
% 5.63/2.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.63/2.11 # Search class: FGHSF-FSLM32-DFFFFFNN
% 5.63/2.11 # Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 5.63/2.11 # Starting SAT001_MinMin_p005000_rr_RG with 541s (1) cores
% 5.63/2.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 91s (1) cores
% 5.63/2.11 # Starting new_bool_3 with 91s (1) cores
% 5.63/2.11 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 6653 completed with status 0
% 5.63/2.11 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 5.63/2.11 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.63/2.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.63/2.11 # Starting new_bool_3 with 900s (3) cores
% 5.63/2.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.63/2.11 # Search class: FGHSF-FSLM32-DFFFFFNN
% 5.63/2.11 # Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 5.63/2.11 # Starting SAT001_MinMin_p005000_rr_RG with 541s (1) cores
% 5.63/2.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 91s (1) cores
% 5.63/2.11 # Preprocessing time : 0.014 s
% 5.63/2.11 # Presaturation interreduction done
% 5.63/2.11
% 5.63/2.11 # Proof found!
% 5.63/2.11 # SZS status Theorem
% 5.63/2.11 # SZS output start CNFRefutation
% See solution above
% 5.63/2.11 # Parsed axioms : 3163
% 5.63/2.11 # Removed by relevancy pruning/SinE : 2859
% 5.63/2.11 # Initial clauses : 1541
% 5.63/2.11 # Removed in clause preprocessing : 916
% 5.63/2.11 # Initial clauses in saturation : 625
% 5.63/2.11 # Processed clauses : 2041
% 5.63/2.11 # ...of these trivial : 6
% 5.63/2.11 # ...subsumed : 536
% 5.63/2.11 # ...remaining for further processing : 1499
% 5.63/2.11 # Other redundant clauses eliminated : 40
% 5.63/2.11 # Clauses deleted for lack of memory : 0
% 5.63/2.11 # Backward-subsumed : 123
% 5.63/2.11 # Backward-rewritten : 34
% 5.63/2.11 # Generated clauses : 29270
% 5.63/2.11 # ...of the previous two non-redundant : 28941
% 5.63/2.11 # ...aggressively subsumed : 0
% 5.63/2.11 # Contextual simplify-reflections : 33
% 5.63/2.11 # Paramodulations : 29214
% 5.63/2.11 # Factorizations : 10
% 5.63/2.11 # NegExts : 0
% 5.63/2.11 # Equation resolutions : 46
% 5.63/2.11 # Disequality decompositions : 0
% 5.63/2.11 # Total rewrite steps : 9745
% 5.63/2.11 # ...of those cached : 9735
% 5.63/2.11 # Propositional unsat checks : 0
% 5.63/2.11 # Propositional check models : 0
% 5.63/2.11 # Propositional check unsatisfiable : 0
% 5.63/2.11 # Propositional clauses : 0
% 5.63/2.11 # Propositional clauses after purity: 0
% 5.63/2.11 # Propositional unsat core size : 0
% 5.63/2.11 # Propositional preprocessing time : 0.000
% 5.63/2.11 # Propositional encoding time : 0.000
% 5.63/2.11 # Propositional solver time : 0.000
% 5.63/2.11 # Success case prop preproc time : 0.000
% 5.63/2.11 # Success case prop encoding time : 0.000
% 5.63/2.11 # Success case prop solver time : 0.000
% 5.63/2.11 # Current number of processed clauses : 742
% 5.63/2.11 # Positive orientable unit clauses : 11
% 5.63/2.11 # Positive unorientable unit clauses: 0
% 5.63/2.11 # Negative unit clauses : 5
% 5.63/2.11 # Non-unit-clauses : 726
% 5.63/2.11 # Current number of unprocessed clauses: 27435
% 5.63/2.11 # ...number of literals in the above : 176344
% 5.63/2.11 # Current number of archived formulas : 0
% 5.63/2.11 # Current number of archived clauses : 718
% 5.63/2.11 # Clause-clause subsumption calls (NU) : 126248
% 5.63/2.11 # Rec. Clause-clause subsumption calls : 8830
% 5.63/2.11 # Non-unit clause-clause subsumptions : 574
% 5.63/2.11 # Unit Clause-clause subsumption calls : 432
% 5.63/2.11 # Rewrite failures with RHS unbound : 0
% 5.63/2.11 # BW rewrite match attempts : 4
% 5.63/2.11 # BW rewrite match successes : 4
% 5.63/2.11 # Condensation attempts : 0
% 5.63/2.11 # Condensation successes : 0
% 5.63/2.11 # Termbank termtop insertions : 1039945
% 5.63/2.11 # Search garbage collected termcells : 69686
% 5.63/2.11
% 5.63/2.11 # -------------------------------------------------
% 5.63/2.11 # User time : 0.642 s
% 5.63/2.11 # System time : 0.033 s
% 5.63/2.11 # Total time : 0.675 s
% 5.63/2.11 # Maximum resident set size: 12536 pages
% 5.63/2.11
% 5.63/2.11 # -------------------------------------------------
% 5.63/2.11 # User time : 1.804 s
% 5.63/2.11 # System time : 0.066 s
% 5.63/2.11 # Total time : 1.871 s
% 5.63/2.11 # Maximum resident set size: 8368 pages
% 5.63/2.11 % E---3.1 exiting
% 5.63/2.11 % E exiting
%------------------------------------------------------------------------------