%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP166^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 : 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 : Wed Sep 30 08:05:43 AM UTC 2026
% Result : Theorem 0.20s 0.36s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 123 ( 9 ~; 6 |; 6 &; 102 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 14 usr; 5 con; 0-6 aty)
% Number of variables : 8 ( 0 ^; 4 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
bexp: $tType ).
thf(decl_sort2,type,
list_char: $tType ).
thf(decl_sort3,type,
int: $tType ).
thf(decl_sort4,type,
produc1260470173ar_int: $tType ).
thf(decl_sort5,type,
com: $tType ).
thf(decl_sort6,type,
nat: $tType ).
thf(decl_23,type,
bval: bexp > ( list_char > int ) > $o ).
thf(decl_31,type,
big_big_step: produc1260470173ar_int > ( list_char > int ) > $o ).
thf(decl_56,type,
suc: nat > nat ).
thf(decl_61,type,
produc1193801173ar_int: com > ( list_char > int ) > produc1260470173ar_int ).
thf(decl_68,type,
relati23543761ar_int: ( ( list_char > int ) > ( list_char > int ) > $o ) > bexp > com > nat > ( list_char > int ) > ( list_char > int ) > $o ).
thf(decl_87,type,
p: ( list_char > int ) > ( list_char > int ) > $o ).
thf(decl_89,type,
b: bexp ).
thf(decl_90,type,
c: com ).
thf(decl_91,type,
c2: com ).
thf(decl_93,type,
ka: nat ).
thf(decl_95,type,
s_a: list_char > int ).
thf(decl_97,type,
sa: list_char > int ).
thf(decl_99,type,
t_a: list_char > int ).
thf(decl_101,type,
ta: list_char > int ).
thf(conj_0,conjecture,
? [X30: list_char > int,X101: list_char > int] :
( ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ X30 @ X101 )
& ( bval @ b @ X30 )
& ( big_big_step @ ( produc1193801173ar_int @ c @ X30 ) @ ta )
& ( big_big_step @ ( produc1193801173ar_int @ c2 @ X101 ) @ t_a ) ),
file('/export/starexec/sandbox/tmp/tmp.1GNIfFbBHt/E---3.1_824421.p',conj_0) ).
thf(fact_4_Suc_Oprems_I7_J,axiom,
relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ s_a,
file('/export/starexec/sandbox/tmp/tmp.1GNIfFbBHt/E---3.1_824421.p',fact_4_Suc_Oprems_I7_J) ).
thf(fact_2_Suc_Oprems_I3_J,axiom,
big_big_step @ ( produc1193801173ar_int @ c @ sa ) @ ta,
file('/export/starexec/sandbox/tmp/tmp.1GNIfFbBHt/E---3.1_824421.p',fact_2_Suc_Oprems_I3_J) ).
thf(fact_3_Suc_Oprems_I4_J,axiom,
big_big_step @ ( produc1193801173ar_int @ c2 @ s_a ) @ t_a,
file('/export/starexec/sandbox/tmp/tmp.1GNIfFbBHt/E---3.1_824421.p',fact_3_Suc_Oprems_I4_J) ).
thf(fact_0_Suc_Oprems_I6_J,axiom,
bval @ b @ sa,
file('/export/starexec/sandbox/tmp/tmp.1GNIfFbBHt/E---3.1_824421.p',fact_0_Suc_Oprems_I6_J) ).
thf(c_0_5,negated_conjecture,
~ ? [X30: list_char > int,X101: list_char > int] :
( ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ X30 @ X101 )
& ( bval @ b @ X30 )
& ( big_big_step @ ( produc1193801173ar_int @ c @ X30 ) @ ta )
& ( big_big_step @ ( produc1193801173ar_int @ c2 @ X101 ) @ t_a ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,negated_conjecture,
! [X915: list_char > int,X916: list_char > int] :
( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ X915 @ X916 )
| ~ ( bval @ b @ X915 )
| ~ ( big_big_step @ ( produc1193801173ar_int @ c @ X915 ) @ ta )
| ~ ( big_big_step @ ( produc1193801173ar_int @ c2 @ X916 ) @ t_a ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
thf(c_0_7,negated_conjecture,
! [X8: list_char > int,X10: list_char > int] :
( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ X8 @ X10 )
| ~ ( bval @ b @ X8 )
| ~ ( big_big_step @ ( produc1193801173ar_int @ c @ X8 ) @ ta )
| ~ ( big_big_step @ ( produc1193801173ar_int @ c2 @ X10 ) @ t_a ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,plain,
relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ s_a,
inference(split_conjunct,[status(thm)],[fact_4_Suc_Oprems_I7_J]) ).
thf(c_0_9,plain,
big_big_step @ ( produc1193801173ar_int @ c @ sa ) @ ta,
inference(split_conjunct,[status(thm)],[fact_2_Suc_Oprems_I3_J]) ).
thf(c_0_10,plain,
big_big_step @ ( produc1193801173ar_int @ c2 @ s_a ) @ t_a,
inference(split_conjunct,[status(thm)],[fact_3_Suc_Oprems_I4_J]) ).
thf(c_0_11,plain,
bval @ b @ sa,
inference(split_conjunct,[status(thm)],[fact_0_Suc_Oprems_I6_J]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP166^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.19 % Computer : n017.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 20:00:07 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.20/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.1GNIfFbBHt/E---3.1_824421.p
% 0.20/0.36 % Version: 3.5.1-ho
% 0.20/0.36 % Preprocessing class: HSLSSMSSSSLNHHA.
% 0.20/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.36 % Starting full_lambda_1 with 1200s (4) cores
% 0.20/0.36 % Starting additional_ho_7 with 600s (2) cores
% 0.20/0.36 % Starting full_lambda_3 with 300s (1) cores
% 0.20/0.36 % Starting lpo8_s with 300s (1) cores
% 0.20/0.36 % additional_ho_7 with pid 824435 completed with status 0
% 0.20/0.36 % Result found by additional_ho_7
% 0.20/0.36 % Preprocessing class: HSLSSMSSSSLNHHA.
% 0.20/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.36 % Starting full_lambda_1 with 1200s (4) cores
% 0.20/0.36 % Starting additional_ho_7 with 600s (2) cores
% 0.20/0.36 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4.0,,2,20000,1.0))
% 0.20/0.36 % SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.20/0.36 % Search class: HGHSM-FSLM32-DHHFFSBN
% 0.20/0.36 % partial match(1): HGHSM-FSLM32-DHSFFSBN
% 0.20/0.36 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.36 % Starting SubtermCWHack with 55s (1) cores
% 0.20/0.36 % Starting additional_ho_7 with 61s (1) cores
% 0.20/0.36 % additional_ho_7 with pid 824441 completed with status 0
% 0.20/0.36 % Result found by additional_ho_7
% 0.20/0.36 % Preprocessing class: HSLSSMSSSSLNHHA.
% 0.20/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.36 % Starting full_lambda_1 with 1200s (4) cores
% 0.20/0.36 % Starting additional_ho_7 with 600s (2) cores
% 0.20/0.36 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4.0,,2,20000,1.0))
% 0.20/0.36 % SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.20/0.36 % Search class: HGHSM-FSLM32-DHHFFSBN
% 0.20/0.36 % partial match(1): HGHSM-FSLM32-DHSFFSBN
% 0.20/0.36 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.36 % Starting SubtermCWHack with 55s (1) cores
% 0.20/0.36 % Starting additional_ho_7 with 61s (1) cores
% 0.20/0.36 % Preprocessing time : 0.010 s
% 0.20/0.36
% 0.20/0.36 % Proof found!
% 0.20/0.36 % SZS status Theorem
% 0.20/0.36 % SZS output start CNFRefutation
% See solution above
% 0.20/0.36 % Parsed axioms : 330
% 0.20/0.36 % Removed by relevancy pruning/SinE : 181
% 0.20/0.36 % Initial clauses : 277
% 0.20/0.36 % Removed in clause preprocessing : 16
% 0.20/0.36 % Initial clauses in saturation : 261
% 0.20/0.36 % Processed clauses : 55
% 0.20/0.36 % ...of these trivial : 5
% 0.20/0.36 % ...subsumed : 9
% 0.20/0.36 % ...remaining for further processing : 41
% 0.20/0.36 % Other redundant clauses eliminated : 2
% 0.20/0.36 % Clauses deleted for lack of memory : 0
% 0.20/0.36 % Backward-subsumed : 0
% 0.20/0.36 % Backward-rewritten : 0
% 0.20/0.36 % Generated clauses : 32
% 0.20/0.36 % ...of the previous two non-redundant : 17
% 0.20/0.36 % ...aggressively subsumed : 0
% 0.20/0.36 % Contextual simplify-reflections : 0
% 0.20/0.36 % Paramodulations : 18
% 0.20/0.36 % Factorizations : 0
% 0.20/0.36 % NegExts : 0
% 0.20/0.36 % Equation resolutions : 5
% 0.20/0.36 % Disequality decompositions : 0
% 0.20/0.36 % Total rewrite steps : 8
% 0.20/0.36 % ...of those cached : 3
% 0.20/0.36 % Propositional unsat checks : 0
% 0.20/0.36 % Propositional check models : 0
% 0.20/0.36 % Propositional check unsatisfiable : 0
% 0.20/0.36 % Propositional clauses : 0
% 0.20/0.36 % Propositional clauses after purity: 0
% 0.20/0.36 % Propositional unsat core size : 0
% 0.20/0.36 % Propositional preprocessing time : 0.000
% 0.20/0.36 % Propositional encoding time : 0.000
% 0.20/0.36 % Propositional solver time : 0.000
% 0.20/0.36 % Success case prop preproc time : 0.000
% 0.20/0.36 % Success case prop encoding time : 0.000
% 0.20/0.36 % Success case prop solver time : 0.000
% 0.20/0.36 % Current number of processed clauses : 41
% 0.20/0.36 % Positive orientable unit clauses : 16
% 0.20/0.36 % Positive unorientable unit clauses: 0
% 0.20/0.36 % Negative unit clauses : 12
% 0.20/0.36 % Non-unit-clauses : 13
% 0.20/0.36 % Current number of unprocessed clauses: 215
% 0.20/0.36 % ...number of literals in the above : 713
% 0.20/0.36 % Current number of archived formulas : 0
% 0.20/0.36 % Current number of archived clauses : 0
% 0.20/0.36 % Clause-clause subsumption calls (NU) : 42
% 0.20/0.36 % Rec. Clause-clause subsumption calls : 13
% 0.20/0.36 % Non-unit clause-clause subsumptions : 4
% 0.20/0.36 % Unit Clause-clause subsumption calls : 67
% 0.20/0.36 % Rewrite failures with RHS unbound : 0
% 0.20/0.36 % BW rewrite match attempts : 2
% 0.20/0.36 % BW rewrite match successes : 0
% 0.20/0.36 % Condensation attempts : 0
% 0.20/0.36 % Condensation successes : 0
% 0.20/0.36 % Termbank termtop insertions : 27952
% 0.20/0.36 % Search garbage collected termcells : 8209
% 0.20/0.36
% 0.20/0.36 % -------------------------------------------------
% 0.20/0.36 % User time : 0.033 s
% 0.20/0.36 % System time : 0.007 s
% 0.20/0.36 % Total time : 0.041 s
% 0.20/0.36 % Maximum resident set size: 5596 pages
% 0.20/0.36
% 0.20/0.36 % -------------------------------------------------
% 0.20/0.36 % User time : 0.058 s
% 0.20/0.36 % System time : 0.016 s
% 0.20/0.36 % Total time : 0.074 s
% 0.20/0.36 % Maximum resident set size: 5632 pages
% 0.20/0.36 % E exiting
%------------------------------------------------------------------------------