%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO271^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 : n001.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:42:41 AM UTC 2026
% Result : Theorem 0.28s 0.26s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 25 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 99 ( 19 ~; 2 |; 2 &; 67 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 12 ^; 14 !; 3 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_23,type,
cJ: ( b > $o ) > b ).
thf(decl_24,type,
esk1_0: b > a ).
thf(decl_25,type,
esk2_0: b > a ).
thf(decl_26,type,
esk3_0: b ).
thf(cX5500,conjecture,
( ! [X1: b > $o] :
( ? [X2: b] : ( X1 @ X2 )
=> ( X1 @ ( cJ @ X1 ) ) )
=> ! [X3: b > a,X4: b > a] :
( ( ( X3
@ ( cJ
@ ^ [X2: b] :
( ( X3 @ X2 )
!= ( X4 @ X2 ) ) ) )
= ( X4
@ ( cJ
@ ^ [X2: b] :
( ( X3 @ X2 )
!= ( X4 @ X2 ) ) ) ) )
=> ( X3 = X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CFYadLtLX8/E---3.1_1487661.p',cX5500) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: b > $o] :
( ? [X2: b] : ( X1 @ X2 )
=> ( X1 @ ( cJ @ X1 ) ) )
=> ! [X3: b > a,X4: b > a] :
( ( ( X3
@ ( cJ
@ ^ [X2: b] :
( ( X3 @ X2 )
!= ( X4 @ X2 ) ) ) )
= ( X4
@ ( cJ
@ ^ [X2: b] :
( ( X3 @ X2 )
!= ( X4 @ X2 ) ) ) ) )
=> ( X3 = X4 ) ) ),
inference(assume_negation,[status(cth)],[cX5500]) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X1: b > $o] :
( ? [X2: b] : ( X1 @ X2 )
=> ( X1 @ ( cJ @ X1 ) ) )
=> ! [X3: b > a,X4: b > a] :
( ( ( X3
@ ( cJ
@ ^ [Z0: b] :
( ( X3 @ Z0 )
!= ( X4 @ Z0 ) ) ) )
= ( X4
@ ( cJ
@ ^ [Z0: b] :
( ( X3 @ Z0 )
!= ( X4 @ Z0 ) ) ) ) )
=> ( X3 = X4 ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X9: b > $o,X10: b] :
( ( ~ ( X9 @ X10 )
| ( X9 @ ( cJ @ X9 ) ) )
& ( ( esk1_0
@ ( cJ
@ ^ [Z0: b] :
( ( esk1_0 @ Z0 )
!= ( esk2_0 @ Z0 ) ) ) )
= ( esk2_0
@ ( cJ
@ ^ [Z0: b] :
( ( esk1_0 @ Z0 )
!= ( esk2_0 @ Z0 ) ) ) ) )
& ( esk1_0 != esk2_0 ) ),
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,
( ( esk1_0
@ ( cJ
@ ^ [Z0: b] :
( ( esk1_0 @ Z0 )
!= ( esk2_0 @ Z0 ) ) ) )
= ( esk2_0
@ ( cJ
@ ^ [Z0: b] :
( ( esk1_0 @ Z0 )
!= ( esk2_0 @ Z0 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( esk1_0
@ ( cJ
@ ^ [Z0: b] :
( ( esk1_0 @ Z0 )
!= ( esk2_0 @ Z0 ) ) ) )
= ( esk2_0
@ ( cJ
@ ^ [Z0: b] :
( ( esk1_0 @ Z0 )
!= ( esk2_0 @ Z0 ) ) ) ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: b > $o,X2: b] :
( ( X1 @ ( cJ @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
( ( esk1_0 @ esk3_0 )
!= ( esk2_0 @ esk3_0 ) ),
inference(neg_ext,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X2: b] :
( ( esk1_0 @ X2 )
= ( esk2_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(choice_inst,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6,c_0_7]),c_0_6])]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO271^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.09/0.18 % Computer : n001.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 16:48:06 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/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.CFYadLtLX8/E---3.1_1487661.p
% 0.28/0.26 % Version: 3.5.1-ho
% 0.28/0.26 % Preprocessing class: HSSSSMSSSSMCSSA.
% 0.28/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.28/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.28/0.26 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.26 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.26 % new_bool_3 with pid 1487695 completed with status 0
% 0.28/0.26 % Result found by new_bool_3
% 0.28/0.26 % Preprocessing class: HSSSSMSSSSMCSSA.
% 0.28/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.28/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.28/0.26 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.26 % Search class: HHUSF-FFSF11-DSSFFSBC
% 0.28/0.26 % partial match(3): HHUSF-FFSF11-SSSFFMBN
% 0.28/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.26 % SubtermCWHack with pid 1487698 completed with status 10
% 0.28/0.26 % Starting new_bool_3 with 31s (1) cores
% 0.28/0.26 % new_bool_3 with pid 1487705 completed with status 0
% 0.28/0.26 % Result found by new_bool_3
% 0.28/0.26 % Preprocessing class: HSSSSMSSSSMCSSA.
% 0.28/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.28/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.28/0.26 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.26 % Search class: HHUSF-FFSF11-DSSFFSBC
% 0.28/0.26 % partial match(3): HHUSF-FFSF11-SSSFFMBN
% 0.28/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.26 % SubtermCWHack with pid 1487698 completed with status 10
% 0.28/0.26 % Starting new_bool_3 with 31s (1) cores
% 0.28/0.26 % Preprocessing time : 0.001 s
% 0.28/0.26 % Presaturation interreduction done
% 0.28/0.26
% 0.28/0.26 % Proof found!
% 0.28/0.26 % SZS status Theorem
% 0.28/0.26 % SZS output start CNFRefutation
% See solution above
% 0.28/0.26 % Parsed axioms : 4
% 0.28/0.26 % Removed by relevancy pruning/SinE : 3
% 0.28/0.26 % Initial clauses : 3
% 0.28/0.26 % Removed in clause preprocessing : 0
% 0.28/0.26 % Initial clauses in saturation : 3
% 0.28/0.26 % Processed clauses : 7
% 0.28/0.26 % ...of these trivial : 0
% 0.28/0.26 % ...subsumed : 0
% 0.28/0.26 % ...remaining for further processing : 7
% 0.28/0.26 % Other redundant clauses eliminated : 0
% 0.28/0.26 % Clauses deleted for lack of memory : 0
% 0.28/0.26 % Backward-subsumed : 0
% 0.28/0.26 % Backward-rewritten : 2
% 0.28/0.26 % Generated clauses : 6
% 0.28/0.26 % ...of the previous two non-redundant : 5
% 0.28/0.26 % ...aggressively subsumed : 0
% 0.28/0.26 % Contextual simplify-reflections : 0
% 0.28/0.26 % Paramodulations : 0
% 0.28/0.26 % Factorizations : 0
% 0.28/0.26 % NegExts : 1
% 0.28/0.26 % Equation resolutions : 0
% 0.28/0.26 % Disequality decompositions : 0
% 0.28/0.26 % Total rewrite steps : 4
% 0.28/0.26 % ...of those cached : 1
% 0.28/0.26 % Propositional unsat checks : 0
% 0.28/0.26 % Propositional check models : 0
% 0.28/0.26 % Propositional check unsatisfiable : 0
% 0.28/0.26 % Propositional clauses : 0
% 0.28/0.26 % Propositional clauses after purity: 0
% 0.28/0.26 % Propositional unsat core size : 0
% 0.28/0.26 % Propositional preprocessing time : 0.000
% 0.28/0.26 % Propositional encoding time : 0.000
% 0.28/0.26 % Propositional solver time : 0.000
% 0.28/0.26 % Success case prop preproc time : 0.000
% 0.28/0.26 % Success case prop encoding time : 0.000
% 0.28/0.26 % Success case prop solver time : 0.000
% 0.28/0.26 % Current number of processed clauses : 2
% 0.28/0.26 % Positive orientable unit clauses : 1
% 0.28/0.26 % Positive unorientable unit clauses: 0
% 0.28/0.26 % Negative unit clauses : 1
% 0.28/0.26 % Non-unit-clauses : 0
% 0.28/0.26 % Current number of unprocessed clauses: 4
% 0.28/0.26 % ...number of literals in the above : 7
% 0.28/0.26 % Current number of archived formulas : 0
% 0.28/0.26 % Current number of archived clauses : 5
% 0.28/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.28/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.28/0.26 % Non-unit clause-clause subsumptions : 0
% 0.28/0.26 % Unit Clause-clause subsumption calls : 1
% 0.28/0.26 % Rewrite failures with RHS unbound : 0
% 0.28/0.26 % BW rewrite match attempts : 3
% 0.28/0.26 % BW rewrite match successes : 2
% 0.28/0.26 % Condensation attempts : 0
% 0.28/0.26 % Condensation successes : 0
% 0.28/0.26 % Termbank termtop insertions : 500
% 0.28/0.26 % Search garbage collected termcells : 118
% 0.28/0.26
% 0.28/0.26 % -------------------------------------------------
% 0.28/0.26 % User time : 0.001 s
% 0.28/0.26 % System time : 0.004 s
% 0.28/0.26 % Total time : 0.005 s
% 0.28/0.26 % Maximum resident set size: 3580 pages
% 0.28/0.26
% 0.28/0.26 % -------------------------------------------------
% 0.28/0.26 % User time : 0.003 s
% 0.28/0.26 % System time : 0.008 s
% 0.28/0.26 % Total time : 0.010 s
% 0.28/0.26 % Maximum resident set size: 4864 pages
% 0.28/0.26 % E exiting
%------------------------------------------------------------------------------