%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP037^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 : n013.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:20 AM UTC 2026
% Result : Theorem 0.20s 0.32s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 9 ( 0 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 20 ( 4 ~; 0 |; 0 &; 16 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 3 ( 0 ^; 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
trm_a_c: $tType ).
thf(decl_sort2,type,
c: $tType ).
thf(decl_113,type,
dfree_a_c: trm_a_c > $o ).
thf(decl_158,type,
args: c > trm_a_c ).
thf(decl_159,type,
i2: c ).
thf(conj_0,conjecture,
dfree_a_c @ ( args @ i2 ),
file('/export/starexec/sandbox/tmp/tmp.49hinVwWf6/E---3.1_2558233.p',conj_0) ).
thf(fact_0_free,axiom,
! [X1: c] : ( dfree_a_c @ ( args @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.49hinVwWf6/E---3.1_2558233.p',fact_0_free) ).
thf(c_0_2,negated_conjecture,
~ ( dfree_a_c @ ( args @ i2 ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_3,negated_conjecture,
~ ( dfree_a_c @ ( args @ i2 ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
~ ( dfree_a_c @ ( args @ i2 ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_5,plain,
! [X765: c] : ( dfree_a_c @ ( args @ X765 ) ),
inference(variable_rename,[status(thm)],[fact_0_free]) ).
thf(c_0_6,negated_conjecture,
~ ( dfree_a_c @ ( args @ i2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X1: c] : ( dfree_a_c @ ( args @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP037^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.07/0.18 % Computer : n013.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 19:39:21 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.20/0.29 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.49hinVwWf6/E---3.1_2558233.p
% 0.20/0.32 % Version: 3.5.1-ho
% 0.20/0.32 % Preprocessing class: HSLMSMSMSSMNHFA.
% 0.20/0.32 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.32 % Starting full_lambda_6 with 1200s (4) cores
% 0.20/0.32 % Starting additional_ho_6 with 300s (1) cores
% 0.20/0.32 % Starting new_ho_9 with 300s (1) cores
% 0.20/0.32 % Starting full_lambda_3 with 300s (1) cores
% 0.20/0.32 % Starting post_as_ho6 with 300s (1) cores
% 0.20/0.32 % post_as_ho6 with pid 2558250 completed with status 0
% 0.20/0.32 % Result found by post_as_ho6
% 0.20/0.32 % Preprocessing class: HSLMSMSMSSMNHFA.
% 0.20/0.32 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.32 % Starting full_lambda_6 with 1200s (4) cores
% 0.20/0.32 % Starting additional_ho_6 with 300s (1) cores
% 0.20/0.32 % Starting new_ho_9 with 300s (1) cores
% 0.20/0.32 % Starting full_lambda_3 with 300s (1) cores
% 0.20/0.32 % Starting post_as_ho6 with 300s (1) cores
% 0.20/0.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true))
% 0.20/0.32 % SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.20/0.32 % Search class: HUUNF-FFSF11-SHFFFFNN
% 0.20/0.32 % partial match(2): FUUNF-FFSF11-SFFFFFNN
% 0.20/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.32 % SubtermCWHack with pid 2558251 completed with status 0
% 0.20/0.32 % Result found by SubtermCWHack
% 0.20/0.32 % Preprocessing class: HSLMSMSMSSMNHFA.
% 0.20/0.32 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.32 % Starting full_lambda_6 with 1200s (4) cores
% 0.20/0.32 % Starting additional_ho_6 with 300s (1) cores
% 0.20/0.32 % Starting new_ho_9 with 300s (1) cores
% 0.20/0.32 % Starting full_lambda_3 with 300s (1) cores
% 0.20/0.32 % Starting post_as_ho6 with 300s (1) cores
% 0.20/0.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true))
% 0.20/0.32 % SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.20/0.32 % Search class: HUUNF-FFSF11-SHFFFFNN
% 0.20/0.32 % partial match(2): FUUNF-FFSF11-SFFFFFNN
% 0.20/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.32 % Preprocessing time : 0.003 s
% 0.20/0.32
% 0.20/0.32 % Proof found!
% 0.20/0.32 % SZS status Theorem
% 0.20/0.32 % SZS output start CNFRefutation
% See solution above
% 0.20/0.32 % Parsed axioms : 550
% 0.20/0.32 % Removed by relevancy pruning/SinE : 548
% 0.20/0.32 % Initial clauses : 2
% 0.20/0.32 % Removed in clause preprocessing : 0
% 0.20/0.32 % Initial clauses in saturation : 2
% 0.20/0.32 % Processed clauses : 2
% 0.20/0.32 % ...of these trivial : 0
% 0.20/0.32 % ...subsumed : 0
% 0.20/0.32 % ...remaining for further processing : 1
% 0.20/0.32 % Other redundant clauses eliminated : 0
% 0.20/0.32 % Clauses deleted for lack of memory : 0
% 0.20/0.32 % Backward-subsumed : 0
% 0.20/0.32 % Backward-rewritten : 0
% 0.20/0.32 % Generated clauses : 0
% 0.20/0.32 % ...of the previous two non-redundant : 0
% 0.20/0.32 % ...aggressively subsumed : 0
% 0.20/0.32 % Contextual simplify-reflections : 0
% 0.20/0.32 % Paramodulations : 0
% 0.20/0.32 % Factorizations : 0
% 0.20/0.32 % NegExts : 0
% 0.20/0.32 % Equation resolutions : 0
% 0.20/0.32 % Disequality decompositions : 0
% 0.20/0.32 % Total rewrite steps : 1
% 0.20/0.32 % ...of those cached : 0
% 0.20/0.32 % Propositional unsat checks : 0
% 0.20/0.32 % Propositional check models : 0
% 0.20/0.32 % Propositional check unsatisfiable : 0
% 0.20/0.32 % Propositional clauses : 0
% 0.20/0.32 % Propositional clauses after purity: 0
% 0.20/0.32 % Propositional unsat core size : 0
% 0.20/0.32 % Propositional preprocessing time : 0.000
% 0.20/0.32 % Propositional encoding time : 0.000
% 0.20/0.32 % Propositional solver time : 0.000
% 0.20/0.32 % Success case prop preproc time : 0.000
% 0.20/0.32 % Success case prop encoding time : 0.000
% 0.20/0.32 % Success case prop solver time : 0.000
% 0.20/0.32 % Current number of processed clauses : 1
% 0.20/0.32 % Positive orientable unit clauses : 1
% 0.20/0.32 % Positive unorientable unit clauses: 0
% 0.20/0.32 % Negative unit clauses : 0
% 0.20/0.32 % Non-unit-clauses : 0
% 0.20/0.32 % Current number of unprocessed clauses: 0
% 0.20/0.32 % ...number of literals in the above : 0
% 0.20/0.32 % Current number of archived formulas : 0
% 0.20/0.32 % Current number of archived clauses : 0
% 0.20/0.32 % Clause-clause subsumption calls (NU) : 0
% 0.20/0.32 % Rec. Clause-clause subsumption calls : 0
% 0.20/0.32 % Non-unit clause-clause subsumptions : 0
% 0.20/0.32 % Unit Clause-clause subsumption calls : 0
% 0.20/0.32 % Rewrite failures with RHS unbound : 0
% 0.20/0.32 % BW rewrite match attempts : 0
% 0.20/0.32 % BW rewrite match successes : 0
% 0.20/0.32 % Condensation attempts : 0
% 0.20/0.32 % Condensation successes : 0
% 0.20/0.32 % Termbank termtop insertions : 5021
% 0.20/0.32 % Search garbage collected termcells : 3463
% 0.20/0.32
% 0.20/0.32 % -------------------------------------------------
% 0.20/0.32 % User time : 0.004 s
% 0.20/0.32 % System time : 0.004 s
% 0.20/0.32 % Total time : 0.007 s
% 0.20/0.32 % Maximum resident set size: 5228 pages
% 0.20/0.32
% 0.20/0.32 % -------------------------------------------------
% 0.20/0.32 % User time : 0.021 s
% 0.20/0.32 % System time : 0.007 s
% 0.20/0.32 % Total time : 0.028 s
% 0.20/0.32 % Maximum resident set size: 5888 pages
% 0.20/0.32 % E exiting
%------------------------------------------------------------------------------