%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO526^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:44:46 AM UTC 2026
% Result : Theorem 0.23s 0.35s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 58 ( 11 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 31 ( 13 ~; 7 |; 1 &; 7 @)
% ( 2 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 9 ^; 3 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
a: $o ).
thf(decl_24,type,
b: $o ).
thf(decl_25,type,
f: $i > $o ).
thf(decl_26,type,
g: $i > $o ).
thf(decl_27,type,
esk1_0: $i ).
thf(gb,conjecture,
( g
= ( ^ [X1: $i] : b ) ),
file('/export/starexec/sandbox2/tmp/tmp.fGFXWXgppw/E---3.1_94535.p',gb) ).
thf(fa,axiom,
( f
= ( ^ [X1: $i] : a ) ),
file('/export/starexec/sandbox2/tmp/tmp.fGFXWXgppw/E---3.1_94535.p',fa) ).
thf(fg,axiom,
f = g,
file('/export/starexec/sandbox2/tmp/tmp.fGFXWXgppw/E---3.1_94535.p',fg) ).
thf(ab,axiom,
( a
<=> b ),
file('/export/starexec/sandbox2/tmp/tmp.fGFXWXgppw/E---3.1_94535.p',ab) ).
thf(c_0_4,negated_conjecture,
( g
!= ( ^ [X1: $i] : b ) ),
inference(assume_negation,[status(cth)],[gb]) ).
thf(c_0_5,negated_conjecture,
( g
!= ( ^ [Z0: $i] : b ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])]) ).
thf(c_0_6,negated_conjecture,
( g
!= ( ^ [Z0: $i] : b ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
( f
= ( ^ [Z0: $i] : a ) ),
inference(fof_simplification,[status(thm)],[fa]) ).
thf(c_0_8,negated_conjecture,
( g
!= ( ^ [Z0: $i] : b ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
f = g,
inference(split_conjunct,[status(thm)],[fg]) ).
thf(c_0_10,plain,
( f
= ( ^ [Z0: $i] : a ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( ^ [Z0: $i] : b )
!= f ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,plain,
! [X3: $i] :
( ( f @ X3 )
<=> a ),
inference(arg_cong,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
( ( f @ esk1_0 )
<~> b ),
inference(neg_ext,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
( ( ~ a
| b )
& ( ~ b
| a ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ab])]) ).
thf(c_0_15,plain,
! [X1: $i] :
( a
| ~ ( f @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
( ( f @ esk1_0 )
| b ),
inference(dynamic_cnf,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
( a
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,plain,
( b
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,negated_conjecture,
a,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_20,negated_conjecture,
( ~ ( f @ esk1_0 )
| ~ b ),
inference(dynamic_cnf,[status(thm)],[c_0_13]) ).
thf(c_0_21,plain,
b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
thf(c_0_22,negated_conjecture,
~ ( f @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
thf(c_0_23,plain,
! [X1: $i] : ( f @ X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12]),c_0_19])]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO526^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n009.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 17:12:45 UTC 2026
% 0.10/0.25 % CPUTime :
% 0.10/0.25 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.31 Running higher-order theorem proving
% 0.23/0.32 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.fGFXWXgppw/E---3.1_94535.p
% 0.23/0.35 % Version: 3.5.1-ho
% 0.23/0.35 % partial match(1): HSSSSMSSSSSNSSN
% 0.23/0.35 % Preprocessing class: HSSSSLSSSSSNSSN.
% 0.23/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.35 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.23/0.35 % Starting post_as_ho10 with 300s (1) cores
% 0.23/0.35 % Starting new_bool_9 with 300s (1) cores
% 0.23/0.35 % Starting sh5l with 300s (1) cores
% 0.23/0.35 % ehoh_best_nonlift_nonlambdatoforall with pid 94548 completed with status 0
% 0.23/0.35 % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.23/0.35 % partial match(1): HSSSSMSSSSSNSSN
% 0.23/0.35 % Preprocessing class: HSSSSLSSSSSNSSN.
% 0.23/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.35 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.23/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.35 % No SInE strategy applied
% 0.23/0.35 % Search class: HHUSF-FFSF00-SSSFFFNN
% 0.23/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.35 % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.23/0.35 % Starting sh5l with 136s (1) cores
% 0.23/0.35 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.35 % Starting new_bool_2 with 136s (1) cores
% 0.23/0.35 % SubtermCWHack with pid 94552 completed with status 10
% 0.23/0.35 % Starting new_bool_9 with 136s (1) cores
% 0.23/0.35 % ehoh_best_nonlift_nonlambdatoforall with pid 94553 completed with status 0
% 0.23/0.35 % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.23/0.35 % partial match(1): HSSSSMSSSSSNSSN
% 0.23/0.35 % Preprocessing class: HSSSSLSSSSSNSSN.
% 0.23/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.35 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.23/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.35 % No SInE strategy applied
% 0.23/0.35 % Search class: HHUSF-FFSF00-SSSFFFNN
% 0.23/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.35 % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.23/0.35 % Preprocessing time : 0.002 s
% 0.23/0.35 % Presaturation interreduction done
% 0.23/0.35
% 0.23/0.35 % Proof found!
% 0.23/0.35 % SZS status Theorem
% 0.23/0.35 % SZS output start CNFRefutation
% See solution above
% 0.23/0.35 % Parsed axioms : 8
% 0.23/0.35 % Removed by relevancy pruning/SinE : 0
% 0.23/0.35 % Initial clauses : 9
% 0.23/0.35 % Removed in clause preprocessing : 4
% 0.23/0.35 % Initial clauses in saturation : 5
% 0.23/0.35 % Processed clauses : 22
% 0.23/0.35 % ...of these trivial : 0
% 0.23/0.35 % ...subsumed : 0
% 0.23/0.35 % ...remaining for further processing : 22
% 0.23/0.35 % Other redundant clauses eliminated : 0
% 0.23/0.35 % Clauses deleted for lack of memory : 0
% 0.23/0.35 % Backward-subsumed : 0
% 0.23/0.35 % Backward-rewritten : 8
% 0.23/0.35 % Generated clauses : 13
% 0.23/0.35 % ...of the previous two non-redundant : 13
% 0.23/0.35 % ...aggressively subsumed : 0
% 0.23/0.35 % Contextual simplify-reflections : 1
% 0.23/0.35 % Paramodulations : 4
% 0.23/0.35 % Factorizations : 0
% 0.23/0.35 % NegExts : 1
% 0.23/0.35 % Equation resolutions : 0
% 0.23/0.35 % Disequality decompositions : 0
% 0.23/0.35 % Total rewrite steps : 10
% 0.23/0.35 % ...of those cached : 5
% 0.23/0.35 % Propositional unsat checks : 0
% 0.23/0.35 % Propositional check models : 0
% 0.23/0.35 % Propositional check unsatisfiable : 0
% 0.23/0.35 % Propositional clauses : 0
% 0.23/0.35 % Propositional clauses after purity: 0
% 0.23/0.35 % Propositional unsat core size : 0
% 0.23/0.35 % Propositional preprocessing time : 0.000
% 0.23/0.35 % Propositional encoding time : 0.000
% 0.23/0.35 % Propositional solver time : 0.000
% 0.23/0.35 % Success case prop preproc time : 0.000
% 0.23/0.35 % Success case prop encoding time : 0.000
% 0.23/0.35 % Success case prop solver time : 0.000
% 0.23/0.35 % Current number of processed clauses : 6
% 0.23/0.35 % Positive orientable unit clauses : 5
% 0.23/0.35 % Positive unorientable unit clauses: 0
% 0.23/0.35 % Negative unit clauses : 1
% 0.23/0.35 % Non-unit-clauses : 0
% 0.23/0.35 % Current number of unprocessed clauses: 0
% 0.23/0.35 % ...number of literals in the above : 0
% 0.23/0.35 % Current number of archived formulas : 0
% 0.23/0.35 % Current number of archived clauses : 16
% 0.23/0.35 % Clause-clause subsumption calls (NU) : 3
% 0.23/0.35 % Rec. Clause-clause subsumption calls : 1
% 0.23/0.35 % Non-unit clause-clause subsumptions : 1
% 0.23/0.35 % Unit Clause-clause subsumption calls : 1
% 0.23/0.35 % Rewrite failures with RHS unbound : 0
% 0.23/0.35 % BW rewrite match attempts : 7
% 0.23/0.35 % BW rewrite match successes : 4
% 0.23/0.35 % Condensation attempts : 0
% 0.23/0.35 % Condensation successes : 0
% 0.23/0.35 % Termbank termtop insertions : 537
% 0.23/0.35 % Search garbage collected termcells : 12
% 0.23/0.35
% 0.23/0.35 % -------------------------------------------------
% 0.23/0.35 % User time : 0.007 s
% 0.23/0.35 % System time : 0.005 s
% 0.23/0.35 % Total time : 0.011 s
% 0.23/0.35 % Maximum resident set size: 3628 pages
% 0.23/0.35
% 0.23/0.35 % -------------------------------------------------
% 0.23/0.35 % User time : 0.016 s
% 0.23/0.35 % System time : 0.013 s
% 0.23/0.35 % Total time : 0.029 s
% 0.23/0.35 % Maximum resident set size: 4864 pages
% 0.23/0.35 % E exiting
%------------------------------------------------------------------------------