%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP200^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 : n018.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:04:40 AM UTC 2026
% Result : Theorem 0.36s 0.41s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 20 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 102 ( 16 ~; 3 |; 3 &; 78 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 6 ( 6 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
option_fml: $tType ).
thf(decl_sort2,type,
option_trm: $tType ).
thf(decl_sort3,type,
set_variable: $tType ).
thf(decl_sort4,type,
trm: $tType ).
thf(decl_sort5,type,
fml: $tType ).
thf(decl_sort6,type,
produc1418842292n_game: $tType ).
thf(decl_35,type,
none_fml: option_fml ).
thf(decl_37,type,
none_trm: option_trm ).
thf(decl_99,type,
geq: trm > trm > fml ).
thf(decl_125,type,
uSubst516392804stappf: produc1418842292n_game > set_variable > fml > option_fml ).
thf(decl_126,type,
uSubst516392818stappt: produc1418842292n_game > set_variable > trm > option_trm ).
thf(decl_160,type,
ua: set_variable ).
thf(decl_161,type,
eta: trm ).
thf(decl_166,type,
sigma: produc1418842292n_game ).
thf(decl_167,type,
theta: trm ).
thf(fact_2_Geq_Oprems_I1_J,axiom,
( ( uSubst516392804stappf @ sigma @ ua @ ( geq @ theta @ eta ) )
!= none_fml ),
file('/export/starexec/sandbox2/tmp/tmp.emTH2cgg6O/E---3.1_584976.p',fact_2_Geq_Oprems_I1_J) ).
thf(fact_1_usubstappf__geq__conv,axiom,
! [X1: produc1418842292n_game,X2: set_variable,X3: trm,X4: trm] :
( ( ( uSubst516392804stappf @ X1 @ X2 @ ( geq @ X3 @ X4 ) )
!= none_fml )
=> ( ( ( uSubst516392818stappt @ X1 @ X2 @ X3 )
!= none_trm )
& ( ( uSubst516392818stappt @ X1 @ X2 @ X4 )
!= none_trm ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.emTH2cgg6O/E---3.1_584976.p',fact_1_usubstappf__geq__conv) ).
thf(conj_0,conjecture,
( ( uSubst516392818stappt @ sigma @ ua @ theta )
!= none_trm ),
file('/export/starexec/sandbox2/tmp/tmp.emTH2cgg6O/E---3.1_584976.p',conj_0) ).
thf(c_0_3,plain,
( ( uSubst516392804stappf @ sigma @ ua @ ( geq @ theta @ eta ) )
!= none_fml ),
inference(fof_simplification,[status(thm)],[fact_2_Geq_Oprems_I1_J]) ).
thf(c_0_4,plain,
! [X1: produc1418842292n_game,X2: set_variable,X3: trm,X4: trm] :
( ( ( uSubst516392804stappf @ X1 @ X2 @ ( geq @ X3 @ X4 ) )
!= none_fml )
=> ( ( ( uSubst516392818stappt @ X1 @ X2 @ X3 )
!= none_trm )
& ( ( uSubst516392818stappt @ X1 @ X2 @ X4 )
!= none_trm ) ) ),
inference(fof_simplification,[status(thm)],[fact_1_usubstappf__geq__conv]) ).
thf(c_0_5,negated_conjecture,
~ ( ( ( uSubst516392818stappt @ sigma @ ua @ theta )
!= none_trm ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,plain,
( ( uSubst516392804stappf @ sigma @ ua @ ( geq @ theta @ eta ) )
!= none_fml ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_7,plain,
! [X1601: produc1418842292n_game,X1602: set_variable,X1603: trm,X1604: trm] :
( ( ( ( uSubst516392818stappt @ X1601 @ X1602 @ X1603 )
!= none_trm )
| ( ( uSubst516392804stappf @ X1601 @ X1602 @ ( geq @ X1603 @ X1604 ) )
= none_fml ) )
& ( ( ( uSubst516392818stappt @ X1601 @ X1602 @ X1604 )
!= none_trm )
| ( ( uSubst516392804stappf @ X1601 @ X1602 @ ( geq @ X1603 @ X1604 ) )
= none_fml ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_8,negated_conjecture,
( ( uSubst516392818stappt @ sigma @ ua @ theta )
= none_trm ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
( ( uSubst516392804stappf @ sigma @ ua @ ( geq @ theta @ eta ) )
!= none_fml ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: produc1418842292n_game,X2: set_variable,X4: trm,X3: trm] :
( ( ( uSubst516392804stappf @ X1 @ X2 @ ( geq @ X3 @ X4 ) )
= none_fml )
| ( ( uSubst516392818stappt @ X1 @ X2 @ X3 )
!= none_trm ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( uSubst516392818stappt @ sigma @ ua @ theta )
= none_trm ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP200^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n018.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 20:13:11 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.22/0.29 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.emTH2cgg6O/E---3.1_584976.p
% 0.36/0.41 % Version: 3.5.1-ho
% 0.36/0.41 % Preprocessing class: HSLMSMSMSSLCHFA.
% 0.36/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.41 % Starting new_ho_3 with 1500s (5) cores
% 0.36/0.41 % Starting additional_ho_6 with 300s (1) cores
% 0.36/0.41 % Starting new_bool_9 with 300s (1) cores
% 0.36/0.41 % Starting new_ho_10 with 300s (1) cores
% 0.36/0.41 % additional_ho_6 with pid 585036 completed with status 0
% 0.36/0.41 % Result found by additional_ho_6
% 0.36/0.41 % Preprocessing class: HSLMSMSMSSLCHFA.
% 0.36/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.41 % Starting new_ho_3 with 1500s (5) cores
% 0.36/0.41 % Starting additional_ho_6 with 300s (1) cores
% 0.36/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4.0,,2,20000,1.0))
% 0.36/0.41 % SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.36/0.41 % Search class: HGHSM-FSLS31-MHFFFSBN
% 0.36/0.41 % partial match(1): HGHSM-FSLM31-MHFFFSBN
% 0.36/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.36/0.41 % SubtermCWHack with pid 585055 completed with status 0
% 0.36/0.41 % Result found by SubtermCWHack
% 0.36/0.41 % Preprocessing class: HSLMSMSMSSLCHFA.
% 0.36/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.41 % Starting new_ho_3 with 1500s (5) cores
% 0.36/0.41 % Starting additional_ho_6 with 300s (1) cores
% 0.36/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4.0,,2,20000,1.0))
% 0.36/0.41 % SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.36/0.41 % Search class: HGHSM-FSLS31-MHFFFSBN
% 0.36/0.41 % partial match(1): HGHSM-FSLM31-MHFFFSBN
% 0.36/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.36/0.41 % Preprocessing time : 0.008 s
% 0.36/0.41
% 0.36/0.41 % Proof found!
% 0.36/0.41 % SZS status Theorem
% 0.36/0.41 % SZS output start CNFRefutation
% See solution above
% 0.36/0.41 % Parsed axioms : 549
% 0.36/0.41 % Removed by relevancy pruning/SinE : 362
% 0.36/0.41 % Initial clauses : 508
% 0.36/0.41 % Removed in clause preprocessing : 117
% 0.36/0.41 % Initial clauses in saturation : 391
% 0.36/0.41 % Processed clauses : 814
% 0.36/0.41 % ...of these trivial : 21
% 0.36/0.41 % ...subsumed : 401
% 0.36/0.41 % ...remaining for further processing : 392
% 0.36/0.41 % Other redundant clauses eliminated : 101
% 0.36/0.41 % Clauses deleted for lack of memory : 0
% 0.36/0.41 % Backward-subsumed : 0
% 0.36/0.41 % Backward-rewritten : 13
% 0.36/0.41 % Generated clauses : 1806
% 0.36/0.41 % ...of the previous two non-redundant : 1530
% 0.36/0.41 % ...aggressively subsumed : 0
% 0.36/0.41 % Contextual simplify-reflections : 0
% 0.36/0.41 % Paramodulations : 1684
% 0.36/0.41 % Factorizations : 2
% 0.36/0.41 % NegExts : 0
% 0.36/0.41 % Equation resolutions : 117
% 0.36/0.41 % Disequality decompositions : 0
% 0.36/0.41 % Total rewrite steps : 358
% 0.36/0.41 % ...of those cached : 288
% 0.36/0.41 % Propositional unsat checks : 0
% 0.36/0.41 % Propositional check models : 0
% 0.36/0.41 % Propositional check unsatisfiable : 0
% 0.36/0.41 % Propositional clauses : 0
% 0.36/0.41 % Propositional clauses after purity: 0
% 0.36/0.41 % Propositional unsat core size : 0
% 0.36/0.41 % Propositional preprocessing time : 0.000
% 0.36/0.41 % Propositional encoding time : 0.000
% 0.36/0.41 % Propositional solver time : 0.000
% 0.36/0.41 % Success case prop preproc time : 0.000
% 0.36/0.41 % Success case prop encoding time : 0.000
% 0.36/0.41 % Success case prop solver time : 0.000
% 0.36/0.41 % Current number of processed clauses : 318
% 0.36/0.41 % Positive orientable unit clauses : 51
% 0.36/0.41 % Positive unorientable unit clauses: 1
% 0.36/0.41 % Negative unit clauses : 26
% 0.36/0.41 % Non-unit-clauses : 240
% 0.36/0.41 % Current number of unprocessed clauses: 1069
% 0.36/0.41 % ...number of literals in the above : 3200
% 0.36/0.41 % Current number of archived formulas : 0
% 0.36/0.41 % Current number of archived clauses : 14
% 0.36/0.41 % Clause-clause subsumption calls (NU) : 20634
% 0.36/0.41 % Rec. Clause-clause subsumption calls : 15828
% 0.36/0.41 % Non-unit clause-clause subsumptions : 327
% 0.36/0.41 % Unit Clause-clause subsumption calls : 668
% 0.36/0.41 % Rewrite failures with RHS unbound : 0
% 0.36/0.41 % BW rewrite match attempts : 21
% 0.36/0.41 % BW rewrite match successes : 9
% 0.36/0.41 % Condensation attempts : 0
% 0.36/0.41 % Condensation successes : 0
% 0.36/0.41 % Termbank termtop insertions : 55086
% 0.36/0.41 % Search garbage collected termcells : 13669
% 0.36/0.41
% 0.36/0.41 % -------------------------------------------------
% 0.36/0.41 % User time : 0.070 s
% 0.36/0.41 % System time : 0.009 s
% 0.36/0.41 % Total time : 0.078 s
% 0.36/0.41 % Maximum resident set size: 6516 pages
% 0.36/0.41
% 0.36/0.41 % -------------------------------------------------
% 0.36/0.41 % User time : 0.087 s
% 0.36/0.41 % System time : 0.016 s
% 0.36/0.41 % Total time : 0.103 s
% 0.36/0.41 % Maximum resident set size: 6144 pages
% 0.36/0.41 % E exiting
%------------------------------------------------------------------------------