%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP136^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 : n009.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:37 AM UTC 2026
% Result : Theorem 0.23s 0.34s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 36 ( 17 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 106 ( 19 ~; 13 |; 5 &; 67 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 4 ( 0 ^; 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
paraco1605129243lle_tv: $tType ).
thf(decl_sort3,type,
list_char: $tType ).
thf(decl_sort4,type,
paraco1604210848lle_fm: $tType ).
thf(decl_52,type,
paraco761681009ge_int: ( nat > nat ) > ( list_char > paraco1605129243lle_tv ) > list_char > paraco1605129243lle_tv ).
thf(decl_55,type,
paraco1325918602e_eval: ( list_char > paraco1605129243lle_tv ) > paraco1604210848lle_fm > paraco1605129243lle_tv ).
thf(decl_62,type,
paraco1344940915le_Det: $o > paraco1605129243lle_tv ).
thf(decl_180,type,
f: nat > nat ).
thf(decl_181,type,
i: list_char > paraco1605129243lle_tv ).
thf(decl_183,type,
p2: paraco1604210848lle_fm ).
thf(fact_6_b,axiom,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ ~ $true ) ),
file('/export/starexec/sandbox/tmp/tmp.0u2ZR30Joz/E---3.1_278291.p',fact_6_b) ).
thf(conj_0,conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
!= ( paraco1344940915le_Det @ $true ) ),
file('/export/starexec/sandbox/tmp/tmp.0u2ZR30Joz/E---3.1_278291.p',conj_0) ).
thf(fact_8_tv_Oinject_I1_J,axiom,
! [X1: $o,X2: $o] :
( ( ( paraco1344940915le_Det @ X1 )
= ( paraco1344940915le_Det @ X2 ) )
<=> ( X1
<=> X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.0u2ZR30Joz/E---3.1_278291.p',fact_8_tv_Oinject_I1_J) ).
thf(c_0_3,axiom,
( ( ~ ~ $true
| ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ) )
& ( ~ $true
| ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $false ) ) ) ),
inference(fool_unroll,[status(thm)],[fact_6_b]) ).
thf(c_0_4,plain,
( ( $true
| ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ) )
& ( ~ $true
| ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $false ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
thf(c_0_5,negated_conjecture,
~ ( ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
!= ( paraco1344940915le_Det @ $true ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,plain,
( ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ ~ $true ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1138: $o,X1139: $o] :
( ( ~ X1138
| X1139
| ( ( paraco1344940915le_Det @ X1138 )
!= ( paraco1344940915le_Det @ X1139 ) ) )
& ( ~ X1139
| X1138
| ( ( paraco1344940915le_Det @ X1138 )
!= ( paraco1344940915le_Det @ X1139 ) ) )
& ( ~ X1138
| ~ X1139
| ( ( paraco1344940915le_Det @ X1138 )
= ( paraco1344940915le_Det @ X1139 ) ) )
& ( X1138
| X1139
| ( ( paraco1344940915le_Det @ X1138 )
= ( paraco1344940915le_Det @ X1139 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_tv_Oinject_I1_J])])])]) ).
thf(c_0_9,plain,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ ~ $true ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( ( paraco1344940915le_Det @ $true )
!= ( paraco1344940915le_Det @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8])])]) ).
thf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP136^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.16 % Computer : n009.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Tue Sep 29 19:59:00 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.23/0.27 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.0u2ZR30Joz/E---3.1_278291.p
% 0.23/0.34 % Version: 3.5.1-ho
% 0.23/0.34 % Preprocessing class: HSLMSMSMSSMNHSA.
% 0.23/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.34 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.34 % Starting full_lambda_7 with 300s (1) cores
% 0.23/0.34 % Starting new_ho_4 with 300s (1) cores
% 0.23/0.34 % Starting lpo5_fix with 300s (1) cores
% 0.23/0.34 % new_ho_4 with pid 278306 completed with status 0
% 0.23/0.34 % Result found by new_ho_4
% 0.23/0.34 % Preprocessing class: HSLMSMSMSSMNHSA.
% 0.23/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.34 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.34 % Starting full_lambda_7 with 300s (1) cores
% 0.23/0.34 % Starting new_ho_4 with 300s (1) cores
% 0.23/0.34 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,5.5,,2,20000,1.0,true))
% 0.23/0.34 % SinE strategy is GSinE(CountFormulas,hypos,5.5,,2,20000,1.0,true)
% 0.23/0.34 % Search class: HGHSM-FSLM31-MHSFFMBN
% 0.23/0.34 % partial match(1): HGHSM-FSLM31-MHSFFSBN
% 0.23/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.34 % SubtermCWHack with pid 278308 completed with status 0
% 0.23/0.34 % Result found by SubtermCWHack
% 0.23/0.34 % Preprocessing class: HSLMSMSMSSMNHSA.
% 0.23/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.34 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.34 % Starting full_lambda_7 with 300s (1) cores
% 0.23/0.34 % Starting new_ho_4 with 300s (1) cores
% 0.23/0.34 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,5.5,,2,20000,1.0,true))
% 0.23/0.34 % SinE strategy is GSinE(CountFormulas,hypos,5.5,,2,20000,1.0,true)
% 0.23/0.34 % Search class: HGHSM-FSLM31-MHSFFMBN
% 0.23/0.34 % partial match(1): HGHSM-FSLM31-MHSFFSBN
% 0.23/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.34 % Preprocessing time : 0.007 s
% 0.23/0.34
% 0.23/0.34 % Proof found!
% 0.23/0.34 % SZS status Theorem
% 0.23/0.34 % SZS output start CNFRefutation
% See solution above
% 0.23/0.34 % Parsed axioms : 555
% 0.23/0.34 % Removed by relevancy pruning/SinE : 434
% 0.23/0.34 % Initial clauses : 337
% 0.23/0.34 % Removed in clause preprocessing : 47
% 0.23/0.34 % Initial clauses in saturation : 290
% 0.23/0.34 % Processed clauses : 68
% 0.23/0.34 % ...of these trivial : 5
% 0.23/0.34 % ...subsumed : 9
% 0.23/0.34 % ...remaining for further processing : 53
% 0.23/0.34 % Other redundant clauses eliminated : 6
% 0.23/0.34 % Clauses deleted for lack of memory : 0
% 0.23/0.34 % Backward-subsumed : 0
% 0.23/0.34 % Backward-rewritten : 5
% 0.23/0.34 % Generated clauses : 37
% 0.23/0.34 % ...of the previous two non-redundant : 28
% 0.23/0.34 % ...aggressively subsumed : 0
% 0.23/0.34 % Contextual simplify-reflections : 0
% 0.23/0.34 % Paramodulations : 25
% 0.23/0.34 % Factorizations : 0
% 0.23/0.34 % NegExts : 0
% 0.23/0.34 % Equation resolutions : 9
% 0.23/0.34 % Disequality decompositions : 0
% 0.23/0.34 % Total rewrite steps : 18
% 0.23/0.34 % ...of those cached : 5
% 0.23/0.34 % Propositional unsat checks : 0
% 0.23/0.34 % Propositional check models : 0
% 0.23/0.34 % Propositional check unsatisfiable : 0
% 0.23/0.34 % Propositional clauses : 0
% 0.23/0.34 % Propositional clauses after purity: 0
% 0.23/0.34 % Propositional unsat core size : 0
% 0.23/0.34 % Propositional preprocessing time : 0.000
% 0.23/0.34 % Propositional encoding time : 0.000
% 0.23/0.34 % Propositional solver time : 0.000
% 0.23/0.34 % Success case prop preproc time : 0.000
% 0.23/0.34 % Success case prop encoding time : 0.000
% 0.23/0.34 % Success case prop solver time : 0.000
% 0.23/0.34 % Current number of processed clauses : 48
% 0.23/0.34 % Positive orientable unit clauses : 16
% 0.23/0.34 % Positive unorientable unit clauses: 2
% 0.23/0.34 % Negative unit clauses : 19
% 0.23/0.34 % Non-unit-clauses : 11
% 0.23/0.34 % Current number of unprocessed clauses: 248
% 0.23/0.34 % ...number of literals in the above : 1151
% 0.23/0.34 % Current number of archived formulas : 0
% 0.23/0.34 % Current number of archived clauses : 5
% 0.23/0.34 % Clause-clause subsumption calls (NU) : 12
% 0.23/0.34 % Rec. Clause-clause subsumption calls : 11
% 0.23/0.34 % Non-unit clause-clause subsumptions : 0
% 0.23/0.34 % Unit Clause-clause subsumption calls : 27
% 0.23/0.34 % Rewrite failures with RHS unbound : 17
% 0.23/0.34 % BW rewrite match attempts : 10
% 0.23/0.34 % BW rewrite match successes : 8
% 0.23/0.34 % Condensation attempts : 0
% 0.23/0.34 % Condensation successes : 0
% 0.23/0.34 % Termbank termtop insertions : 29102
% 0.23/0.34 % Search garbage collected termcells : 8887
% 0.23/0.34
% 0.23/0.34 % -------------------------------------------------
% 0.23/0.34 % User time : 0.025 s
% 0.23/0.34 % System time : 0.011 s
% 0.23/0.34 % Total time : 0.036 s
% 0.23/0.34 % Maximum resident set size: 6072 pages
% 0.23/0.34
% 0.23/0.34 % -------------------------------------------------
% 0.23/0.34 % User time : 0.038 s
% 0.23/0.34 % System time : 0.021 s
% 0.23/0.34 % Total time : 0.059 s
% 0.23/0.34 % Maximum resident set size: 5888 pages
% 0.23/0.34 % E exiting
%------------------------------------------------------------------------------