%------------------------------------------------------------------------------
% 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 : n017.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 0.67s 0.75s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 14 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
del: $tType ).
tff(decl_23,type,
bool: del ).
tff(decl_25,type,
arr: ( del * del ) > del ).
tff(decl_26,type,
mem: ( del * $i ) > $o ).
tff(decl_27,type,
ap: ( $i * $i ) > $i ).
tff(decl_326,type,
c_2Epair_2ECURRY: ( del * ( del * del ) ) > $i ).
tff(decl_334,type,
c_2Epair_2EUNCURRY: ( del * ( del * del ) ) > $i ).
tff(decl_851,type,
c_2Eset__relation_2Erel__to__reln: ( del * del ) > $i ).
tff(decl_852,type,
c_2Eset__relation_2Ereln__to__rel: ( del * del ) > $i ).
tff(decl_894,type,
esk1_0: del ).
tff(decl_895,type,
esk2_0: del ).
tff(decl_896,type,
esk3_0: $i ).
tff(conj_thm_2Eset__relation_2Erel__to__reln__inv,conjecture,
! [X11: del,X14: del,X334] :
( mem(X334,arr(X11,arr(X14,bool)))
=> ( ap(c_2Eset__relation_2Ereln__to__rel(X11,X14),ap(c_2Eset__relation_2Erel__to__reln(X11,X14),X334)) = X334 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Eset__relation_2Erel__to__reln__inv) ).
tff(conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY,axiom,
! [X11: del,X14: del] : ( c_2Eset__relation_2Ereln__to__rel(X11,X14) = c_2Epair_2ECURRY(X11,X14,bool) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY) ).
tff(conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY,axiom,
! [X11: del,X14: del] : ( c_2Eset__relation_2Erel__to__reln(X11,X14) = c_2Epair_2EUNCURRY(X11,X14,bool) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY) ).
tff(conj_thm_2Epair_2ECURRY__UNCURRY__THM,axiom,
! [X11: del,X14: del,X101: del,X22] :
( mem(X22,arr(X11,arr(X14,X101)))
=> ( ap(c_2Epair_2ECURRY(X11,X14,X101),ap(c_2Epair_2EUNCURRY(X11,X14,X101),X22)) = X22 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP014_5.ax',conj_thm_2Epair_2ECURRY__UNCURRY__THM) ).
tff(c_0_4,negated_conjecture,
~ ! [X11: del,X14: del,X334] :
( mem(X334,arr(X11,arr(X14,bool)))
=> ( ap(c_2Eset__relation_2Ereln__to__rel(X11,X14),ap(c_2Eset__relation_2Erel__to__reln(X11,X14),X334)) = X334 ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Eset__relation_2Erel__to__reln__inv]) ).
tff(c_0_5,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))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
tff(c_0_6,plain,
! [X2421: del,X2422: del] : ( c_2Eset__relation_2Ereln__to__rel(X2421,X2422) = c_2Epair_2ECURRY(X2421,X2422,bool) ),
inference(variable_rename,[status(thm)],[conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY]) ).
tff(c_0_7,plain,
! [X2412: del,X2413: del] : ( c_2Eset__relation_2Erel__to__reln(X2412,X2413) = c_2Epair_2EUNCURRY(X2412,X2413,bool) ),
inference(variable_rename,[status(thm)],[conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY]) ).
tcf(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_5]) ).
tcf(c_0_9,plain,
! [X1: del,X2: del] : c_2Eset__relation_2Ereln__to__rel(X1,X2) = c_2Epair_2ECURRY(X1,X2,bool),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X1: del,X2: del] : c_2Eset__relation_2Erel__to__reln(X1,X2) = c_2Epair_2EUNCURRY(X1,X2,bool),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_11,plain,
! [X2756: del,X2757: del,X2758: del,X2759] :
( ( ap(c_2Epair_2ECURRY(X2756,X2757,X2758),ap(c_2Epair_2EUNCURRY(X2756,X2757,X2758),X2759)) = X2759 )
| ~ mem(X2759,arr(X2756,arr(X2757,X2758))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Epair_2ECURRY__UNCURRY__THM])])]) ).
tcf(c_0_12,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(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
tcf(c_0_13,plain,
! [X1: del,X2: del,X3,X11: del] :
( ~ mem(X3,arr(X1,arr(X2,X11)))
| ( ap(c_2Epair_2ECURRY(X1,X2,X11),ap(c_2Epair_2EUNCURRY(X1,X2,X11),X3)) = X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_14,negated_conjecture,
mem(esk3_0,arr(esk1_0,arr(esk2_0,bool))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP005_5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n017.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 21:36:58 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 0.67/0.75 % Version: 3.5.1
% 0.67/0.75 % Preprocessing class: FMLMSMLLSSSNFFN.
% 0.67/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.75 % Starting new_bool_3 with 900s (3) cores
% 0.67/0.75 % Starting new_bool_1 with 900s (3) cores
% 0.67/0.75 % Starting sh5l with 300s (1) cores
% 0.67/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 0.67/0.75 % new_bool_3 with pid 656926 completed with status 0
% 0.67/0.75 % Result found by new_bool_3
% 0.67/0.75 % Preprocessing class: FMLMSMLLSSSNFFN.
% 0.67/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.75 % Starting new_bool_3 with 900s (3) cores
% 0.67/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.67/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.67/0.75 % Search class: FGHSM-FSLF32-DFFFFFNN
% 0.67/0.75 % partial match(1): FGHSM-FSLM32-DFFFFFNN
% 0.67/0.75 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 0.67/0.75 % Starting SubtermCWHack with 82s (1) cores
% 0.67/0.75 % Starting new_bool_3 with 91s (1) cores
% 0.67/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 68s (1) cores
% 0.67/0.75 % SubtermCWHack with pid 656960 completed with status 0
% 0.67/0.75 % Result found by SubtermCWHack
% 0.67/0.75 % Preprocessing class: FMLMSMLLSSSNFFN.
% 0.67/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.75 % Starting new_bool_3 with 900s (3) cores
% 0.67/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.67/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.67/0.75 % Search class: FGHSM-FSLF32-DFFFFFNN
% 0.67/0.75 % partial match(1): FGHSM-FSLM32-DFFFFFNN
% 0.67/0.75 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 0.67/0.75 % Starting SubtermCWHack with 82s (1) cores
% 0.67/0.75 % Preprocessing time : 0.012 s
% 0.67/0.75
% 0.67/0.75 % Proof found!
% 0.67/0.75 % SZS status Theorem
% 0.67/0.75 % SZS output start CNFRefutation
% See solution above
% 0.67/0.75 % Parsed axioms : 4157
% 0.67/0.75 % Removed by relevancy pruning/SinE : 3978
% 0.67/0.75 % Initial clauses : 510
% 0.67/0.75 % Removed in clause preprocessing : 33
% 0.67/0.75 % Initial clauses in saturation : 477
% 0.67/0.75 % Processed clauses : 1111
% 0.67/0.75 % ...of these trivial : 53
% 0.67/0.75 % ...subsumed : 548
% 0.67/0.75 % ...remaining for further processing : 510
% 0.67/0.75 % Other redundant clauses eliminated : 38
% 0.67/0.75 % Clauses deleted for lack of memory : 0
% 0.67/0.75 % Backward-subsumed : 8
% 0.67/0.75 % Backward-rewritten : 4
% 0.67/0.75 % Generated clauses : 10667
% 0.67/0.75 % ...of the previous two non-redundant : 9879
% 0.67/0.75 % ...aggressively subsumed : 0
% 0.67/0.75 % Contextual simplify-reflections : 4
% 0.67/0.75 % Paramodulations : 10620
% 0.67/0.75 % Factorizations : 4
% 0.67/0.75 % NegExts : 0
% 0.67/0.75 % Equation resolutions : 43
% 0.67/0.75 % Disequality decompositions : 0
% 0.67/0.75 % Total rewrite steps : 1004
% 0.67/0.75 % ...of those cached : 943
% 0.67/0.75 % Propositional unsat checks : 0
% 0.67/0.75 % Propositional check models : 0
% 0.67/0.75 % Propositional check unsatisfiable : 0
% 0.67/0.75 % Propositional clauses : 0
% 0.67/0.75 % Propositional clauses after purity: 0
% 0.67/0.75 % Propositional unsat core size : 0
% 0.67/0.75 % Propositional preprocessing time : 0.000
% 0.67/0.75 % Propositional encoding time : 0.000
% 0.67/0.75 % Propositional solver time : 0.000
% 0.67/0.75 % Success case prop preproc time : 0.000
% 0.67/0.75 % Success case prop encoding time : 0.000
% 0.67/0.75 % Success case prop solver time : 0.000
% 0.67/0.75 % Current number of processed clauses : 475
% 0.67/0.75 % Positive orientable unit clauses : 58
% 0.67/0.75 % Positive unorientable unit clauses: 0
% 0.67/0.75 % Negative unit clauses : 10
% 0.67/0.75 % Non-unit-clauses : 407
% 0.67/0.75 % Current number of unprocessed clauses: 9141
% 0.67/0.75 % ...number of literals in the above : 37946
% 0.67/0.75 % Current number of archived formulas : 0
% 0.67/0.75 % Current number of archived clauses : 12
% 0.67/0.75 % Clause-clause subsumption calls (NU) : 20323
% 0.67/0.75 % Rec. Clause-clause subsumption calls : 14311
% 0.67/0.75 % Non-unit clause-clause subsumptions : 555
% 0.67/0.75 % Unit Clause-clause subsumption calls : 88
% 0.67/0.75 % Rewrite failures with RHS unbound : 0
% 0.67/0.75 % BW rewrite match attempts : 116
% 0.67/0.75 % BW rewrite match successes : 6
% 0.67/0.75 % Condensation attempts : 0
% 0.67/0.75 % Condensation successes : 0
% 0.67/0.75 % Termbank termtop insertions : 384312
% 0.67/0.75 % Search garbage collected termcells : 54032
% 0.67/0.75
% 0.67/0.75 % -------------------------------------------------
% 0.67/0.75 % User time : 0.171 s
% 0.67/0.75 % System time : 0.033 s
% 0.67/0.75 % Total time : 0.204 s
% 0.67/0.75 % Maximum resident set size: 13468 pages
% 0.67/0.75
% 0.67/0.75 % -------------------------------------------------
% 0.67/0.75 % User time : 0.516 s
% 0.67/0.75 % System time : 0.073 s
% 0.67/0.75 % Total time : 0.589 s
% 0.67/0.75 % Maximum resident set size: 12544 pages
% 0.67/0.75 % E exiting
%------------------------------------------------------------------------------