%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP192^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 : Wed Sep 30 08:05:47 AM UTC 2026
% Result : Theorem 12.48s 2.56s
% Output : CNFRefutation 12.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 13 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 169 ( 23 ~; 14 |; 4 &; 123 @)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 42 ( 8 ^; 34 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
noption_pi: $tType ).
thf(decl_sort2,type,
pi: $tType ).
thf(decl_sort3,type,
name: $tType ).
thf(decl_sort4,type,
late_subject: $tType ).
thf(decl_sort5,type,
late_residual: $tType ).
thf(decl_38,type,
late_BoundR: late_subject > name > pi > late_residual ).
thf(decl_41,type,
late_InputS: name > late_subject ).
thf(decl_42,type,
late_transitions: pi > late_residual > $o ).
thf(decl_44,type,
abs_fun_name_pi: name > pi > name > noption_pi ).
thf(decl_48,type,
fresh_543891186ion_pi: name > ( name > noption_pi ) > $o ).
thf(decl_51,type,
fresh_name_name: name > name > $o ).
thf(decl_52,type,
fresh_name_pi: name > pi > $o ).
thf(decl_54,type,
fresh_81631222sidual: name > late_residual > $o ).
thf(decl_55,type,
fresh_717452603ubject: name > late_subject > $o ).
thf(decl_93,type,
p: pi ).
thf(decl_95,type,
p2: pi ).
thf(decl_100,type,
aa: name ).
thf(decl_101,type,
x: name ).
thf(decl_103,type,
y: name ).
thf(fact_97_freshResidual,axiom,
! [X4: pi,X156: late_residual,X8: name] :
( ( late_transitions @ X4 @ X156 )
=> ( ( fresh_name_pi @ X8 @ X4 )
=> ( fresh_81631222sidual @ X8 @ X156 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HUeYBpdzKS/E---3.1_1247306.p',fact_97_freshResidual) ).
thf(conj_0,conjecture,
x != aa,
file('/export/starexec/sandbox/tmp/tmp.HUeYBpdzKS/E---3.1_1247306.p',conj_0) ).
thf(fact_30_name__fresh,axiom,
( fresh_name_name
= ( ^ [X24: name,X25: name] : ( X24 != X25 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HUeYBpdzKS/E---3.1_1247306.p',fact_30_name__fresh) ).
thf(fact_207_residual_Ofresh_I1_J,axiom,
! [X1: name,X386: late_subject,X387: name,X2: pi] :
( ( fresh_81631222sidual @ X1 @ ( late_BoundR @ X386 @ X387 @ X2 ) )
<=> ( ( fresh_717452603ubject @ X1 @ X386 )
& ( fresh_543891186ion_pi @ X1 @ ( abs_fun_name_pi @ X387 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HUeYBpdzKS/E---3.1_1247306.p',fact_207_residual_Ofresh_I1_J) ).
thf(fact_3_assms_I1_J,axiom,
fresh_name_pi @ x @ p,
file('/export/starexec/sandbox/tmp/tmp.HUeYBpdzKS/E---3.1_1247306.p',fact_3_assms_I1_J) ).
thf(fact_8_cClose1_Ohyps_I1_J,axiom,
late_transitions @ p @ ( late_BoundR @ ( late_InputS @ aa ) @ y @ p2 ),
file('/export/starexec/sandbox/tmp/tmp.HUeYBpdzKS/E---3.1_1247306.p',fact_8_cClose1_Ohyps_I1_J) ).
thf(fact_93_subject_Ofresh_I1_J,axiom,
! [X1: name,X152: name] :
( ( fresh_717452603ubject @ X1 @ ( late_InputS @ X152 ) )
<=> ( fresh_name_name @ X1 @ X152 ) ),
file('/export/starexec/sandbox/tmp/tmp.HUeYBpdzKS/E---3.1_1247306.p',fact_93_subject_Ofresh_I1_J) ).
thf(c_0_7,plain,
! [X2581: pi,X2582: late_residual,X2583: name] :
( ~ ( late_transitions @ X2581 @ X2582 )
| ~ ( fresh_name_pi @ X2583 @ X2581 )
| ( fresh_81631222sidual @ X2583 @ X2582 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_97_freshResidual])])]) ).
thf(c_0_8,negated_conjecture,
~ ( ( x != aa ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_9,plain,
( fresh_name_name
= ( ^ [Z0: name,Z1: name] : ( Z0 != Z1 ) ) ),
inference(fof_simplification,[status(thm)],[fact_30_name__fresh]) ).
thf(c_0_10,plain,
! [X3145: name,X3146: late_subject,X3147: name,X3148: pi] :
( ( ( fresh_717452603ubject @ X3145 @ X3146 )
| ~ ( fresh_81631222sidual @ X3145 @ ( late_BoundR @ X3146 @ X3147 @ X3148 ) ) )
& ( ( fresh_543891186ion_pi @ X3145 @ ( abs_fun_name_pi @ X3147 @ X3148 ) )
| ~ ( fresh_81631222sidual @ X3145 @ ( late_BoundR @ X3146 @ X3147 @ X3148 ) ) )
& ( ~ ( fresh_717452603ubject @ X3145 @ X3146 )
| ~ ( fresh_543891186ion_pi @ X3145 @ ( abs_fun_name_pi @ X3147 @ X3148 ) )
| ( fresh_81631222sidual @ X3145 @ ( late_BoundR @ X3146 @ X3147 @ X3148 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_207_residual_Ofresh_I1_J])])])]) ).
thf(c_0_11,plain,
! [X1: name,X40: late_residual,X2: pi] :
( ( fresh_81631222sidual @ X1 @ X40 )
| ~ ( late_transitions @ X2 @ X40 )
| ~ ( fresh_name_pi @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
fresh_name_pi @ x @ p,
inference(split_conjunct,[status(thm)],[fact_3_assms_I1_J]) ).
thf(c_0_13,negated_conjecture,
x = aa,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
( fresh_name_name
= ( ^ [Z0: name,Z1: name] : ( Z0 != Z1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X1: name,X18: late_subject,X7: name,X2: pi] :
( ( fresh_717452603ubject @ X1 @ X18 )
| ~ ( fresh_81631222sidual @ X1 @ ( late_BoundR @ X18 @ X7 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X40: late_residual] :
( ( fresh_81631222sidual @ x @ X40 )
| ~ ( late_transitions @ p @ X40 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_17,plain,
late_transitions @ p @ ( late_BoundR @ ( late_InputS @ aa ) @ y @ p2 ),
inference(split_conjunct,[status(thm)],[fact_8_cClose1_Ohyps_I1_J]) ).
thf(c_0_18,negated_conjecture,
x = aa,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,plain,
( ( ^ [Z0: name,Z1: name] : ( Z0 != Z1 ) )
= fresh_name_name ),
inference(cn,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
! [X2569: name,X2570: name] :
( ( ~ ( fresh_717452603ubject @ X2569 @ ( late_InputS @ X2570 ) )
| ( fresh_name_name @ X2569 @ X2570 ) )
& ( ~ ( fresh_name_name @ X2569 @ X2570 )
| ( fresh_717452603ubject @ X2569 @ ( late_InputS @ X2570 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_93_subject_Ofresh_I1_J])])]) ).
thf(c_0_21,plain,
! [X1: name,X18: late_subject,X2: pi] :
( ( fresh_717452603ubject @ x @ X18 )
| ~ ( late_transitions @ p @ ( late_BoundR @ X18 @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_22,plain,
late_transitions @ p @ ( late_BoundR @ ( late_InputS @ x ) @ y @ p2 ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_23,plain,
! [X3898: name,X3899: name] :
( ( X3898 != X3899 )
<=> ( fresh_name_name @ X3898 @ X3899 ) ),
inference(arg_cong,[status(thm)],[c_0_19]) ).
thf(c_0_24,plain,
! [X1: name,X7: name] :
( ( fresh_name_name @ X1 @ X7 )
| ~ ( fresh_717452603ubject @ X1 @ ( late_InputS @ X7 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_25,plain,
fresh_717452603ubject @ x @ ( late_InputS @ x ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_26,plain,
! [X1: name] :
~ ( fresh_name_name @ X1 @ X1 ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_23])]) ).
thf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP192^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n006.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 20:09:39 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.23/0.29 Running: /export/starexec/sandbox/solver/bin/eprover-ho --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.HUeYBpdzKS/E---3.1_1247306.p
% 12.48/2.56 % Version: 3.5.1-ho
% 12.48/2.56 % Preprocessing class: HSLSSMSMSSSNSFA.
% 12.48/2.56 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 12.48/2.56 % Starting new_ho_10 with 900s (3) cores
% 12.48/2.56 % Starting sh2lt with 300s (1) cores
% 12.48/2.56 % Starting new_ho_5 with 300s (1) cores
% 12.48/2.56 % Starting full_lambda_5 with 300s (1) cores
% 12.48/2.56 % Starting sh9 with 300s (1) cores
% 12.48/2.56 % Starting ehoh_best8_lambda with 300s (1) cores
% 12.48/2.56 % full_lambda_5 with pid 1247325 completed with status 0
% 12.48/2.56 % Result found by full_lambda_5
% 12.48/2.56 % Preprocessing class: HSLSSMSMSSSNSFA.
% 12.48/2.56 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 12.48/2.56 % Starting new_ho_10 with 900s (3) cores
% 12.48/2.56 % Starting sh2lt with 300s (1) cores
% 12.48/2.56 % Starting new_ho_5 with 300s (1) cores
% 12.48/2.56 % Starting full_lambda_5 with 300s (1) cores
% 12.48/2.56 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 12.48/2.56 % No SInE strategy applied
% 12.48/2.56 % Search class: HGHSM-SMLM31-DSFFFMBN
% 12.48/2.56 % partial match(1): HGHSM-SMLM31-MSFFFMBN
% 12.48/2.56 % Scheduled 7 strats onto 1 cores with 299 seconds (299 total)
% 12.48/2.56 % Starting SubtermCWHack with 27s (1) cores
% 12.48/2.56 % SubtermCWHack with pid 1247477 completed with status 0
% 12.48/2.56 % Result found by SubtermCWHack
% 12.48/2.56 % Preprocessing class: HSLSSMSMSSSNSFA.
% 12.48/2.56 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 12.48/2.56 % Starting new_ho_10 with 900s (3) cores
% 12.48/2.56 % Starting sh2lt with 300s (1) cores
% 12.48/2.56 % Starting new_ho_5 with 300s (1) cores
% 12.48/2.56 % Starting full_lambda_5 with 300s (1) cores
% 12.48/2.56 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 12.48/2.56 % No SInE strategy applied
% 12.48/2.56 % Search class: HGHSM-SMLM31-DSFFFMBN
% 12.48/2.56 % partial match(1): HGHSM-SMLM31-MSFFFMBN
% 12.48/2.56 % Scheduled 7 strats onto 1 cores with 299 seconds (299 total)
% 12.48/2.56 % Starting SubtermCWHack with 27s (1) cores
% 12.48/2.56 % Preprocessing time : 0.709 s
% 12.48/2.56
% 12.48/2.56 % Proof found!
% 12.48/2.56 % SZS status Theorem
% 12.48/2.56 % SZS output start CNFRefutation
% See solution above
% 12.48/2.56 % Parsed axioms : 430
% 12.48/2.56 % Removed by relevancy pruning/SinE : 0
% 12.48/2.56 % Initial clauses : 28659
% 12.48/2.56 % Removed in clause preprocessing : 143
% 12.48/2.56 % Initial clauses in saturation : 28516
% 12.48/2.56 % Processed clauses : 944
% 12.48/2.56 % ...of these trivial : 33
% 12.48/2.56 % ...subsumed : 89
% 12.48/2.56 % ...remaining for further processing : 822
% 12.48/2.56 % Other redundant clauses eliminated : 82
% 12.48/2.56 % Clauses deleted for lack of memory : 0
% 12.48/2.56 % Backward-subsumed : 0
% 12.48/2.56 % Backward-rewritten : 43
% 12.48/2.56 % Generated clauses : 7402
% 12.48/2.56 % ...of the previous two non-redundant : 7232
% 12.48/2.56 % ...aggressively subsumed : 0
% 12.48/2.56 % Contextual simplify-reflections : 0
% 12.48/2.56 % Paramodulations : 7253
% 12.48/2.56 % Factorizations : 0
% 12.48/2.56 % NegExts : 0
% 12.48/2.56 % Equation resolutions : 112
% 12.48/2.56 % Disequality decompositions : 0
% 12.48/2.56 % Total rewrite steps : 169
% 12.48/2.56 % ...of those cached : 78
% 12.48/2.56 % Propositional unsat checks : 0
% 12.48/2.56 % Propositional check models : 0
% 12.48/2.56 % Propositional check unsatisfiable : 0
% 12.48/2.56 % Propositional clauses : 0
% 12.48/2.56 % Propositional clauses after purity: 0
% 12.48/2.56 % Propositional unsat core size : 0
% 12.48/2.56 % Propositional preprocessing time : 0.000
% 12.48/2.56 % Propositional encoding time : 0.000
% 12.48/2.56 % Propositional solver time : 0.000
% 12.48/2.56 % Success case prop preproc time : 0.000
% 12.48/2.56 % Success case prop encoding time : 0.000
% 12.48/2.56 % Success case prop solver time : 0.000
% 12.48/2.56 % Current number of processed clauses : 769
% 12.48/2.56 % Positive orientable unit clauses : 510
% 12.48/2.56 % Positive unorientable unit clauses: 0
% 12.48/2.56 % Negative unit clauses : 64
% 12.48/2.56 % Non-unit-clauses : 195
% 12.48/2.56 % Current number of unprocessed clauses: 34776
% 12.48/2.56 % ...number of literals in the above : 313886
% 12.48/2.56 % Current number of archived formulas : 0
% 12.48/2.56 % Current number of archived clauses : 45
% 12.48/2.56 % Clause-clause subsumption calls (NU) : 7663
% 12.48/2.56 % Rec. Clause-clause subsumption calls : 7040
% 12.48/2.56 % Non-unit clause-clause subsumptions : 75
% 12.48/2.56 % Unit Clause-clause subsumption calls : 2317
% 12.48/2.56 % Rewrite failures with RHS unbound : 0
% 12.48/2.56 % BW rewrite match attempts : 18736
% 12.48/2.56 % BW rewrite match successes : 27
% 12.48/2.56 % Condensation attempts : 0
% 12.48/2.56 % Condensation successes : 0
% 12.48/2.56 % Termbank termtop insertions : 2964973
% 12.48/2.56 % Search garbage collected termcells : 193612
% 12.48/2.56
% 12.48/2.56 % -------------------------------------------------
% 12.48/2.56 % User time : 2.068 s
% 12.48/2.56 % System time : 0.130 s
% 12.48/2.56 % Total time : 2.197 s
% 12.48/2.56 % Maximum resident set size: 63852 pages
% 12.48/2.56
% 12.48/2.56 % -------------------------------------------------
% 12.48/2.56 % User time : 2.084 s
% 12.48/2.56 % System time : 0.141 s
% 12.48/2.56 % Total time : 2.225 s
% 12.48/2.56 % Maximum resident set size: 5888 pages
% 12.48/2.56 % E exiting
%------------------------------------------------------------------------------