%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP083^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 : n020.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:18 AM UTC 2026
% Result : Theorem 0.60s 0.40s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 103 ( 6 ~; 2 |; 0 &; 94 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 9 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 4 con; 0-6 aty)
% Number of variables : 9 ( 0 ^; 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
set_val: $tType ).
thf(decl_sort2,type,
g: $tType ).
thf(decl_sort3,type,
node: $tType ).
thf(decl_sort4,type,
list_P561207620_edgeD: $tType ).
thf(decl_sort5,type,
list_node: $tType ).
thf(decl_sort6,type,
produc1432036078de_val: $tType ).
thf(decl_sort7,type,
option_list_val: $tType ).
thf(decl_sort8,type,
val: $tType ).
thf(decl_105,type,
sSA_CF1517915011eD_val: ( g > list_node ) > ( g > node > list_P561207620_edgeD ) > ( g > node > set_val ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > set_val ).
thf(decl_111,type,
sSA_CF1252180629de_val: ( g > list_node ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > val > val > $o ).
thf(decl_146,type,
member_val: val > set_val > $o ).
thf(decl_147,type,
alpha_n: g > list_node ).
thf(decl_149,type,
phi_s: val ).
thf(decl_150,type,
phi2: val ).
thf(decl_151,type,
defs: g > node > set_val ).
thf(decl_152,type,
g2: g ).
thf(decl_153,type,
inEdges: g > node > list_P561207620_edgeD ).
thf(decl_154,type,
phis: g > produc1432036078de_val > option_list_val ).
thf(decl_156,type,
uses: g > node > set_val ).
thf(conj_0,conjecture,
member_val @ phi_s @ ( sSA_CF1517915011eD_val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2 ),
file('/export/starexec/sandbox/tmp/tmp.qMyiCa4YlF/E---3.1_1506522.p',conj_0) ).
thf(fact_6_phiArg__in__allVars,axiom,
! [X2: g,X3: val,X4: val] :
( ( sSA_CF1252180629de_val @ alpha_n @ defs @ phis @ X2 @ X3 @ X4 )
=> ( member_val @ X4 @ ( sSA_CF1517915011eD_val @ alpha_n @ inEdges @ defs @ uses @ phis @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qMyiCa4YlF/E---3.1_1506522.p',fact_6_phiArg__in__allVars) ).
thf(fact_2__092_060open_062phiArg_Ag_A_092_060phi_062_H_A_092_060phi_062_092_060_094sub_062s_092_060close_062,axiom,
sSA_CF1252180629de_val @ alpha_n @ defs @ phis @ g2 @ phi2 @ phi_s,
file('/export/starexec/sandbox/tmp/tmp.qMyiCa4YlF/E---3.1_1506522.p',fact_2__092_060open_062phiArg_Ag_A_092_060phi_062_H_A_092_060phi_062_092_060_094sub_062s_092_060close_062) ).
thf(c_0_3,negated_conjecture,
~ ( member_val @ phi_s @ ( sSA_CF1517915011eD_val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2 ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_4,negated_conjecture,
~ ( member_val @ phi_s @ ( sSA_CF1517915011eD_val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2 ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
thf(c_0_5,plain,
! [X1432: g,X1433: val,X1434: val] :
( ~ ( sSA_CF1252180629de_val @ alpha_n @ defs @ phis @ X1432 @ X1433 @ X1434 )
| ( member_val @ X1434 @ ( sSA_CF1517915011eD_val @ alpha_n @ inEdges @ defs @ uses @ phis @ X1432 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_6_phiArg__in__allVars])])]) ).
thf(c_0_6,negated_conjecture,
~ ( member_val @ phi_s @ ( sSA_CF1517915011eD_val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2 ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X1: val,X2: g,X3: val] :
( ( member_val @ X3 @ ( sSA_CF1517915011eD_val @ alpha_n @ inEdges @ defs @ uses @ phis @ X2 ) )
| ~ ( sSA_CF1252180629de_val @ alpha_n @ defs @ phis @ X2 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
sSA_CF1252180629de_val @ alpha_n @ defs @ phis @ g2 @ phi2 @ phi_s,
inference(split_conjunct,[status(thm)],[fact_2__092_060open_062phiArg_Ag_A_092_060phi_062_H_A_092_060phi_062_092_060_094sub_062s_092_060close_062]) ).
thf(c_0_9,negated_conjecture,
~ ( member_val @ phi_s @ ( sSA_CF1517915011eD_val @ alpha_n @ inEdges @ defs @ uses @ phis @ g2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP083^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.18 % Computer : n020.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:50:04 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.23 Running higher-order theorem proving
% 0.08/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.qMyiCa4YlF/E---3.1_1506522.p
% 0.60/0.40 % Version: 3.5.1-ho
% 0.60/0.40 % Preprocessing class: HSLMSMSMSSMNHSA.
% 0.60/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.40 % Starting new_ho_10 with 1500s (5) cores
% 0.60/0.40 % Starting full_lambda_7 with 300s (1) cores
% 0.60/0.40 % Starting new_ho_4 with 300s (1) cores
% 0.60/0.40 % Starting lpo5_fix with 300s (1) cores
% 0.60/0.40 % new_ho_10 with pid 1506535 completed with status 0
% 0.60/0.40 % Result found by new_ho_10
% 0.60/0.40 % Preprocessing class: HSLMSMSMSSMNHSA.
% 0.60/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.40 % Starting new_ho_10 with 1500s (5) cores
% 0.60/0.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.60/0.40 % No SInE strategy applied
% 0.60/0.40 % Search class: HGHSM-FSLM32-MHSFFSBN
% 0.60/0.40 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.40 % Starting SubtermCWHack with 151s (1) cores
% 0.60/0.40 % Starting new_ho_10 with 901s (1) cores
% 0.60/0.40 % Starting full_lambda_9 with 151s (1) cores
% 0.60/0.40 % Starting ehoh_best with 151s (1) cores
% 0.60/0.40 % Starting post_as_ho6 with 146s (1) cores
% 0.60/0.40 % new_ho_10 with pid 1506542 completed with status 0
% 0.60/0.40 % Result found by new_ho_10
% 0.60/0.40 % Preprocessing class: HSLMSMSMSSMNHSA.
% 0.60/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.40 % Starting new_ho_10 with 1500s (5) cores
% 0.60/0.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.60/0.40 % No SInE strategy applied
% 0.60/0.40 % Search class: HGHSM-FSLM32-MHSFFSBN
% 0.60/0.40 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.40 % Starting SubtermCWHack with 151s (1) cores
% 0.60/0.40 % Starting new_ho_10 with 901s (1) cores
% 0.60/0.40 % Preprocessing time : 0.006 s
% 0.60/0.40 % Presaturation interreduction done
% 0.60/0.40
% 0.60/0.40 % Proof found!
% 0.60/0.40 % SZS status Theorem
% 0.60/0.40 % SZS output start CNFRefutation
% See solution above
% 0.60/0.40 % Parsed axioms : 541
% 0.60/0.40 % Removed by relevancy pruning/SinE : 0
% 0.60/0.40 % Initial clauses : 822
% 0.60/0.40 % Removed in clause preprocessing : 216
% 0.60/0.40 % Initial clauses in saturation : 606
% 0.60/0.40 % Processed clauses : 858
% 0.60/0.40 % ...of these trivial : 22
% 0.60/0.40 % ...subsumed : 170
% 0.60/0.40 % ...remaining for further processing : 666
% 0.60/0.40 % Other redundant clauses eliminated : 52
% 0.60/0.40 % Clauses deleted for lack of memory : 0
% 0.60/0.40 % Backward-subsumed : 4
% 0.60/0.40 % Backward-rewritten : 3
% 0.60/0.40 % Generated clauses : 478
% 0.60/0.40 % ...of the previous two non-redundant : 308
% 0.60/0.40 % ...aggressively subsumed : 0
% 0.60/0.40 % Contextual simplify-reflections : 7
% 0.60/0.40 % Paramodulations : 430
% 0.60/0.40 % Factorizations : 0
% 0.60/0.40 % NegExts : 0
% 0.60/0.40 % Equation resolutions : 53
% 0.60/0.40 % Disequality decompositions : 0
% 0.60/0.40 % Total rewrite steps : 165
% 0.60/0.40 % ...of those cached : 118
% 0.60/0.40 % Propositional unsat checks : 0
% 0.60/0.40 % Propositional check models : 0
% 0.60/0.40 % Propositional check unsatisfiable : 0
% 0.60/0.40 % Propositional clauses : 0
% 0.60/0.40 % Propositional clauses after purity: 0
% 0.60/0.40 % Propositional unsat core size : 0
% 0.60/0.40 % Propositional preprocessing time : 0.000
% 0.60/0.40 % Propositional encoding time : 0.000
% 0.60/0.40 % Propositional solver time : 0.000
% 0.60/0.40 % Success case prop preproc time : 0.000
% 0.60/0.40 % Success case prop encoding time : 0.000
% 0.60/0.40 % Success case prop solver time : 0.000
% 0.60/0.40 % Current number of processed clauses : 191
% 0.60/0.40 % Positive orientable unit clauses : 53
% 0.60/0.40 % Positive unorientable unit clauses: 2
% 0.60/0.40 % Negative unit clauses : 6
% 0.60/0.40 % Non-unit-clauses : 130
% 0.60/0.40 % Current number of unprocessed clauses: 494
% 0.60/0.40 % ...number of literals in the above : 1183
% 0.60/0.40 % Current number of archived formulas : 0
% 0.60/0.40 % Current number of archived clauses : 445
% 0.60/0.40 % Clause-clause subsumption calls (NU) : 53384
% 0.60/0.40 % Rec. Clause-clause subsumption calls : 38151
% 0.60/0.40 % Non-unit clause-clause subsumptions : 171
% 0.60/0.40 % Unit Clause-clause subsumption calls : 325
% 0.60/0.40 % Rewrite failures with RHS unbound : 0
% 0.60/0.40 % BW rewrite match attempts : 867
% 0.60/0.40 % BW rewrite match successes : 49
% 0.60/0.40 % Condensation attempts : 858
% 0.60/0.40 % Condensation successes : 0
% 0.60/0.40 % Termbank termtop insertions : 62610
% 0.60/0.40 % Search garbage collected termcells : 13533
% 0.60/0.40
% 0.60/0.40 % -------------------------------------------------
% 0.60/0.40 % User time : 0.091 s
% 0.60/0.40 % System time : 0.012 s
% 0.60/0.40 % Total time : 0.103 s
% 0.60/0.40 % Maximum resident set size: 7172 pages
% 0.60/0.40
% 0.60/0.40 % -------------------------------------------------
% 0.60/0.40 % User time : 0.241 s
% 0.60/0.40 % System time : 0.046 s
% 0.60/0.40 % Total time : 0.287 s
% 0.60/0.40 % Maximum resident set size: 5888 pages
% 0.60/0.40 % E exiting
%------------------------------------------------------------------------------