%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP005+5 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:53:29 PM UTC 2026
% Result : Theorem 4.34s 1.26s
% Output : CNFRefutation 4.34s
% 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/sandbox2/benchmark/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/sandbox2/benchmark/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/sandbox2/benchmark/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/sandbox2/benchmark/Axioms/ITP001/ITP014+5.ax',conj_thm_2Epair_2ECURRY__UNCURRY__THM) ).
fof(bool_ne,axiom,
ne(bool),
file('/export/starexec/sandbox2/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,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
& mem(esk3_0,arr(esk1_0,arr(esk2_0,bool)))
& ne(esk2_0)
& ne(esk1_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] :
( c_2Eset__relation_2Erel__to__reln(X559,X560) = c_2Epair_2EUNCURRY(X559,X560,bool)
| ~ ne(X560)
| ~ ne(X559) ),
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,
( ~ ne(X2)
| ~ ne(X1)
| c_2Eset__relation_2Erel__to__reln(X1,X2) = c_2Epair_2EUNCURRY(X1,X2,bool) ),
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] :
( c_2Eset__relation_2Ereln__to__rel(X568,X569) = c_2Epair_2ECURRY(X568,X569,bool)
| ~ ne(X569)
| ~ ne(X568) ),
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,
( ~ ne(X2)
| ~ ne(X1)
| c_2Eset__relation_2Ereln__to__rel(X1,X2) = c_2Epair_2ECURRY(X1,X2,bool) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X1272,X1273,X1274,X1275] :
( ap(c_2Epair_2ECURRY(X1272,X1273,X1274),ap(c_2Epair_2EUNCURRY(X1272,X1273,X1274),X1275)) = X1275
| ~ mem(X1275,arr(X1272,arr(X1273,X1274)))
| ~ ne(X1274)
| ~ ne(X1273)
| ~ ne(X1272) ),
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,
( ~ mem(X4,arr(X1,arr(X2,X3)))
| ~ ne(X3)
| ~ ne(X2)
| ~ ne(X1)
| ap(c_2Epair_2ECURRY(X1,X2,X3),ap(c_2Epair_2EUNCURRY(X1,X2,X3),X4)) = X4 ),
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.00/0.03 % Problem : ITP005+5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 21:43:17 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 4.34/1.26 % Version: 3.5.1
% 4.34/1.26 % Preprocessing class: FMLMSMLLSSSNFFN.
% 4.34/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.34/1.26 % Starting new_bool_3 with 900s (3) cores
% 4.34/1.26 % Starting new_bool_1 with 900s (3) cores
% 4.34/1.26 % Starting sh5l with 300s (1) cores
% 4.34/1.26 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 4.34/1.26 % new_bool_3 with pid 2628024 completed with status 0
% 4.34/1.26 % Result found by new_bool_3
% 4.34/1.26 % Preprocessing class: FMLMSMLLSSSNFFN.
% 4.34/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.34/1.26 % Starting new_bool_3 with 900s (3) cores
% 4.34/1.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.34/1.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.34/1.26 % Search class: FGHSF-FSLM32-DFFFFFNN
% 4.34/1.26 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 4.34/1.26 % Starting SubtermCWHack with 91s (1) cores
% 4.34/1.26 % Starting SAT001_MinMin_p005000_rr_RG with 541s (1) cores
% 4.34/1.26 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 91s (1) cores
% 4.34/1.26 % SubtermCWHack with pid 2628070 completed with status 0
% 4.34/1.26 % Result found by SubtermCWHack
% 4.34/1.26 % Preprocessing class: FMLMSMLLSSSNFFN.
% 4.34/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.34/1.26 % Starting new_bool_3 with 900s (3) cores
% 4.34/1.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.34/1.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.34/1.26 % Search class: FGHSF-FSLM32-DFFFFFNN
% 4.34/1.26 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 4.34/1.26 % Starting SubtermCWHack with 91s (1) cores
% 4.34/1.26 % Preprocessing time : 0.014 s
% 4.34/1.26
% 4.34/1.26 % Proof found!
% 4.34/1.26 % SZS status Theorem
% 4.34/1.26 % SZS output start CNFRefutation
% See solution above
% 4.34/1.26 % Parsed axioms : 3163
% 4.34/1.26 % Removed by relevancy pruning/SinE : 2859
% 4.34/1.26 % Initial clauses : 1541
% 4.34/1.26 % Removed in clause preprocessing : 916
% 4.34/1.26 % Initial clauses in saturation : 625
% 4.34/1.26 % Processed clauses : 1848
% 4.34/1.26 % ...of these trivial : 1
% 4.34/1.26 % ...subsumed : 785
% 4.34/1.26 % ...remaining for further processing : 1062
% 4.34/1.26 % Other redundant clauses eliminated : 38
% 4.34/1.26 % Clauses deleted for lack of memory : 0
% 4.34/1.26 % Backward-subsumed : 75
% 4.34/1.26 % Backward-rewritten : 30
% 4.34/1.26 % Generated clauses : 45853
% 4.34/1.26 % ...of the previous two non-redundant : 40458
% 4.34/1.26 % ...aggressively subsumed : 0
% 4.34/1.26 % Contextual simplify-reflections : 20
% 4.34/1.26 % Paramodulations : 45809
% 4.34/1.26 % Factorizations : 1
% 4.34/1.26 % NegExts : 0
% 4.34/1.26 % Equation resolutions : 43
% 4.34/1.26 % Disequality decompositions : 0
% 4.34/1.26 % Total rewrite steps : 14937
% 4.34/1.26 % ...of those cached : 14911
% 4.34/1.26 % Propositional unsat checks : 0
% 4.34/1.26 % Propositional check models : 0
% 4.34/1.26 % Propositional check unsatisfiable : 0
% 4.34/1.26 % Propositional clauses : 0
% 4.34/1.26 % Propositional clauses after purity: 0
% 4.34/1.26 % Propositional unsat core size : 0
% 4.34/1.26 % Propositional preprocessing time : 0.000
% 4.34/1.26 % Propositional encoding time : 0.000
% 4.34/1.26 % Propositional solver time : 0.000
% 4.34/1.26 % Success case prop preproc time : 0.000
% 4.34/1.26 % Success case prop encoding time : 0.000
% 4.34/1.26 % Success case prop solver time : 0.000
% 4.34/1.26 % Current number of processed clauses : 934
% 4.34/1.26 % Positive orientable unit clauses : 27
% 4.34/1.26 % Positive unorientable unit clauses: 0
% 4.34/1.26 % Negative unit clauses : 5
% 4.34/1.26 % Non-unit-clauses : 902
% 4.34/1.26 % Current number of unprocessed clauses: 38467
% 4.34/1.26 % ...number of literals in the above : 246628
% 4.34/1.26 % Current number of archived formulas : 0
% 4.34/1.26 % Current number of archived clauses : 105
% 4.34/1.26 % Clause-clause subsumption calls (NU) : 75904
% 4.34/1.26 % Rec. Clause-clause subsumption calls : 23813
% 4.34/1.26 % Non-unit clause-clause subsumptions : 837
% 4.34/1.26 % Unit Clause-clause subsumption calls : 3959
% 4.34/1.26 % Rewrite failures with RHS unbound : 0
% 4.34/1.26 % BW rewrite match attempts : 27
% 4.34/1.26 % BW rewrite match successes : 19
% 4.34/1.26 % Condensation attempts : 0
% 4.34/1.26 % Condensation successes : 0
% 4.34/1.26 % Termbank termtop insertions : 1473666
% 4.34/1.26 % Search garbage collected termcells : 69686
% 4.34/1.26
% 4.34/1.26 % -------------------------------------------------
% 4.34/1.26 % User time : 0.569 s
% 4.34/1.26 % System time : 0.050 s
% 4.34/1.26 % Total time : 0.619 s
% 4.34/1.26 % Maximum resident set size: 14400 pages
% 4.34/1.26
% 4.34/1.26 % -------------------------------------------------
% 4.34/1.26 % User time : 1.711 s
% 4.34/1.26 % System time : 0.117 s
% 4.34/1.26 % Total time : 1.828 s
% 4.34/1.26 % Maximum resident set size: 11520 pages
% 4.34/1.26 % E exiting
%------------------------------------------------------------------------------