%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU495^1 : TPTP v9.3.1. Released v3.6.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:26:18 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 12 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 8 ~; 12 |; 3 &; 42 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 23 ( 8 ^; 15 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_41,type,
total: ( $i > $i > $o ) > $o ).
thf(decl_52,type,
epred1_0: $i > $i > $o ).
thf(decl_53,type,
esk1_0: $i ).
thf(decl_54,type,
esk2_0: $i ).
thf(inverse_of_total_relation_is_total_relation,conjecture,
! [X1: $i > $i > $o] :
( ( total @ X1 )
=> ( total @ ( inv @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oVvDtENIKl/E---3.1_4013107.p',inverse_of_total_relation_is_total_relation) ).
thf(inverse,axiom,
( inv
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] : ( X1 @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oVvDtENIKl/E---3.1_4013107.p',inverse) ).
thf(total,axiom,
( total
= ( ^ [X1: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( X3 = X4 )
| ( X1 @ X3 @ X4 )
| ( X1 @ X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oVvDtENIKl/E---3.1_4013107.p',total) ).
thf(c_0_3,negated_conjecture,
~ ! [X1: $i > $i > $o] :
( ( total @ X1 )
=> ( total @ ( inv @ X1 ) ) ),
inference(assume_negation,[status(cth)],[inverse_of_total_relation_is_total_relation]) ).
thf(c_0_4,plain,
( inv
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] : ( Z0 @ Z2 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[inverse]) ).
thf(c_0_5,plain,
( total
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( X3 = X4 )
| ( Z0 @ X3 @ X4 )
| ( Z0 @ X4 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[total]) ).
thf(c_0_6,negated_conjecture,
~ ! [X1: $i > $i > $o] :
( ! [X158: $i,X159: $i] :
( ( X158 = X159 )
| ( X1 @ X158 @ X159 )
| ( X1 @ X159 @ X158 ) )
=> ! [X160: $i,X161: $i] :
( ( X160 = X161 )
| ( X1 @ X161 @ X160 )
| ( X1 @ X160 @ X161 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X163: $i,X164: $i] :
( ( ( X163 = X164 )
| ( epred1_0 @ X163 @ X164 )
| ( epred1_0 @ X164 @ X163 ) )
& ( esk1_0 != esk2_0 )
& ~ ( epred1_0 @ esk2_0 @ esk1_0 )
& ~ ( epred1_0 @ 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_6])])])])]) ).
thf(c_0_8,negated_conjecture,
~ ( epred1_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X4: $i,X3: $i] :
( ( X3 = X4 )
| ( epred1_0 @ X3 @ X4 )
| ( epred1_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
~ ( epred1_0 @ esk2_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU495^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n009.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:46:24 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.oVvDtENIKl/E---3.1_4013107.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25 % Starting sh1l with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.25 % sh1l with pid 4013122 completed with status 0
% 0.08/0.25 % Result found by sh1l
% 0.08/0.25 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25 % Starting sh1l with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HGUSF-FFSF00-SHSSMFNN
% 0.08/0.25 % partial match(1): HGUNF-FFSF00-SHSSMFNN
% 0.08/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25 % SubtermCWHack with pid 4013124 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25 % Starting sh1l with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HGUSF-FFSF00-SHSSMFNN
% 0.08/0.25 % partial match(1): HGUNF-FFSF00-SHSSMFNN
% 0.08/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25 % Preprocessing time : 0.001 s
% 0.08/0.25
% 0.08/0.25 % Proof found!
% 0.08/0.25 % SZS status Theorem
% 0.08/0.25 % SZS output start CNFRefutation
% See solution above
% 0.08/0.25 % Parsed axioms : 59
% 0.08/0.25 % Removed by relevancy pruning/SinE : 0
% 0.08/0.25 % Initial clauses : 33
% 0.08/0.25 % Removed in clause preprocessing : 29
% 0.08/0.25 % Initial clauses in saturation : 4
% 0.08/0.25 % Processed clauses : 4
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 0
% 0.08/0.25 % ...remaining for further processing : 4
% 0.08/0.25 % Other redundant clauses eliminated : 0
% 0.08/0.25 % Clauses deleted for lack of memory : 0
% 0.08/0.25 % Backward-subsumed : 0
% 0.08/0.25 % Backward-rewritten : 0
% 0.08/0.25 % Generated clauses : 4
% 0.08/0.25 % ...of the previous two non-redundant : 0
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 2
% 0.08/0.25 % Factorizations : 2
% 0.08/0.25 % NegExts : 0
% 0.08/0.25 % Equation resolutions : 0
% 0.08/0.25 % Disequality decompositions : 0
% 0.08/0.25 % Total rewrite steps : 0
% 0.08/0.25 % ...of those cached : 0
% 0.08/0.25 % Propositional unsat checks : 0
% 0.08/0.25 % Propositional check models : 0
% 0.08/0.25 % Propositional check unsatisfiable : 0
% 0.08/0.25 % Propositional clauses : 0
% 0.08/0.25 % Propositional clauses after purity: 0
% 0.08/0.25 % Propositional unsat core size : 0
% 0.08/0.25 % Propositional preprocessing time : 0.000
% 0.08/0.25 % Propositional encoding time : 0.000
% 0.08/0.25 % Propositional solver time : 0.000
% 0.08/0.25 % Success case prop preproc time : 0.000
% 0.08/0.25 % Success case prop encoding time : 0.000
% 0.08/0.25 % Success case prop solver time : 0.000
% 0.08/0.25 % Current number of processed clauses : 4
% 0.08/0.25 % Positive orientable unit clauses : 0
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 3
% 0.08/0.25 % Non-unit-clauses : 1
% 0.08/0.25 % Current number of unprocessed clauses: 0
% 0.08/0.25 % ...number of literals in the above : 0
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 0
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.25 % Non-unit clause-clause subsumptions : 0
% 0.08/0.25 % Unit Clause-clause subsumption calls : 1
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 0
% 0.08/0.25 % BW rewrite match successes : 0
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 2945
% 0.08/0.25 % Search garbage collected termcells : 698
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.004 s
% 0.08/0.25 % System time : 0.001 s
% 0.08/0.25 % Total time : 0.005 s
% 0.08/0.25 % Maximum resident set size: 3944 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.006 s
% 0.08/0.25 % System time : 0.005 s
% 0.08/0.25 % Total time : 0.012 s
% 0.08/0.25 % Maximum resident set size: 4864 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------