%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP122^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:35 AM UTC 2026
% Result : Theorem 21.16s 3.48s
% Output : CNFRefutation 21.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 23 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 387 ( 9 ~; 4 |; 0 &; 373 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 4 con; 0-5 aty)
% Number of variables : 48 ( 0 ^; 48 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_34,type,
modula17988509_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(decl_35,type,
modula1373251614_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(decl_37,type,
modula1936294176_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(decl_38,type,
modula1144073633_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(decl_53,type,
a2: a ).
thf(decl_54,type,
b: a ).
thf(decl_55,type,
c: a ).
thf(decl_56,type,
inf: a > a > a ).
thf(decl_57,type,
less_eq: a > a > $o ).
thf(decl_58,type,
sup: a > a > a ).
thf(conj_1,conjecture,
( ( sup @ ( modula17988509_aux_a @ inf @ sup @ c @ a2 @ b ) @ ( modula17988509_aux_a @ inf @ sup @ a2 @ b @ c ) )
= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
file('/export/starexec/sandbox2/tmp/tmp.Fg7UEfHI60/E---3.1_3657101.p',conj_1) ).
thf(fact_135_a__join__b__eq__e,axiom,
! [X4: a,X3: a,X9: a] :
( ( less_eq @ ( modula1936294176_aux_a @ inf @ sup @ X4 @ X3 @ X9 ) @ ( modula1144073633_aux_a @ inf @ sup @ X4 @ X3 @ X9 ) )
=> ( ( sup @ ( modula17988509_aux_a @ inf @ sup @ X4 @ X3 @ X9 ) @ ( modula1373251614_aux_a @ inf @ sup @ X4 @ X3 @ X9 ) )
= ( modula1144073633_aux_a @ inf @ sup @ X4 @ X3 @ X9 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Fg7UEfHI60/E---3.1_3657101.p',fact_135_a__join__b__eq__e) ).
thf(fact_132_local_Ob__a,axiom,
! [X4: a,X3: a,X9: a] :
( ( modula1373251614_aux_a @ inf @ sup @ X4 @ X3 @ X9 )
= ( modula17988509_aux_a @ inf @ sup @ X3 @ X9 @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Fg7UEfHI60/E---3.1_3657101.p',fact_132_local_Ob__a) ).
thf(fact_20_local_Osup_Ocommute,axiom,
! [X4: a,X3: a] :
( ( sup @ X4 @ X3 )
= ( sup @ X3 @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Fg7UEfHI60/E---3.1_3657101.p',fact_20_local_Osup_Ocommute) ).
thf(fact_87_local_Od__b__c__a,axiom,
! [X3: a,X9: a,X4: a] :
( ( modula1936294176_aux_a @ inf @ sup @ X3 @ X9 @ X4 )
= ( modula1936294176_aux_a @ inf @ sup @ X4 @ X3 @ X9 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Fg7UEfHI60/E---3.1_3657101.p',fact_87_local_Od__b__c__a) ).
thf(fact_93_local_Oe__b__c__a,axiom,
! [X3: a,X9: a,X4: a] :
( ( modula1144073633_aux_a @ inf @ sup @ X3 @ X9 @ X4 )
= ( modula1144073633_aux_a @ inf @ sup @ X4 @ X3 @ X9 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Fg7UEfHI60/E---3.1_3657101.p',fact_93_local_Oe__b__c__a) ).
thf(conj_0,hypothesis,
less_eq @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ),
file('/export/starexec/sandbox2/tmp/tmp.Fg7UEfHI60/E---3.1_3657101.p',conj_0) ).
thf(c_0_7,negated_conjecture,
( ( sup @ ( modula17988509_aux_a @ inf @ sup @ c @ a2 @ b ) @ ( modula17988509_aux_a @ inf @ sup @ a2 @ b @ c ) )
!= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
thf(c_0_8,negated_conjecture,
( ( sup @ ( modula17988509_aux_a @ inf @ sup @ c @ a2 @ b ) @ ( modula17988509_aux_a @ inf @ sup @ a2 @ b @ c ) )
!= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
thf(c_0_9,plain,
! [X641: a,X642: a,X643: a] :
( ~ ( less_eq @ ( modula1936294176_aux_a @ inf @ sup @ X641 @ X642 @ X643 ) @ ( modula1144073633_aux_a @ inf @ sup @ X641 @ X642 @ X643 ) )
| ( ( sup @ ( modula17988509_aux_a @ inf @ sup @ X641 @ X642 @ X643 ) @ ( modula1373251614_aux_a @ inf @ sup @ X641 @ X642 @ X643 ) )
= ( modula1144073633_aux_a @ inf @ sup @ X641 @ X642 @ X643 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_135_a__join__b__eq__e])])]) ).
thf(c_0_10,plain,
! [X746: a,X747: a,X748: a] :
( ( modula1373251614_aux_a @ inf @ sup @ X746 @ X747 @ X748 )
= ( modula17988509_aux_a @ inf @ sup @ X747 @ X748 @ X746 ) ),
inference(variable_rename,[status(thm)],[fact_132_local_Ob__a]) ).
thf(c_0_11,negated_conjecture,
( ( sup @ ( modula17988509_aux_a @ inf @ sup @ c @ a2 @ b ) @ ( modula17988509_aux_a @ inf @ sup @ a2 @ b @ c ) )
!= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X656: a,X657: a] :
( ( sup @ X656 @ X657 )
= ( sup @ X657 @ X656 ) ),
inference(variable_rename,[status(thm)],[fact_20_local_Osup_Ocommute]) ).
thf(c_0_13,plain,
! [X1: a,X2: a,X3: a] :
( ( ( sup @ ( modula17988509_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) @ ( modula1373251614_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) )
= ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) )
| ~ ( less_eq @ ( modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) @ ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
! [X3: a,X2: a,X1: a] :
( ( modula1373251614_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
= ( modula17988509_aux_a @ inf @ sup @ X2 @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
( ( sup @ ( modula17988509_aux_a @ inf @ sup @ c @ a2 @ b ) @ ( modula17988509_aux_a @ inf @ sup @ a2 @ b @ c ) )
!= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,plain,
! [X2: a,X1: a] :
( ( sup @ X1 @ X2 )
= ( sup @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,plain,
! [X1: a,X2: a,X3: a] :
( ( ( sup @ ( modula17988509_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) @ ( modula17988509_aux_a @ inf @ sup @ X2 @ X3 @ X1 ) )
= ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) )
| ~ ( less_eq @ ( modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) @ ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) ) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_18,plain,
! [X737: a,X738: a,X739: a] :
( ( modula1936294176_aux_a @ inf @ sup @ X737 @ X738 @ X739 )
= ( modula1936294176_aux_a @ inf @ sup @ X739 @ X737 @ X738 ) ),
inference(variable_rename,[status(thm)],[fact_87_local_Od__b__c__a]) ).
thf(c_0_19,plain,
! [X614: a,X615: a,X616: a] :
( ( modula1144073633_aux_a @ inf @ sup @ X614 @ X615 @ X616 )
= ( modula1144073633_aux_a @ inf @ sup @ X616 @ X614 @ X615 ) ),
inference(variable_rename,[status(thm)],[fact_93_local_Oe__b__c__a]) ).
thf(c_0_20,negated_conjecture,
( ( sup @ ( modula17988509_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( modula17988509_aux_a @ inf @ sup @ c @ a2 @ b ) )
!= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,plain,
! [X1: a,X3: a,X2: a] :
( ( ( sup @ ( modula17988509_aux_a @ inf @ sup @ X1 @ X2 @ X3 ) @ ( modula17988509_aux_a @ inf @ sup @ X3 @ X1 @ X2 ) )
= ( modula1144073633_aux_a @ inf @ sup @ X3 @ X1 @ X2 ) )
| ~ ( less_eq @ ( modula1936294176_aux_a @ inf @ sup @ X3 @ X1 @ X2 ) @ ( modula1144073633_aux_a @ inf @ sup @ X3 @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
! [X1: a,X3: a,X2: a] :
( ( modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
= ( modula1936294176_aux_a @ inf @ sup @ X3 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
! [X1: a,X3: a,X2: a] :
( ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
= ( modula1144073633_aux_a @ inf @ sup @ X3 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_24,hypothesis,
less_eq @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ),
inference(split_conjunct,[status(thm)],[conj_0]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_22]),c_0_23]),c_0_23]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP122^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n008.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 19:57:39 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.20/0.27 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Fg7UEfHI60/E---3.1_3657101.p
% 21.16/3.48 % Version: 3.5.1-ho
% 21.16/3.48 % Preprocessing class: HSLSSMSSSSSNHSA.
% 21.16/3.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.16/3.48 % Starting full_lambda_9 with 1500s (5) cores
% 21.16/3.48 % Starting new_ho_11 with 300s (1) cores
% 21.16/3.48 % Starting sh2l with 300s (1) cores
% 21.16/3.48 % Starting new_bool_6 with 300s (1) cores
% 21.16/3.48 % full_lambda_9 with pid 3657114 completed with status 0
% 21.16/3.48 % Result found by full_lambda_9
% 21.16/3.48 % Preprocessing class: HSLSSMSSSSSNHSA.
% 21.16/3.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.16/3.48 % Starting full_lambda_9 with 1500s (5) cores
% 21.16/3.48 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 21.16/3.48 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 21.16/3.48 % Search class: HGUSM-FFLS32-MHSFFFNN
% 21.16/3.48 % partial match(2): HGUSM-FSLM32-MHSFFFNN
% 21.16/3.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 21.16/3.48 % Starting SubtermCWHack with 136s (1) cores
% 21.16/3.48 % Starting full_lambda_9 with 151s (1) cores
% 21.16/3.48 % Starting sh5l with 136s (1) cores
% 21.16/3.48 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 21.16/3.48 % Starting lpo1_def_fix with 136s (1) cores
% 21.16/3.48 % full_lambda_9 with pid 3657120 completed with status 0
% 21.16/3.48 % Result found by full_lambda_9
% 21.16/3.48 % Preprocessing class: HSLSSMSSSSSNHSA.
% 21.16/3.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.16/3.48 % Starting full_lambda_9 with 1500s (5) cores
% 21.16/3.48 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 21.16/3.48 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 21.16/3.48 % Search class: HGUSM-FFLS32-MHSFFFNN
% 21.16/3.48 % partial match(2): HGUSM-FSLM32-MHSFFFNN
% 21.16/3.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 21.16/3.48 % Starting SubtermCWHack with 136s (1) cores
% 21.16/3.48 % Starting full_lambda_9 with 151s (1) cores
% 21.16/3.48 % Preprocessing time : 0.016 s
% 21.16/3.48 % Presaturation interreduction done
% 21.16/3.48
% 21.16/3.48 % Proof found!
% 21.16/3.48 % SZS status Theorem
% 21.16/3.48 % SZS output start CNFRefutation
% See solution above
% 21.16/3.48 % Parsed axioms : 294
% 21.16/3.48 % Removed by relevancy pruning/SinE : 160
% 21.16/3.48 % Initial clauses : 159
% 21.16/3.48 % Removed in clause preprocessing : 8
% 21.16/3.48 % Initial clauses in saturation : 151
% 21.16/3.48 % Processed clauses : 2858
% 21.16/3.48 % ...of these trivial : 303
% 21.16/3.48 % ...subsumed : 1387
% 21.16/3.48 % ...remaining for further processing : 1167
% 21.16/3.48 % Other redundant clauses eliminated : 145
% 21.16/3.48 % Clauses deleted for lack of memory : 0
% 21.16/3.48 % Backward-subsumed : 189
% 21.16/3.48 % Backward-rewritten : 18
% 21.16/3.48 % Generated clauses : 105078
% 21.16/3.48 % ...of the previous two non-redundant : 97595
% 21.16/3.48 % ...aggressively subsumed : 0
% 21.16/3.48 % Contextual simplify-reflections : 16
% 21.16/3.48 % Paramodulations : 104891
% 21.16/3.48 % Factorizations : 0
% 21.16/3.48 % NegExts : 0
% 21.16/3.48 % Equation resolutions : 145
% 21.16/3.48 % Disequality decompositions : 0
% 21.16/3.48 % Total rewrite steps : 55256
% 21.16/3.48 % ...of those cached : 43289
% 21.16/3.48 % Propositional unsat checks : 0
% 21.16/3.48 % Propositional check models : 0
% 21.16/3.48 % Propositional check unsatisfiable : 0
% 21.16/3.48 % Propositional clauses : 0
% 21.16/3.48 % Propositional clauses after purity: 0
% 21.16/3.48 % Propositional unsat core size : 0
% 21.16/3.48 % Propositional preprocessing time : 0.000
% 21.16/3.48 % Propositional encoding time : 0.000
% 21.16/3.48 % Propositional solver time : 0.000
% 21.16/3.48 % Success case prop preproc time : 0.000
% 21.16/3.48 % Success case prop encoding time : 0.000
% 21.16/3.48 % Success case prop solver time : 0.000
% 21.16/3.48 % Current number of processed clauses : 874
% 21.16/3.48 % Positive orientable unit clauses : 229
% 21.16/3.48 % Positive unorientable unit clauses: 10
% 21.16/3.48 % Negative unit clauses : 1
% 21.16/3.48 % Non-unit-clauses : 634
% 21.16/3.48 % Current number of unprocessed clauses: 94927
% 21.16/3.48 % ...number of literals in the above : 200296
% 21.16/3.48 % Current number of archived formulas : 0
% 21.16/3.48 % Current number of archived clauses : 292
% 21.16/3.48 % Clause-clause subsumption calls (NU) : 87593
% 21.16/3.48 % Rec. Clause-clause subsumption calls : 42905
% 21.16/3.48 % Non-unit clause-clause subsumptions : 1433
% 21.16/3.48 % Unit Clause-clause subsumption calls : 1805
% 21.16/3.48 % Rewrite failures with RHS unbound : 0
% 21.16/3.48 % BW rewrite match attempts : 1399
% 21.16/3.48 % BW rewrite match successes : 148
% 21.16/3.48 % Condensation attempts : 0
% 21.16/3.48 % Condensation successes : 0
% 21.16/3.48 % Termbank termtop insertions : 1762640
% 21.16/3.48 % Search garbage collected termcells : 3353
% 21.16/3.48
% 21.16/3.48 % -------------------------------------------------
% 21.16/3.48 % User time : 2.995 s
% 21.16/3.48 % System time : 0.114 s
% 21.16/3.48 % Total time : 3.109 s
% 21.16/3.48 % Maximum resident set size: 4492 pages
% 21.16/3.48
% 21.16/3.48 % -------------------------------------------------
% 21.16/3.48 % User time : 14.614 s
% 21.16/3.48 % System time : 0.405 s
% 21.16/3.48 % Total time : 15.018 s
% 21.16/3.48 % Maximum resident set size: 5120 pages
% 21.16/3.48 % E exiting
%------------------------------------------------------------------------------