%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV013^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:49 AM UTC 2026
% Result : Theorem 0.24s 0.33s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 64 ( 63 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 74 ( 29 ~; 30 |; 11 &; 0 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 ^; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
esk1_0: a ).
thf(decl_24,type,
esk2_0: a ).
thf(decl_25,type,
esk3_0: a ).
thf(decl_26,type,
esk4_0: a ).
thf(decl_27,type,
esk5_0: a ).
thf(decl_28,type,
esk6_0: a ).
thf(cTHM511_pme,conjecture,
( ! [X1: a] : ( X1 = X1 )
& ! [X1: a,X2: a] :
( ( X1 = X2 )
=> ( X2 = X1 ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( X1 = X2 )
& ( X2 = X3 ) )
=> ( X1 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CZQ9sPUPoh/E---3.1_708959.p',cTHM511_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: a] : ( X1 = X1 )
& ! [X1: a,X2: a] :
( ( X1 = X2 )
=> ( X2 = X1 ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( X1 = X2 )
& ( X2 = X3 ) )
=> ( X1 = X3 ) ) ),
inference(assume_negation,[status(cth)],[cTHM511_pme]) ).
thf(c_0_2,negated_conjecture,
( ( ( esk4_0 = esk5_0 )
| ( esk2_0 = esk3_0 )
| ( esk1_0 != esk1_0 ) )
& ( ( esk5_0 = esk6_0 )
| ( esk2_0 = esk3_0 )
| ( esk1_0 != esk1_0 ) )
& ( ( esk4_0 != esk6_0 )
| ( esk2_0 = esk3_0 )
| ( esk1_0 != esk1_0 ) )
& ( ( esk4_0 = esk5_0 )
| ( esk3_0 != esk2_0 )
| ( esk1_0 != esk1_0 ) )
& ( ( esk5_0 = esk6_0 )
| ( esk3_0 != esk2_0 )
| ( esk1_0 != esk1_0 ) )
& ( ( esk4_0 != esk6_0 )
| ( esk3_0 != esk2_0 )
| ( esk1_0 != esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
( ( esk5_0 = esk6_0 )
| ( esk3_0 != esk2_0 )
| ( esk1_0 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( esk5_0 = esk6_0 )
| ( esk2_0 = esk3_0 )
| ( esk1_0 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( esk4_0 = esk5_0 )
| ( esk3_0 != esk2_0 )
| ( esk1_0 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( esk4_0 = esk5_0 )
| ( esk2_0 = esk3_0 )
| ( esk1_0 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( esk4_0 != esk6_0 )
| ( esk3_0 != esk2_0 )
| ( esk1_0 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( esk6_0 = esk5_0 )
| ( esk3_0 != esk2_0 ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
( ( esk3_0 = esk2_0 )
| ( esk6_0 = esk5_0 ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
( ( esk5_0 = esk4_0 )
| ( esk3_0 != esk2_0 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
( ( esk3_0 = esk2_0 )
| ( esk5_0 = esk4_0 ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
( ( esk2_0 = esk3_0 )
| ( esk4_0 != esk6_0 )
| ( esk1_0 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( esk3_0 != esk2_0 )
| ( esk6_0 != esk4_0 ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
esk6_0 = esk5_0,
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_15,negated_conjecture,
esk4_0 = esk5_0,
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_16,negated_conjecture,
( ( esk3_0 = esk2_0 )
| ( esk6_0 != esk4_0 ) ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
esk3_0 != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_14])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV013^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 % Computer : n026.cluster.edu
% 0.09/0.23 % Model : x86_64 x86_64
% 0.09/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.23 % Memory : 8046.5625MB
% 0.09/0.23 % OS : Linux 6.8.0-71-generic
% 0.09/0.23 % CPULimit : 300
% 0.09/0.23 % WCLimit : 300
% 0.09/0.23 % DateTime : Tue Sep 29 15:02:57 UTC 2026
% 0.09/0.24 % CPUTime :
% 0.09/0.24 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.30 Running higher-order theorem proving
% 0.24/0.31 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.CZQ9sPUPoh/E---3.1_708959.p
% 0.24/0.33 % Version: 3.5.1-ho
% 0.24/0.33 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.33 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.33 % Starting sh4l with 300s (1) cores
% 0.24/0.33 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.24/0.33 % ho_unfolding_6 with pid 708975 completed with status 0
% 0.24/0.33 % Result found by ho_unfolding_6
% 0.24/0.33 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.33 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.33 % No SInE strategy applied
% 0.24/0.33 % Search class: HGHPF-FFSF00-SFFFFFNN
% 0.24/0.33 % partial match(1): HGHNF-FFSF00-SFFFFFNN
% 0.24/0.33 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.33 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.33 % SubtermCWHack with pid 708978 completed with status 0
% 0.24/0.33 % Result found by SubtermCWHack
% 0.24/0.33 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.33 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.33 % No SInE strategy applied
% 0.24/0.33 % Search class: HGHPF-FFSF00-SFFFFFNN
% 0.24/0.33 % partial match(1): HGHNF-FFSF00-SFFFFFNN
% 0.24/0.33 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.33 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.33 % Preprocessing time : 0.002 s
% 0.24/0.33
% 0.24/0.33 % Proof found!
% 0.24/0.33 % SZS status Theorem
% 0.24/0.33 % SZS output start CNFRefutation
% See solution above
% 0.24/0.33 % Parsed axioms : 2
% 0.24/0.33 % Removed by relevancy pruning/SinE : 0
% 0.24/0.33 % Initial clauses : 7
% 0.24/0.33 % Removed in clause preprocessing : 1
% 0.24/0.33 % Initial clauses in saturation : 6
% 0.24/0.33 % Processed clauses : 7
% 0.24/0.33 % ...of these trivial : 0
% 0.24/0.33 % ...subsumed : 0
% 0.24/0.33 % ...remaining for further processing : 6
% 0.24/0.33 % Other redundant clauses eliminated : 0
% 0.24/0.33 % Clauses deleted for lack of memory : 0
% 0.24/0.33 % Backward-subsumed : 2
% 0.24/0.33 % Backward-rewritten : 1
% 0.24/0.33 % Generated clauses : 1
% 0.24/0.33 % ...of the previous two non-redundant : 2
% 0.24/0.33 % ...aggressively subsumed : 0
% 0.24/0.33 % Contextual simplify-reflections : 2
% 0.24/0.33 % Paramodulations : 1
% 0.24/0.33 % Factorizations : 0
% 0.24/0.33 % NegExts : 0
% 0.24/0.33 % Equation resolutions : 0
% 0.24/0.33 % Disequality decompositions : 0
% 0.24/0.33 % Total rewrite steps : 4
% 0.24/0.33 % ...of those cached : 2
% 0.24/0.33 % Propositional unsat checks : 0
% 0.24/0.33 % Propositional check models : 0
% 0.24/0.33 % Propositional check unsatisfiable : 0
% 0.24/0.33 % Propositional clauses : 0
% 0.24/0.33 % Propositional clauses after purity: 0
% 0.24/0.33 % Propositional unsat core size : 0
% 0.24/0.33 % Propositional preprocessing time : 0.000
% 0.24/0.33 % Propositional encoding time : 0.000
% 0.24/0.33 % Propositional solver time : 0.000
% 0.24/0.33 % Success case prop preproc time : 0.000
% 0.24/0.33 % Success case prop encoding time : 0.000
% 0.24/0.33 % Success case prop solver time : 0.000
% 0.24/0.33 % Current number of processed clauses : 3
% 0.24/0.33 % Positive orientable unit clauses : 2
% 0.24/0.33 % Positive unorientable unit clauses: 0
% 0.24/0.33 % Negative unit clauses : 1
% 0.24/0.33 % Non-unit-clauses : 0
% 0.24/0.33 % Current number of unprocessed clauses: 0
% 0.24/0.33 % ...number of literals in the above : 0
% 0.24/0.33 % Current number of archived formulas : 0
% 0.24/0.33 % Current number of archived clauses : 3
% 0.24/0.33 % Clause-clause subsumption calls (NU) : 2
% 0.24/0.33 % Rec. Clause-clause subsumption calls : 2
% 0.24/0.33 % Non-unit clause-clause subsumptions : 2
% 0.24/0.33 % Unit Clause-clause subsumption calls : 2
% 0.24/0.33 % Rewrite failures with RHS unbound : 0
% 0.24/0.33 % BW rewrite match attempts : 2
% 0.24/0.33 % BW rewrite match successes : 2
% 0.24/0.33 % Condensation attempts : 0
% 0.24/0.33 % Condensation successes : 0
% 0.24/0.33 % Termbank termtop insertions : 351
% 0.24/0.33 % Search garbage collected termcells : 111
% 0.24/0.33
% 0.24/0.33 % -------------------------------------------------
% 0.24/0.33 % User time : 0.003 s
% 0.24/0.33 % System time : 0.003 s
% 0.24/0.33 % Total time : 0.006 s
% 0.24/0.33 % Maximum resident set size: 3880 pages
% 0.24/0.33
% 0.24/0.33 % -------------------------------------------------
% 0.24/0.33 % User time : 0.004 s
% 0.24/0.33 % System time : 0.008 s
% 0.24/0.33 % Total time : 0.012 s
% 0.24/0.33 % Maximum resident set size: 4864 pages
% 0.24/0.33 % E exiting
%------------------------------------------------------------------------------