%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP214_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:54:35 PM UTC 2026
% Result : Theorem 1.03s 1.69s
% Output : CNFRefutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
set_nat: $tType ).
tff(decl_sort2,type,
heap_e7401611519738050253t_unit: $tType ).
tff(decl_sort3,type,
bool: $tType ).
tff(decl_sort4,type,
b: $tType ).
tff(decl_sort5,type,
fun_b_assn: $tType ).
tff(decl_sort6,type,
assn: $tType ).
tff(decl_sort7,type,
fun_Pr6001797050664311790t_bool: $tType ).
tff(decl_sort8,type,
produc3658429121746597890et_nat: $tType ).
tff(decl_1146,type,
rep_assn: assn > fun_Pr6001797050664311790t_bool ).
tff(decl_1681,type,
hoare_new_addrs: ( heap_e7401611519738050253t_unit * ( set_nat * heap_e7401611519738050253t_unit ) ) > set_nat ).
tff(decl_2330,type,
produc7507926704131184380et_nat: ( set_nat * heap_e7401611519738050253t_unit ) > produc3658429121746597890et_nat ).
tff(decl_3006,type,
aa_Pro2991721470636411351t_bool: ( produc3658429121746597890et_nat * fun_Pr6001797050664311790t_bool ) > bool ).
tff(decl_3464,type,
aa_b_assn: ( b * fun_b_assn ) > assn ).
tff(decl_3543,type,
pp: bool > $o ).
tff(decl_3545,type,
q: fun_b_assn ).
tff(decl_3547,type,
as: set_nat ).
tff(decl_3550,type,
h: heap_e7401611519738050253t_unit ).
tff(decl_3551,type,
h2: heap_e7401611519738050253t_unit ).
tff(decl_3552,type,
h3: heap_e7401611519738050253t_unit ).
tff(decl_3554,type,
rg: b ).
tff(conj_0,conjecture,
pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(fact_3_POST__G,axiom,
pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h2,hoare_new_addrs(h3,as,h2),h)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_POST__G) ).
tff(fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062,axiom,
hoare_new_addrs(h2,hoare_new_addrs(h3,as,h2),h) = hoare_new_addrs(h3,as,h),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062) ).
tff(c_0_3,negated_conjecture,
~ pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_4,negated_conjecture,
~ pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_5,negated_conjecture,
~ pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
tcf(c_0_6,plain,
pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h2,hoare_new_addrs(h3,as,h2),h)))),
inference(split_conjunct,[status(thm)],[fact_3_POST__G]) ).
tcf(c_0_7,plain,
hoare_new_addrs(h2,hoare_new_addrs(h3,as,h2),h) = hoare_new_addrs(h3,as,h),
inference(split_conjunct,[status(thm)],[fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062]) ).
tcf(c_0_8,negated_conjecture,
~ pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ITP214_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.33 % Computer : n012.cluster.edu
% 0.04/0.33 % Model : x86_64 x86_64
% 0.04/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.33 % Memory : 8046.5625MB
% 0.04/0.33 % OS : Linux 6.8.0-71-generic
% 0.04/0.33 % CPULimit : 300
% 0.04/0.33 % WCLimit : 300
% 0.04/0.33 % DateTime : Sun Sep 20 22:08:37 UTC 2026
% 0.04/0.34 % CPUTime :
% 0.04/0.34 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.36 Running first-order theorem proving
% 0.04/0.36 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
% 1.03/1.69 % Version: 3.5.1
% 1.03/1.69 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.03/1.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/1.69 % Starting new_bool_3 with 900s (3) cores
% 1.03/1.69 % Starting new_bool_1 with 900s (3) cores
% 1.03/1.69 % Starting sh5l with 300s (1) cores
% 1.03/1.69 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.03/1.69 % new_bool_3 with pid 950550 completed with status 0
% 1.03/1.69 % Result found by new_bool_3
% 1.03/1.69 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.03/1.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/1.69 % Starting new_bool_3 with 900s (3) cores
% 1.03/1.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.03/1.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/1.69 % Search class: FGHSM-SMLM32-DFFFFFNN
% 1.03/1.69 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 1.03/1.69 % Starting SubtermCWHack with 82s (1) cores
% 1.03/1.69 % Starting new_bool_3 with 91s (1) cores
% 1.03/1.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 1.03/1.69 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 950558 completed with status 0
% 1.03/1.69 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 1.03/1.69 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.03/1.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/1.69 % Starting new_bool_3 with 900s (3) cores
% 1.03/1.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.03/1.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/1.69 % Search class: FGHSM-SMLM32-DFFFFFNN
% 1.03/1.69 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 1.03/1.69 % Starting SubtermCWHack with 82s (1) cores
% 1.03/1.69 % Starting new_bool_3 with 91s (1) cores
% 1.03/1.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 1.03/1.69 % Preprocessing time : 0.033 s
% 1.03/1.69
% 1.03/1.69 % Proof found!
% 1.03/1.69 % SZS status Theorem
% 1.03/1.69 % SZS output start CNFRefutation
% See solution above
% 1.03/1.69 % Parsed axioms : 15926
% 1.03/1.69 % Removed by relevancy pruning/SinE : 14930
% 1.03/1.69 % Initial clauses : 1814
% 1.03/1.69 % Removed in clause preprocessing : 35
% 1.03/1.69 % Initial clauses in saturation : 1779
% 1.03/1.69 % Processed clauses : 27
% 1.03/1.69 % ...of these trivial : 0
% 1.03/1.69 % ...subsumed : 7
% 1.03/1.69 % ...remaining for further processing : 19
% 1.03/1.69 % Other redundant clauses eliminated : 0
% 1.03/1.69 % Clauses deleted for lack of memory : 0
% 1.03/1.69 % Backward-subsumed : 0
% 1.03/1.69 % Backward-rewritten : 0
% 1.03/1.69 % Generated clauses : 8
% 1.03/1.69 % ...of the previous two non-redundant : 7
% 1.03/1.69 % ...aggressively subsumed : 0
% 1.03/1.69 % Contextual simplify-reflections : 0
% 1.03/1.69 % Paramodulations : 7
% 1.03/1.69 % Factorizations : 0
% 1.03/1.69 % NegExts : 0
% 1.03/1.69 % Equation resolutions : 1
% 1.03/1.69 % Disequality decompositions : 0
% 1.03/1.69 % Total rewrite steps : 1
% 1.03/1.69 % ...of those cached : 0
% 1.03/1.69 % Propositional unsat checks : 0
% 1.03/1.69 % Propositional check models : 0
% 1.03/1.69 % Propositional check unsatisfiable : 0
% 1.03/1.69 % Propositional clauses : 0
% 1.03/1.69 % Propositional clauses after purity: 0
% 1.03/1.69 % Propositional unsat core size : 0
% 1.03/1.69 % Propositional preprocessing time : 0.000
% 1.03/1.69 % Propositional encoding time : 0.000
% 1.03/1.69 % Propositional solver time : 0.000
% 1.03/1.69 % Success case prop preproc time : 0.000
% 1.03/1.69 % Success case prop encoding time : 0.000
% 1.03/1.69 % Success case prop solver time : 0.000
% 1.03/1.69 % Current number of processed clauses : 19
% 1.03/1.69 % Positive orientable unit clauses : 6
% 1.03/1.69 % Positive unorientable unit clauses: 0
% 1.03/1.69 % Negative unit clauses : 6
% 1.03/1.69 % Non-unit-clauses : 7
% 1.03/1.69 % Current number of unprocessed clauses: 1759
% 1.03/1.69 % ...number of literals in the above : 5110
% 1.03/1.69 % Current number of archived formulas : 0
% 1.03/1.69 % Current number of archived clauses : 0
% 1.03/1.69 % Clause-clause subsumption calls (NU) : 6
% 1.03/1.69 % Rec. Clause-clause subsumption calls : 5
% 1.03/1.69 % Non-unit clause-clause subsumptions : 1
% 1.03/1.69 % Unit Clause-clause subsumption calls : 6
% 1.03/1.69 % Rewrite failures with RHS unbound : 0
% 1.03/1.69 % BW rewrite match attempts : 2
% 1.03/1.69 % BW rewrite match successes : 0
% 1.03/1.69 % Condensation attempts : 0
% 1.03/1.69 % Condensation successes : 0
% 1.03/1.69 % Termbank termtop insertions : 384952
% 1.03/1.69 % Search garbage collected termcells : 178242
% 1.03/1.69
% 1.03/1.69 % -------------------------------------------------
% 1.03/1.69 % User time : 0.292 s
% 1.03/1.69 % System time : 0.061 s
% 1.03/1.69 % Total time : 0.353 s
% 1.03/1.69 % Maximum resident set size: 44524 pages
% 1.03/1.69
% 1.03/1.69 % -------------------------------------------------
% 1.03/1.69 % User time : 1.289 s
% 1.03/1.69 % System time : 0.141 s
% 1.03/1.69 % Total time : 1.430 s
% 1.03/1.69 % Maximum resident set size: 38144 pages
% 1.03/1.69 % E exiting
%------------------------------------------------------------------------------