%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET616^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:22:13 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 10 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 79 ( 21 ~; 4 |; 13 &; 36 @)
% ( 1 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 10 ^; 9 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > $o ).
thf(decl_24,type,
epred2_0: a > $o ).
thf(decl_25,type,
esk3_0: a ).
thf(cBOOL_PROP_90_pme,conjecture,
! [X1: a > $o,X2: a > $o] :
( ( ( ^ [X3: a] :
( ( X1 @ X3 )
& ~ ( X2 @ X3 ) ) )
= ( ^ [X3: a] :
( ( X2 @ X3 )
& ~ ( X1 @ X3 ) ) ) )
=> ( X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.vftt9WGQbb/E---3.1_1676223.p',cBOOL_PROP_90_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ( ( ^ [X3: a] :
( ( X1 @ X3 )
& ~ ( X2 @ X3 ) ) )
= ( ^ [X3: a] :
( ( X2 @ X3 )
& ~ ( X1 @ X3 ) ) ) )
=> ( X1 = X2 ) ),
inference(assume_negation,[status(cth)],[cBOOL_PROP_90_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ( ( ^ [Z0: a] :
( ( X1 @ Z0 )
& ~ ( X2 @ Z0 ) ) )
= ( ^ [Z0: a] :
( ( X2 @ Z0 )
& ~ ( X1 @ Z0 ) ) ) )
=> ( X1 = X2 ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
( ( ( ^ [Z0: a] :
( ( epred1_0 @ Z0 )
& ~ ( epred2_0 @ Z0 ) ) )
= ( ^ [Z0: a] :
( ( epred2_0 @ Z0 )
& ~ ( epred1_0 @ Z0 ) ) ) )
& ( epred1_0 != epred2_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
thf(c_0_4,negated_conjecture,
( ( ^ [Z0: a] :
( ( epred1_0 @ Z0 )
& ~ ( epred2_0 @ Z0 ) ) )
= ( ^ [Z0: a] :
( ( epred2_0 @ Z0 )
& ~ ( epred1_0 @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
epred1_0 != epred2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X8: a] :
( ( ( epred2_0 @ X8 )
& ~ ( epred1_0 @ X8 ) )
<=> ( ( epred1_0 @ X8 )
& ~ ( epred2_0 @ X8 ) ) ),
inference(arg_cong,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( epred2_0 @ esk3_0 )
<~> ( epred1_0 @ esk3_0 ) ),
inference(neg_ext,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: a] :
( ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk3_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
( ~ ( epred2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk3_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
epred1_0 @ esk3_0,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
~ ( epred2_0 @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
thf(c_0_13,negated_conjecture,
! [X3: a] :
( ( epred2_0 @ X3 )
| ~ ( epred1_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET616^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n005.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 13:39:16 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.24 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.vftt9WGQbb/E---3.1_1676223.p
% 0.10/0.25 % Version: 3.5.1-ho
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.25 % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.10/0.25 % Starting sh5l with 300s (1) cores
% 0.10/0.25 % ehoh_best_nonlift_nonlambdatoforall with pid 1676253 completed with status 0
% 0.10/0.25 % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HUUPF-FFSF00-MSSFFFNN
% 0.10/0.25 % partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.10/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.25 % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.10/0.25 % Starting sh5l with 136s (1) cores
% 0.10/0.25 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.26 % Starting new_bool_2 with 136s (1) cores
% 0.10/0.26 % SubtermCWHack with pid 1676258 completed with status 10
% 0.10/0.26 % Starting new_bool_9 with 136s (1) cores
% 0.10/0.26 % ehoh_best_nonlift_nonlambdatoforall with pid 1676259 completed with status 0
% 0.10/0.26 % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.26 % No SInE strategy applied
% 0.10/0.26 % Search class: HUUPF-FFSF00-MSSFFFNN
% 0.10/0.26 % partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.10/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.10/0.26 % Preprocessing time : 0.001 s
% 0.10/0.26 % Presaturation interreduction done
% 0.10/0.26
% 0.10/0.26 % Proof found!
% 0.10/0.26 % SZS status Theorem
% 0.10/0.26 % SZS output start CNFRefutation
% See solution above
% 0.10/0.26 % Parsed axioms : 2
% 0.10/0.26 % Removed by relevancy pruning/SinE : 0
% 0.10/0.26 % Initial clauses : 3
% 0.10/0.26 % Removed in clause preprocessing : 1
% 0.10/0.26 % Initial clauses in saturation : 2
% 0.10/0.26 % Processed clauses : 12
% 0.10/0.26 % ...of these trivial : 0
% 0.10/0.26 % ...subsumed : 0
% 0.10/0.26 % ...remaining for further processing : 12
% 0.10/0.26 % Other redundant clauses eliminated : 0
% 0.10/0.26 % Clauses deleted for lack of memory : 0
% 0.10/0.26 % Backward-subsumed : 0
% 0.10/0.26 % Backward-rewritten : 2
% 0.10/0.26 % Generated clauses : 12
% 0.10/0.26 % ...of the previous two non-redundant : 10
% 0.10/0.26 % ...aggressively subsumed : 0
% 0.10/0.26 % Contextual simplify-reflections : 0
% 0.10/0.26 % Paramodulations : 4
% 0.10/0.26 % Factorizations : 0
% 0.10/0.26 % NegExts : 1
% 0.10/0.26 % Equation resolutions : 0
% 0.10/0.26 % Disequality decompositions : 0
% 0.10/0.26 % Total rewrite steps : 3
% 0.10/0.26 % ...of those cached : 2
% 0.10/0.26 % Propositional unsat checks : 0
% 0.10/0.26 % Propositional check models : 0
% 0.10/0.26 % Propositional check unsatisfiable : 0
% 0.10/0.26 % Propositional clauses : 0
% 0.10/0.26 % Propositional clauses after purity: 0
% 0.10/0.26 % Propositional unsat core size : 0
% 0.10/0.26 % Propositional preprocessing time : 0.000
% 0.10/0.26 % Propositional encoding time : 0.000
% 0.10/0.26 % Propositional solver time : 0.000
% 0.10/0.26 % Success case prop preproc time : 0.000
% 0.10/0.26 % Success case prop encoding time : 0.000
% 0.10/0.26 % Success case prop solver time : 0.000
% 0.10/0.26 % Current number of processed clauses : 6
% 0.10/0.26 % Positive orientable unit clauses : 2
% 0.10/0.26 % Positive unorientable unit clauses: 0
% 0.10/0.26 % Negative unit clauses : 2
% 0.10/0.26 % Non-unit-clauses : 2
% 0.10/0.26 % Current number of unprocessed clauses: 2
% 0.10/0.26 % ...number of literals in the above : 4
% 0.10/0.26 % Current number of archived formulas : 0
% 0.10/0.26 % Current number of archived clauses : 6
% 0.10/0.26 % Clause-clause subsumption calls (NU) : 1
% 0.10/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.26 % Non-unit clause-clause subsumptions : 0
% 0.10/0.26 % Unit Clause-clause subsumption calls : 2
% 0.10/0.26 % Rewrite failures with RHS unbound : 0
% 0.10/0.26 % BW rewrite match attempts : 1
% 0.10/0.26 % BW rewrite match successes : 1
% 0.10/0.26 % Condensation attempts : 0
% 0.10/0.26 % Condensation successes : 0
% 0.10/0.26 % Termbank termtop insertions : 578
% 0.10/0.26 % Search garbage collected termcells : 59
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.002 s
% 0.10/0.26 % System time : 0.006 s
% 0.10/0.26 % Total time : 0.007 s
% 0.10/0.26 % Maximum resident set size: 3372 pages
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.005 s
% 0.10/0.26 % System time : 0.015 s
% 0.10/0.26 % Total time : 0.020 s
% 0.10/0.26 % Maximum resident set size: 4864 pages
% 0.10/0.26 % E exiting
%------------------------------------------------------------------------------