%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV197^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 : 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:35:11 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 52 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 207 ( 25 ~; 17 |; 28 &; 122 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 70 ( 0 ^; 70 !; 0 ?; 70 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
iS: $tType ).
thf(decl_23,type,
c0: iS ).
thf(decl_24,type,
cP: iS > iS > iS ).
thf(decl_25,type,
esk1_1: ( iS > $o ) > iS ).
thf(decl_26,type,
esk2_1: ( iS > $o ) > iS ).
thf(decl_27,type,
esk3_0: iS ).
thf(decl_28,type,
esk4_0: iS ).
thf(decl_29,type,
esk5_0: iS ).
thf(decl_30,type,
esk6_0: iS ).
thf(decl_31,type,
esk7_0: iS ).
thf(decl_32,type,
esk8_0: iS ).
thf(decl_33,type,
esk3_1: iS > iS ).
thf(decl_34,type,
esk4_1: iS > iS ).
thf(cS_ALG02_pme,conjecture,
( ( ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 )
& ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X5: iS > $o] :
( ( ( X5 @ c0 )
& ! [X1: iS,X2: iS] :
( ( ( X5 @ X1 )
& ( X5 @ X2 ) )
=> ( X5 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X1: iS] : ( X5 @ X1 ) ) )
=> ( ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vQdpjTZxWZ/E---3.1_4126789.p',cS_ALG02_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 )
& ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X5: iS > $o] :
( ( ( X5 @ c0 )
& ! [X1: iS,X2: iS] :
( ( ( X5 @ X1 )
& ( X5 @ X2 ) )
=> ( X5 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X1: iS] : ( X5 @ X1 ) ) )
=> ( ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 ) ) ),
inference(assume_negation,[status(cth)],[cS_ALG02_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 )
& ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X5: iS > $o] :
( ( ( X5 @ c0 )
& ! [X1: iS,X2: iS] :
( ( ( X5 @ X1 )
& ( X5 @ X2 ) )
=> ( X5 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X1: iS] : ( X5 @ X1 ) ) )
=> ( ! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X22: iS,X23: iS,X24: iS,X25: iS,X26: iS,X27: iS,X28: iS > $o,X31: iS] :
( ( ( cP @ X22 @ X23 )
!= c0 )
& ( ( X24 = X25 )
| ( ( cP @ X24 @ X26 )
!= ( cP @ X25 @ X27 ) ) )
& ( ( X26 = X27 )
| ( ( cP @ X24 @ X26 )
!= ( cP @ X25 @ X27 ) ) )
& ( ( X28 @ ( esk1_1 @ X28 ) )
| ~ ( X28 @ c0 )
| ( X28 @ X31 ) )
& ( ( X28 @ ( esk2_1 @ X28 ) )
| ~ ( X28 @ c0 )
| ( X28 @ X31 ) )
& ( ~ ( X28 @ ( cP @ ( esk1_1 @ X28 ) @ ( esk2_1 @ X28 ) ) )
| ~ ( X28 @ c0 )
| ( X28 @ X31 ) )
& ( ( ( cP @ esk3_0 @ esk5_0 )
= ( cP @ esk4_0 @ esk6_0 ) )
| ( ( cP @ esk7_0 @ esk8_0 )
= c0 ) )
& ( ( esk3_0 != esk4_0 )
| ( esk5_0 != esk6_0 )
| ( ( cP @ esk7_0 @ esk8_0 )
= c0 ) ) ),
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,
! [X1: iS,X4: iS,X3: iS,X2: iS] :
( ( X1 = X2 )
| ( ( cP @ X3 @ X1 )
!= ( cP @ X4 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( ( cP @ esk3_0 @ esk5_0 )
= ( cP @ esk4_0 @ esk6_0 ) )
| ( ( cP @ esk7_0 @ esk8_0 )
= c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X1: iS,X2: iS] :
( ( cP @ X1 @ X2 )
!= c0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X3: iS,X1: iS] :
( ( esk3_1 @ ( cP @ X3 @ X1 ) )
= X1 ),
inference(recognize_injectivity,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( cP @ esk3_0 @ esk5_0 )
= ( cP @ esk4_0 @ esk6_0 ) ),
inference(sr,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( ( cP @ esk7_0 @ esk8_0 )
= c0 )
| ( esk3_0 != esk4_0 )
| ( esk5_0 != esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
! [X1: iS,X2: iS,X3: iS,X4: iS] :
( ( X1 = X2 )
| ( ( cP @ X1 @ X3 )
!= ( cP @ X2 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
esk5_0 = esk6_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ( esk3_0 != esk4_0 )
| ( esk5_0 != esk6_0 ) ),
inference(sr,[status(thm)],[c_0_9,c_0_6]) ).
thf(c_0_13,negated_conjecture,
! [X3: iS,X1: iS] :
( ( esk4_1 @ ( cP @ X1 @ X3 ) )
= X1 ),
inference(recognize_injectivity,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
( ( cP @ esk3_0 @ esk6_0 )
= ( cP @ esk4_0 @ esk6_0 ) ),
inference(rw,[status(thm)],[c_0_8,c_0_11]) ).
thf(c_0_15,negated_conjecture,
esk3_0 != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11])]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV197^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n009.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 15:20:15 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.vQdpjTZxWZ/E---3.1_4126789.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho4 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho2 with 300s (1) cores
% 0.08/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.25 % Starting full_lambda_10 with 300s (1) cores
% 0.08/0.25 % Starting new_ho_8 with 300s (1) cores
% 0.08/0.25 % new_bool_9 with pid 4126825 completed with status 0
% 0.08/0.25 % Result found by new_bool_9
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.08/0.25 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.08/0.25 % Search class: HGUSS-FFSF21-SSSFFSBN
% 0.08/0.25 % partial match(1): HGUSF-FFSF21-SSSFFSBN
% 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 4126833 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.08/0.25 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.08/0.25 % Search class: HGUSS-FFSF21-SSSFFSBN
% 0.08/0.25 % partial match(1): HGUSF-FFSF21-SSSFFSBN
% 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 : 4
% 0.08/0.25 % Removed by relevancy pruning/SinE : 3
% 0.08/0.25 % Initial clauses : 8
% 0.08/0.25 % Removed in clause preprocessing : 0
% 0.08/0.25 % Initial clauses in saturation : 8
% 0.08/0.25 % Processed clauses : 11
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 0
% 0.08/0.25 % ...remaining for further processing : 11
% 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 : 2
% 0.08/0.25 % Generated clauses : 6
% 0.08/0.25 % ...of the previous two non-redundant : 6
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 6
% 0.08/0.25 % Factorizations : 0
% 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 : 6
% 0.08/0.25 % ...of those cached : 3
% 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 : 9
% 0.08/0.25 % Positive orientable unit clauses : 4
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 2
% 0.08/0.25 % Non-unit-clauses : 3
% 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 : 4
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 3
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 3
% 0.08/0.25 % Non-unit clause-clause subsumptions : 0
% 0.08/0.25 % Unit Clause-clause subsumption calls : 4
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 1
% 0.08/0.25 % BW rewrite match successes : 1
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 981
% 0.08/0.25 % Search garbage collected termcells : 332
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.003 s
% 0.08/0.25 % System time : 0.002 s
% 0.08/0.25 % Total time : 0.005 s
% 0.08/0.25 % Maximum resident set size: 3632 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.006 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
%------------------------------------------------------------------------------