%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP004_5 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:28 PM UTC 2026
% Result : Theorem 205.66s 30.79s
% Output : CNFRefutation 205.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 42 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 15 ~; 12 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?; 18 :)
% 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_30,type,
p: $i > $o ).
tff(decl_694,type,
c_2Epred__set_2ECHOICE: del > $i ).
tff(decl_697,type,
c_2Epred__set_2EDELETE: del > $i ).
tff(decl_720,type,
c_2Epred__set_2EREST: del > $i ).
tff(decl_723,type,
c_2Epred__set_2ESUBSET: del > $i ).
tff(decl_762,type,
esk1_0: del ).
tff(decl_763,type,
esk2_0: $i ).
tff(conj_thm_2Epred__set_2EREST__SUBSET,conjecture,
! [X11: del,X324] :
( mem(X324,arr(X11,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X11),ap(c_2Epred__set_2EREST(X11),X324)),X324)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EREST__SUBSET) ).
tff(ap_tp,axiom,
! [X1: del,X2: del,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001_2.ax',ap_tp) ).
tff(mem_c_2Epred__set_2ECHOICE,axiom,
! [X11: del] : mem(c_2Epred__set_2ECHOICE(X11),arr(arr(X11,bool),X11)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2ECHOICE) ).
tff(conj_thm_2Epred__set_2EDELETE__SUBSET,axiom,
! [X11: del,X39] :
( mem(X39,X11)
=> ! [X300] :
( mem(X300,arr(X11,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X11),ap(ap(c_2Epred__set_2EDELETE(X11),X300),X39)),X300)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EDELETE__SUBSET) ).
tff(ax_thm_2Epred__set_2EREST__DEF,axiom,
! [X11: del,X324] :
( mem(X324,arr(X11,bool))
=> ( ap(c_2Epred__set_2EREST(X11),X324) = ap(ap(c_2Epred__set_2EDELETE(X11),X324),ap(c_2Epred__set_2ECHOICE(X11),X324)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_thm_2Epred__set_2EREST__DEF) ).
tff(c_0_5,negated_conjecture,
~ ! [X11: del,X324] :
( mem(X324,arr(X11,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X11),ap(c_2Epred__set_2EREST(X11),X324)),X324)) ),
inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET]) ).
tff(c_0_6,plain,
! [X2022: del,X2023: del,X2024,X2025] :
( mem(ap(X2024,X2025),X2023)
| ~ mem(X2025,X2022)
| ~ mem(X2024,arr(X2022,X2023)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
tff(c_0_7,plain,
! [X2194: del] : mem(c_2Epred__set_2ECHOICE(X2194),arr(arr(X2194,bool),X2194)),
inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2ECHOICE]) ).
tff(c_0_8,plain,
! [X2231: del,X2232,X2233] :
( p(ap(ap(c_2Epred__set_2ESUBSET(X2231),ap(ap(c_2Epred__set_2EDELETE(X2231),X2233),X2232)),X2233))
| ~ mem(X2233,arr(X2231,bool))
| ~ mem(X2232,X2231) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Epred__set_2EDELETE__SUBSET])])])]) ).
tff(c_0_9,negated_conjecture,
( ~ p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0))
& mem(esk2_0,arr(esk1_0,bool)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
tcf(c_0_10,plain,
! [X2: del,X4,X3,X1: del] :
( ~ mem(X4,X1)
| ~ mem(X3,arr(X1,X2))
| mem(ap(X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_11,plain,
! [X1: del] : mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_12,plain,
! [X1964: del,X1965] :
( ( ap(c_2Epred__set_2EREST(X1964),X1965) = ap(ap(c_2Epred__set_2EDELETE(X1964),X1965),ap(c_2Epred__set_2ECHOICE(X1964),X1965)) )
| ~ mem(X1965,arr(X1964,bool)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])])]) ).
tcf(c_0_13,plain,
! [X4,X3,X1: del] :
( ~ mem(X4,arr(X1,bool))
| ~ mem(X3,X1)
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(ap(c_2Epred__set_2EDELETE(X1),X4),X3)),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_14,negated_conjecture,
mem(esk2_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,plain,
! [X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| mem(ap(c_2Epred__set_2ECHOICE(X1),X3),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_16,plain,
! [X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| ( ap(c_2Epred__set_2EREST(X1),X3) = ap(ap(c_2Epred__set_2EDELETE(X1),X3),ap(c_2Epred__set_2ECHOICE(X1),X3)) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_17,negated_conjecture,
! [X3] :
( ~ mem(X3,esk1_0)
| p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(ap(c_2Epred__set_2EDELETE(esk1_0),esk2_0),X3)),esk2_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_18,negated_conjecture,
mem(ap(c_2Epred__set_2ECHOICE(esk1_0),esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
tcf(c_0_19,negated_conjecture,
ap(ap(c_2Epred__set_2EDELETE(esk1_0),esk2_0),ap(c_2Epred__set_2ECHOICE(esk1_0),esk2_0)) = ap(c_2Epred__set_2EREST(esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
tcf(c_0_20,negated_conjecture,
~ p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP004_5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 21:38:36 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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/benchmark/theBenchmark.p
% 205.66/30.79 % Version: 3.5.1
% 205.66/30.79 % Preprocessing class: FMLMSMLLSSSNFFN.
% 205.66/30.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 205.66/30.79 % Starting new_bool_3 with 900s (3) cores
% 205.66/30.79 % Starting new_bool_1 with 900s (3) cores
% 205.66/30.79 % Starting sh5l with 300s (1) cores
% 205.66/30.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 205.66/30.79 % G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 3609280 completed with status 0
% 205.66/30.79 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 205.66/30.79 % Preprocessing class: FMLMSMLLSSSNFFN.
% 205.66/30.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 205.66/30.79 % Starting new_bool_3 with 900s (3) cores
% 205.66/30.79 % Starting new_bool_1 with 900s (3) cores
% 205.66/30.79 % Starting sh5l with 300s (1) cores
% 205.66/30.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 205.66/30.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 205.66/30.79 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 205.66/30.79 % Search class: FGHSM-SSLM32-DFFFFFNN
% 205.66/30.79 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 205.66/30.79 % Starting SubtermCWHack with 28s (1) cores
% 205.66/30.79 % SubtermCWHack with pid 3609287 completed with status 8
% 205.66/30.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 31s (1) cores
% 205.66/30.79 % G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 3609555 completed with status 0
% 205.66/30.79 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 205.66/30.79 % Preprocessing class: FMLMSMLLSSSNFFN.
% 205.66/30.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 205.66/30.79 % Starting new_bool_3 with 900s (3) cores
% 205.66/30.79 % Starting new_bool_1 with 900s (3) cores
% 205.66/30.79 % Starting sh5l with 300s (1) cores
% 205.66/30.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 205.66/30.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 205.66/30.79 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 205.66/30.79 % Search class: FGHSM-SSLM32-DFFFFFNN
% 205.66/30.79 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 205.66/30.79 % Starting SubtermCWHack with 28s (1) cores
% 205.66/30.79 % SubtermCWHack with pid 3609287 completed with status 8
% 205.66/30.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 31s (1) cores
% 205.66/30.79 % Preprocessing time : 0.045 s
% 205.66/30.79 % Presaturation interreduction done
% 205.66/30.79
% 205.66/30.79 % Proof found!
% 205.66/30.79 % SZS status Theorem
% 205.66/30.79 % SZS output start CNFRefutation
% See solution above
% 205.66/30.79 % Parsed axioms : 3299
% 205.66/30.79 % Removed by relevancy pruning/SinE : 2798
% 205.66/30.79 % Initial clauses : 1966
% 205.66/30.79 % Removed in clause preprocessing : 945
% 205.66/30.79 % Initial clauses in saturation : 1021
% 205.66/30.79 % Processed clauses : 2169
% 205.66/30.79 % ...of these trivial : 30
% 205.66/30.79 % ...subsumed : 291
% 205.66/30.79 % ...remaining for further processing : 1848
% 205.66/30.79 % Other redundant clauses eliminated : 81
% 205.66/30.79 % Clauses deleted for lack of memory : 0
% 205.66/30.79 % Backward-subsumed : 22
% 205.66/30.79 % Backward-rewritten : 20
% 205.66/30.79 % Generated clauses : 13259
% 205.66/30.79 % ...of the previous two non-redundant : 13086
% 205.66/30.79 % ...aggressively subsumed : 0
% 205.66/30.79 % Contextual simplify-reflections : 7
% 205.66/30.79 % Paramodulations : 13180
% 205.66/30.79 % Factorizations : 0
% 205.66/30.79 % NegExts : 0
% 205.66/30.79 % Equation resolutions : 89
% 205.66/30.79 % Disequality decompositions : 0
% 205.66/30.79 % Total rewrite steps : 686
% 205.66/30.79 % ...of those cached : 543
% 205.66/30.79 % Propositional unsat checks : 0
% 205.66/30.79 % Propositional check models : 0
% 205.66/30.79 % Propositional check unsatisfiable : 0
% 205.66/30.79 % Propositional clauses : 0
% 205.66/30.79 % Propositional clauses after purity: 0
% 205.66/30.79 % Propositional unsat core size : 0
% 205.66/30.79 % Propositional preprocessing time : 0.000
% 205.66/30.79 % Propositional encoding time : 0.000
% 205.66/30.79 % Propositional solver time : 0.000
% 205.66/30.79 % Success case prop preproc time : 0.000
% 205.66/30.79 % Success case prop encoding time : 0.000
% 205.66/30.79 % Success case prop solver time : 0.000
% 205.66/30.79 % Current number of processed clauses : 916
% 205.66/30.79 % Positive orientable unit clauses : 275
% 205.66/30.79 % Positive unorientable unit clauses: 2
% 205.66/30.79 % Negative unit clauses : 52
% 205.66/30.79 % Non-unit-clauses : 587
% 205.66/30.79 % Current number of unprocessed clauses: 12340
% 205.66/30.79 % ...number of literals in the above : 39430
% 205.66/30.79 % Current number of archived formulas : 0
% 205.66/30.79 % Current number of archived clauses : 866
% 205.66/30.79 % Clause-clause subsumption calls (NU) : 118489
% 205.66/30.79 % Rec. Clause-clause subsumption calls : 34431
% 205.66/30.79 % Non-unit clause-clause subsumptions : 252
% 205.66/30.79 % Unit Clause-clause subsumption calls : 2966
% 205.66/30.79 % Rewrite failures with RHS unbound : 0
% 205.66/30.79 % BW rewrite match attempts : 4524
% 205.66/30.79 % BW rewrite match successes : 66
% 205.66/30.79 % Condensation attempts : 0
% 205.66/30.79 % Condensation successes : 0
% 205.66/30.79 % Termbank termtop insertions : 553671
% 205.66/30.79 % Search garbage collected termcells : 51551
% 205.66/30.79
% 205.66/30.79 % -------------------------------------------------
% 205.66/30.79 % User time : 28.140 s
% 205.66/30.79 % System time : 1.037 s
% 205.66/30.79 % Total time : 29.176 s
% 205.66/30.79 % Maximum resident set size: 14200 pages
% 205.66/30.79
% 205.66/30.79 % -------------------------------------------------
% 205.66/30.79 % User time : 28.206 s
% 205.66/30.79 % System time : 1.052 s
% 205.66/30.79 % Total time : 29.258 s
% 205.66/30.79 % Maximum resident set size: 10496 pages
% 205.66/30.79 % E exiting
%------------------------------------------------------------------------------