%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV231^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 : n006.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:35:14 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 89 ( 23 equ; 0 cnn)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 112 ( 23 ~; 31 |; 8 &; 44 @)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 4 ^; 11 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
y: a > $o ).
thf(decl_24,type,
x: a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
epred1_0: a > $o ).
thf(cX5201_pme,conjecture,
( ( ^ [X1: a] :
( ( x @ X1 )
& ( y @ X1 ) ) )
= ( ^ [X1: a] :
! [X2: a > $o] :
( ( ( X2 = x )
| ( X2 = y ) )
=> ( X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y72cK12ux1/E---3.1_861692.p',cX5201_pme) ).
thf(c_0_1,negated_conjecture,
( ( ^ [X1: a] :
( ( x @ X1 )
& ( y @ X1 ) ) )
!= ( ^ [X1: a] :
! [X2: a > $o] :
( ( ( X2 = x )
| ( X2 = y ) )
=> ( X2 @ X1 ) ) ) ),
inference(assume_negation,[status(cth)],[cX5201_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X3: a] :
( ( ( x @ X3 )
& ( y @ X3 ) )
<=> ! [X2: a > $o] :
( ( ( X2 = x )
| ( X2 = y ) )
=> ( X2 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
! [X6: a > $o] :
( ( ( epred1_0 = x )
| ( epred1_0 = y )
| ~ ( x @ esk1_0 )
| ~ ( y @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( x @ esk1_0 )
| ~ ( y @ esk1_0 ) )
& ( ( X6 != x )
| ( X6 @ esk1_0 )
| ( x @ esk1_0 ) )
& ( ( X6 != y )
| ( X6 @ esk1_0 )
| ( x @ esk1_0 ) )
& ( ( X6 != x )
| ( X6 @ esk1_0 )
| ( y @ esk1_0 ) )
& ( ( X6 != y )
| ( X6 @ esk1_0 )
| ( y @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[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,
! [X2: a > $o] :
( ( X2 @ esk1_0 )
| ( y @ esk1_0 )
| ( X2 != y ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: a > $o] :
( ( X2 @ esk1_0 )
| ( x @ esk1_0 )
| ( X2 != x ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( epred1_0 = x )
| ( epred1_0 = y )
| ~ ( x @ esk1_0 )
| ~ ( y @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
y @ esk1_0,
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
x @ esk1_0,
inference(er,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( x = epred1_0 )
| ( y = epred1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
thf(c_0_10,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( x @ esk1_0 )
| ~ ( y @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
! [X7: a] :
( ( ( x @ X7 )
<=> ( epred1_0 @ X7 ) )
| ( y = epred1_0 ) ),
inference(arg_cong,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
( ~ ( x @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]) ).
thf(c_0_13,negated_conjecture,
! [X1: a] :
( ( y = epred1_0 )
| ( epred1_0 @ X1 )
| ~ ( x @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
~ ( epred1_0 @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8])]) ).
thf(c_0_15,negated_conjecture,
y = epred1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_8]),c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X12: a] :
( ( y @ X12 )
<=> ( epred1_0 @ X12 ) ),
inference(arg_cong,[status(thm)],[c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X1: a] :
( ( epred1_0 @ X1 )
| ~ ( y @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_7]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV231^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n006.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 15:23:09 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/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.Y72cK12ux1/E---3.1_861692.p
% 0.07/0.26 % Version: 3.5.1-ho
% 0.07/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.07/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.07/0.26 % Starting sh5l with 300s (1) cores
% 0.07/0.26 % post_as_ho10 with pid 861706 completed with status 0
% 0.07/0.26 % Result found by post_as_ho10
% 0.07/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HGHSF-FFSF00-SSSFFMBN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % SubtermCWHack with pid 861709 completed with status 0
% 0.07/0.26 % Result found by SubtermCWHack
% 0.07/0.26 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HGHSF-FFSF00-SSSFFMBN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % Preprocessing time : 0.001 s
% 0.07/0.26
% 0.07/0.26 % Proof found!
% 0.07/0.26 % SZS status Theorem
% 0.07/0.26 % SZS output start CNFRefutation
% See solution above
% 0.07/0.26 % Parsed axioms : 4
% 0.07/0.26 % Removed by relevancy pruning/SinE : 0
% 0.07/0.26 % Initial clauses : 9
% 0.07/0.26 % Removed in clause preprocessing : 3
% 0.07/0.26 % Initial clauses in saturation : 6
% 0.07/0.26 % Processed clauses : 17
% 0.07/0.26 % ...of these trivial : 1
% 0.07/0.26 % ...subsumed : 0
% 0.07/0.26 % ...remaining for further processing : 16
% 0.07/0.26 % Other redundant clauses eliminated : 3
% 0.07/0.26 % Clauses deleted for lack of memory : 0
% 0.07/0.26 % Backward-subsumed : 0
% 0.07/0.26 % Backward-rewritten : 5
% 0.07/0.26 % Generated clauses : 16
% 0.07/0.26 % ...of the previous two non-redundant : 14
% 0.07/0.26 % ...aggressively subsumed : 0
% 0.07/0.26 % Contextual simplify-reflections : 0
% 0.07/0.26 % Paramodulations : 4
% 0.07/0.26 % Factorizations : 0
% 0.07/0.26 % NegExts : 0
% 0.07/0.26 % Equation resolutions : 3
% 0.07/0.26 % Disequality decompositions : 0
% 0.07/0.26 % Total rewrite steps : 9
% 0.07/0.26 % ...of those cached : 6
% 0.07/0.26 % Propositional unsat checks : 0
% 0.07/0.26 % Propositional check models : 0
% 0.07/0.26 % Propositional check unsatisfiable : 0
% 0.07/0.26 % Propositional clauses : 0
% 0.07/0.26 % Propositional clauses after purity: 0
% 0.07/0.26 % Propositional unsat core size : 0
% 0.07/0.26 % Propositional preprocessing time : 0.000
% 0.07/0.26 % Propositional encoding time : 0.000
% 0.07/0.26 % Propositional solver time : 0.000
% 0.07/0.26 % Success case prop preproc time : 0.000
% 0.07/0.26 % Success case prop encoding time : 0.000
% 0.07/0.26 % Success case prop solver time : 0.000
% 0.07/0.26 % Current number of processed clauses : 6
% 0.07/0.26 % Positive orientable unit clauses : 3
% 0.07/0.26 % Positive unorientable unit clauses: 0
% 0.07/0.26 % Negative unit clauses : 1
% 0.07/0.26 % Non-unit-clauses : 2
% 0.07/0.26 % Current number of unprocessed clauses: 3
% 0.07/0.26 % ...number of literals in the above : 8
% 0.07/0.26 % Current number of archived formulas : 0
% 0.07/0.26 % Current number of archived clauses : 7
% 0.07/0.26 % Clause-clause subsumption calls (NU) : 3
% 0.07/0.26 % Rec. Clause-clause subsumption calls : 1
% 0.07/0.26 % Non-unit clause-clause subsumptions : 0
% 0.07/0.26 % Unit Clause-clause subsumption calls : 0
% 0.07/0.26 % Rewrite failures with RHS unbound : 0
% 0.07/0.26 % BW rewrite match attempts : 3
% 0.07/0.26 % BW rewrite match successes : 3
% 0.07/0.26 % Condensation attempts : 0
% 0.07/0.26 % Condensation successes : 0
% 0.07/0.26 % Termbank termtop insertions : 788
% 0.07/0.26 % Search garbage collected termcells : 138
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.003 s
% 0.07/0.26 % System time : 0.002 s
% 0.07/0.26 % Total time : 0.004 s
% 0.07/0.26 % Maximum resident set size: 3628 pages
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.003 s
% 0.07/0.26 % System time : 0.007 s
% 0.07/0.26 % Total time : 0.010 s
% 0.07/0.26 % Maximum resident set size: 4864 pages
% 0.07/0.26 % E exiting
%------------------------------------------------------------------------------