%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL955^24 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:12:53 AM UTC 2026
% Result : Theorem 1.51s 0.79s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 148 ( 10 equ; 0 cnn)
% Maximal formula atoms : 56 ( 6 avg)
% Number of connectives : 382 ( 36 ~; 37 |; 24 &; 268 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 21 usr; 11 con; 0-3 aty)
% Number of variables : 46 ( 22 ^; 24 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_23,type,
mrel: mworld > mworld > $o ).
thf(decl_24,type,
mactual: mworld ).
thf(decl_25,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_26,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(decl_27,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_29,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_31,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_37,type,
true: mworld > $o ).
thf(decl_40,type,
tptp_float_0_001: $i ).
thf(decl_42,type,
loopcounter: $i ).
thf(decl_43,type,
pv65: $i ).
thf(decl_45,type,
n1: $i ).
thf(decl_51,type,
geq: $i > $i > mworld > $o ).
thf(decl_54,type,
gt: $i > $i > mworld > $o ).
thf(decl_58,type,
plus: $i > $i > $i ).
thf(decl_183,type,
esk100_0: mworld ).
thf(decl_184,type,
esk101_0: mworld ).
thf(decl_185,type,
esk102_1: mworld > mworld ).
thf(decl_186,type,
esk103_0: mworld ).
thf(decl_187,type,
esk104_0: mworld ).
thf(decl_188,type,
esk105_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2GibmHivvL/E---3.1_606258.p',mlocal_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2GibmHivvL/E---3.1_606258.p',mbox_def) ).
thf(cl5_nebula_array_0028,conjecture,
mlocal @ ( mbox @ ( mimplies @ ( mbox @ ( geq @ pv65 @ tptp_float_0_001 ) ) @ ( mand @ ( mbox @ ( mimplies @ ( mbox @ ( mnot @ ( mbox @ ( gt @ ( plus @ n1 @ loopcounter ) @ n1 ) ) ) ) @ ( mbox @ true ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ ( gt @ ( plus @ n1 @ loopcounter ) @ n1 ) ) @ ( mbox @ true ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2GibmHivvL/E---3.1_606258.p',cl5_nebula_array_0028) ).
thf(mnot_def,axiom,
( mnot
= ( ^ [X2: mworld > $o,X3: mworld] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2GibmHivvL/E---3.1_606258.p',mnot_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2GibmHivvL/E---3.1_606258.p',mand_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2GibmHivvL/E---3.1_606258.p',mimplies_def) ).
thf(ttrue,axiom,
mlocal @ ( mbox @ true ),
file('/export/starexec/sandbox/tmp/tmp.2GibmHivvL/E---3.1_606258.p',ttrue) ).
thf(mrel_universal,axiom,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
file('/export/starexec/sandbox/tmp/tmp.2GibmHivvL/E---3.1_606258.p',mrel_universal) ).
thf(c_0_8,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_9,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_10,negated_conjecture,
~ ( mlocal @ ( mbox @ ( mimplies @ ( mbox @ ( geq @ pv65 @ tptp_float_0_001 ) ) @ ( mand @ ( mbox @ ( mimplies @ ( mbox @ ( mnot @ ( mbox @ ( gt @ ( plus @ n1 @ loopcounter ) @ n1 ) ) ) ) @ ( mbox @ true ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ ( gt @ ( plus @ n1 @ loopcounter ) @ n1 ) ) @ ( mbox @ true ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0028]) ).
thf(c_0_11,plain,
( mnot
= ( ^ [Z0: mworld > $o,Z1: mworld] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot_def]) ).
thf(c_0_12,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_13,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_14,plain,
! [X1202: mworld] :
( ( mrel @ mactual @ X1202 )
=> ( true @ X1202 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ttrue,c_0_8]),c_0_9]) ).
thf(c_0_15,negated_conjecture,
~ ! [X1213: mworld] :
( ( mrel @ mactual @ X1213 )
=> ( ! [X1205: mworld] :
( ( mrel @ X1213 @ X1205 )
=> ( geq @ pv65 @ tptp_float_0_001 @ X1205 ) )
=> ( ! [X1209: mworld] :
( ( mrel @ X1213 @ X1209 )
=> ( ! [X1207: mworld] :
( ( mrel @ X1209 @ X1207 )
=> ~ ! [X1206: mworld] :
( ( mrel @ X1207 @ X1206 )
=> ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ X1206 ) ) )
=> ! [X1208: mworld] :
( ( mrel @ X1209 @ X1208 )
=> ( true @ X1208 ) ) ) )
& ! [X1212: mworld] :
( ( mrel @ X1213 @ X1212 )
=> ( ! [X1210: mworld] :
( ( mrel @ X1212 @ X1210 )
=> ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ X1210 ) )
=> ! [X1211: mworld] :
( ( mrel @ X1212 @ X1211 )
=> ( true @ X1211 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10,c_0_8]),c_0_11]),c_0_12]),c_0_13]),c_0_9]) ).
thf(c_0_16,plain,
! [X2129: mworld] :
( ~ ( mrel @ mactual @ X2129 )
| ( true @ X2129 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
thf(c_0_17,plain,
! [X1291: mworld,X1292: mworld] : ( mrel @ X1291 @ X1292 ),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
thf(c_0_18,negated_conjecture,
! [X2133: mworld,X2135: mworld,X2139: mworld] :
( ( mrel @ mactual @ esk100_0 )
& ( ~ ( mrel @ esk100_0 @ X2133 )
| ( geq @ pv65 @ tptp_float_0_001 @ X2133 ) )
& ( ( mrel @ esk100_0 @ esk104_0 )
| ( mrel @ esk100_0 @ esk101_0 ) )
& ( ~ ( mrel @ esk104_0 @ X2139 )
| ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ X2139 )
| ( mrel @ esk100_0 @ esk101_0 ) )
& ( ( mrel @ esk104_0 @ esk105_0 )
| ( mrel @ esk100_0 @ esk101_0 ) )
& ( ~ ( true @ esk105_0 )
| ( mrel @ esk100_0 @ esk101_0 ) )
& ( ( mrel @ esk100_0 @ esk104_0 )
| ( mrel @ X2135 @ ( esk102_1 @ X2135 ) )
| ~ ( mrel @ esk101_0 @ X2135 ) )
& ( ~ ( mrel @ esk104_0 @ X2139 )
| ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ X2139 )
| ( mrel @ X2135 @ ( esk102_1 @ X2135 ) )
| ~ ( mrel @ esk101_0 @ X2135 ) )
& ( ( mrel @ esk104_0 @ esk105_0 )
| ( mrel @ X2135 @ ( esk102_1 @ X2135 ) )
| ~ ( mrel @ esk101_0 @ X2135 ) )
& ( ~ ( true @ esk105_0 )
| ( mrel @ X2135 @ ( esk102_1 @ X2135 ) )
| ~ ( mrel @ esk101_0 @ X2135 ) )
& ( ( mrel @ esk100_0 @ esk104_0 )
| ~ ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ ( esk102_1 @ X2135 ) )
| ~ ( mrel @ esk101_0 @ X2135 ) )
& ( ~ ( mrel @ esk104_0 @ X2139 )
| ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ X2139 )
| ~ ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ ( esk102_1 @ X2135 ) )
| ~ ( mrel @ esk101_0 @ X2135 ) )
& ( ( mrel @ esk104_0 @ esk105_0 )
| ~ ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ ( esk102_1 @ X2135 ) )
| ~ ( mrel @ esk101_0 @ X2135 ) )
& ( ~ ( true @ esk105_0 )
| ~ ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ ( esk102_1 @ X2135 ) )
| ~ ( mrel @ esk101_0 @ X2135 ) )
& ( ( mrel @ esk100_0 @ esk104_0 )
| ( mrel @ esk101_0 @ esk103_0 ) )
& ( ~ ( mrel @ esk104_0 @ X2139 )
| ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ X2139 )
| ( mrel @ esk101_0 @ esk103_0 ) )
& ( ( mrel @ esk104_0 @ esk105_0 )
| ( mrel @ esk101_0 @ esk103_0 ) )
& ( ~ ( true @ esk105_0 )
| ( mrel @ esk101_0 @ esk103_0 ) )
& ( ( mrel @ esk100_0 @ esk104_0 )
| ~ ( true @ esk103_0 ) )
& ( ~ ( mrel @ esk104_0 @ X2139 )
| ( gt @ ( plus @ n1 @ loopcounter ) @ n1 @ X2139 )
| ~ ( true @ esk103_0 ) )
& ( ( mrel @ esk104_0 @ esk105_0 )
| ~ ( true @ esk103_0 ) )
& ( ~ ( true @ esk105_0 )
| ~ ( true @ esk103_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])]) ).
thf(c_0_19,plain,
! [X3: mworld] :
( ( true @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,plain,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
( ~ ( true @ esk105_0 )
| ~ ( true @ esk103_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_22,plain,
! [X3: mworld] : ( true @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
thf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL955^24 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n019.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 10:54:47 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/0.26 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.2GibmHivvL/E---3.1_606258.p
% 1.51/0.79 % Version: 3.5.1-ho
% 1.51/0.79 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.51/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.79 % Starting new_ho_10 with 900s (3) cores
% 1.51/0.79 % Starting ehoh_best8_lambda with 900s (3) cores
% 1.51/0.79 % Starting ho_unfolding_3 with 300s (1) cores
% 1.51/0.79 % Starting new_ho_16 with 300s (1) cores
% 1.51/0.79 % new_ho_16 with pid 606274 completed with status 9
% 1.51/0.79 % new_ho_10 with pid 606271 completed with status 0
% 1.51/0.79 % Result found by new_ho_10
% 1.51/0.79 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.51/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.79 % Starting new_ho_10 with 900s (3) cores
% 1.51/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.51/0.79 % No SInE strategy applied
% 1.51/0.79 % Search class: HGHNS-SMLS33-DHSSMFNN
% 1.51/0.79 % partial match(2): HGHNM-SMLF33-DHSSMFNN
% 1.51/0.79 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 1.51/0.79 % Starting SubtermCWHack with 82s (1) cores
% 1.51/0.79 % Starting new_ho_10 with 91s (1) cores
% 1.51/0.79 % Starting new_ho_16 with 116s (1) cores
% 1.51/0.79 % SubtermCWHack with pid 606288 completed with status 0
% 1.51/0.79 % Result found by SubtermCWHack
% 1.51/0.79 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.51/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.79 % Starting new_ho_10 with 900s (3) cores
% 1.51/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.51/0.79 % No SInE strategy applied
% 1.51/0.79 % Search class: HGHNS-SMLS33-DHSSMFNN
% 1.51/0.79 % partial match(2): HGHNM-SMLF33-DHSSMFNN
% 1.51/0.79 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 1.51/0.79 % Starting SubtermCWHack with 82s (1) cores
% 1.51/0.79 % Preprocessing time : 0.150 s
% 1.51/0.79
% 1.51/0.79 % Proof found!
% 1.51/0.79 % SZS status Theorem
% 1.51/0.79 % SZS output start CNFRefutation
% See solution above
% 1.51/0.79 % Parsed axioms : 198
% 1.51/0.79 % Removed by relevancy pruning/SinE : 0
% 1.51/0.79 % Initial clauses : 5483
% 1.51/0.79 % Removed in clause preprocessing : 51
% 1.51/0.79 % Initial clauses in saturation : 5432
% 1.51/0.79 % Processed clauses : 9
% 1.51/0.79 % ...of these trivial : 4
% 1.51/0.79 % ...subsumed : 0
% 1.51/0.79 % ...remaining for further processing : 5
% 1.51/0.79 % Other redundant clauses eliminated : 0
% 1.51/0.79 % Clauses deleted for lack of memory : 0
% 1.51/0.79 % Backward-subsumed : 0
% 1.51/0.79 % Backward-rewritten : 2
% 1.51/0.79 % Generated clauses : 0
% 1.51/0.79 % ...of the previous two non-redundant : 0
% 1.51/0.79 % ...aggressively subsumed : 0
% 1.51/0.79 % Contextual simplify-reflections : 0
% 1.51/0.79 % Paramodulations : 0
% 1.51/0.79 % Factorizations : 0
% 1.51/0.79 % NegExts : 0
% 1.51/0.79 % Equation resolutions : 0
% 1.51/0.79 % Disequality decompositions : 0
% 1.51/0.79 % Total rewrite steps : 8
% 1.51/0.79 % ...of those cached : 0
% 1.51/0.79 % Propositional unsat checks : 0
% 1.51/0.79 % Propositional check models : 0
% 1.51/0.79 % Propositional check unsatisfiable : 0
% 1.51/0.79 % Propositional clauses : 0
% 1.51/0.79 % Propositional clauses after purity: 0
% 1.51/0.79 % Propositional unsat core size : 0
% 1.51/0.79 % Propositional preprocessing time : 0.000
% 1.51/0.79 % Propositional encoding time : 0.000
% 1.51/0.79 % Propositional solver time : 0.000
% 1.51/0.79 % Success case prop preproc time : 0.000
% 1.51/0.79 % Success case prop encoding time : 0.000
% 1.51/0.79 % Success case prop solver time : 0.000
% 1.51/0.79 % Current number of processed clauses : 3
% 1.51/0.79 % Positive orientable unit clauses : 3
% 1.51/0.79 % Positive unorientable unit clauses: 0
% 1.51/0.79 % Negative unit clauses : 0
% 1.51/0.79 % Non-unit-clauses : 0
% 1.51/0.79 % Current number of unprocessed clauses: 5423
% 1.51/0.79 % ...number of literals in the above : 75156
% 1.51/0.79 % Current number of archived formulas : 0
% 1.51/0.79 % Current number of archived clauses : 2
% 1.51/0.79 % Clause-clause subsumption calls (NU) : 0
% 1.51/0.79 % Rec. Clause-clause subsumption calls : 0
% 1.51/0.79 % Non-unit clause-clause subsumptions : 0
% 1.51/0.79 % Unit Clause-clause subsumption calls : 0
% 1.51/0.79 % Rewrite failures with RHS unbound : 0
% 1.51/0.79 % BW rewrite match attempts : 3
% 1.51/0.79 % BW rewrite match successes : 3
% 1.51/0.79 % Condensation attempts : 0
% 1.51/0.79 % Condensation successes : 0
% 1.51/0.79 % Termbank termtop insertions : 631668
% 1.51/0.79 % Search garbage collected termcells : 102633
% 1.51/0.79
% 1.51/0.79 % -------------------------------------------------
% 1.51/0.79 % User time : 0.472 s
% 1.51/0.79 % System time : 0.033 s
% 1.51/0.79 % Total time : 0.505 s
% 1.51/0.79 % Maximum resident set size: 21744 pages
% 1.51/0.79
% 1.51/0.79 % -------------------------------------------------
% 1.51/0.79 % User time : 0.828 s
% 1.51/0.79 % System time : 0.102 s
% 1.51/0.79 % Total time : 0.930 s
% 1.51/0.79 % Maximum resident set size: 5376 pages
% 1.51/0.79 % E exiting
%------------------------------------------------------------------------------