%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM643^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:16:40 AM UTC 2026
% Result : Theorem 0.11s 0.25s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 22 unt; 0 typ; 0 def)
% Number of atoms : 65 ( 31 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 382 ( 19 ~; 18 |; 1 &; 339 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 54 ( 14 ^; 40 !; 0 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
set: $tType ).
thf(decl_23,type,
x: nat ).
thf(decl_24,type,
y: nat ).
thf(decl_25,type,
z: nat ).
thf(decl_26,type,
pl: nat > nat > nat ).
thf(decl_27,type,
esti: nat > set > $o ).
thf(decl_28,type,
setof: ( nat > $o ) > set ).
thf(decl_29,type,
n_1: nat ).
thf(decl_30,type,
suc: nat > nat ).
thf(decl_31,type,
esk1_1: set > nat ).
thf(satz5,conjecture,
( ( pl @ ( pl @ x @ y ) @ z )
= ( pl @ x @ ( pl @ y @ z ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8QCZ8uZfKW/E---3.1_268885.p',satz5) ).
thf(estii,axiom,
! [X1: nat > $o,X2: nat] :
( ( X1 @ X2 )
=> ( esti @ X2 @ ( setof @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8QCZ8uZfKW/E---3.1_268885.p',estii) ).
thf(satz4f,axiom,
! [X4: nat,X5: nat] :
( ( suc @ ( pl @ X4 @ X5 ) )
= ( pl @ X4 @ ( suc @ X5 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8QCZ8uZfKW/E---3.1_268885.p',satz4f) ).
thf(satz4e,axiom,
! [X4: nat] :
( ( suc @ X4 )
= ( pl @ X4 @ n_1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.8QCZ8uZfKW/E---3.1_268885.p',satz4e) ).
thf(ax5,axiom,
! [X3: set] :
( ( esti @ n_1 @ X3 )
=> ( ! [X4: nat] :
( ( esti @ X4 @ X3 )
=> ( esti @ ( suc @ X4 ) @ X3 ) )
=> ! [X4: nat] : ( esti @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8QCZ8uZfKW/E---3.1_268885.p',ax5) ).
thf(estie,axiom,
! [X1: nat > $o,X2: nat] :
( ( esti @ X2 @ ( setof @ X1 ) )
=> ( X1 @ X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.8QCZ8uZfKW/E---3.1_268885.p',estie) ).
thf(c_0_6,negated_conjecture,
( ( pl @ ( pl @ x @ y ) @ z )
!= ( pl @ x @ ( pl @ y @ z ) ) ),
inference(assume_negation,[status(cth)],[satz5]) ).
thf(c_0_7,negated_conjecture,
( ( pl @ ( pl @ x @ y ) @ z )
!= ( pl @ x @ ( pl @ y @ z ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
thf(c_0_8,plain,
! [X24: nat > $o,X25: nat] :
( ~ ( X24 @ X25 )
| ( esti @ X25 @ ( setof @ X24 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estii])])]) ).
thf(c_0_9,negated_conjecture,
( ( pl @ ( pl @ x @ y ) @ z )
!= ( pl @ x @ ( pl @ y @ z ) ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X27: nat,X28: nat] :
( ( suc @ ( pl @ X27 @ X28 ) )
= ( pl @ X27 @ ( suc @ X28 ) ) ),
inference(variable_rename,[status(thm)],[satz4f]) ).
thf(c_0_11,plain,
! [X26: nat] :
( ( suc @ X26 )
= ( pl @ X26 @ n_1 ) ),
inference(variable_rename,[status(thm)],[satz4e]) ).
thf(c_0_12,plain,
! [X21: set,X23: nat] :
( ( ( esti @ ( esk1_1 @ X21 ) @ X21 )
| ( esti @ X23 @ X21 )
| ~ ( esti @ n_1 @ X21 ) )
& ( ~ ( esti @ ( suc @ ( esk1_1 @ X21 ) ) @ X21 )
| ( esti @ X23 @ X21 )
| ~ ( esti @ n_1 @ X21 ) ) ),
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)],[ax5])])])])])]) ).
thf(c_0_13,plain,
! [X1: nat > $o,X2: nat] :
( ( esti @ X2 @ ( setof @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
( ( pl @ ( pl @ x @ y ) @ z )
!= ( pl @ x @ ( pl @ y @ z ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X2: nat,X4: nat] :
( ( suc @ ( pl @ X2 @ X4 ) )
= ( pl @ X2 @ ( suc @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X2: nat] :
( ( suc @ X2 )
= ( pl @ X2 @ n_1 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
! [X2: nat,X3: set] :
( ( esti @ ( esk1_1 @ X3 ) @ X3 )
| ( esti @ X2 @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
! [X2: nat] :
( ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) )
| ( ( pl @ ( pl @ x @ y ) @ X2 )
!= ( pl @ x @ ( pl @ y @ X2 ) ) ) ),
inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]),c_0_13,c_0_14]) ).
thf(c_0_19,plain,
! [X2: nat,X4: nat] :
( ( pl @ ( pl @ X2 @ X4 ) @ n_1 )
= ( pl @ X2 @ ( pl @ X4 @ n_1 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
thf(c_0_20,plain,
! [X19: nat > $o,X20: nat] :
( ~ ( esti @ X20 @ ( setof @ X19 ) )
| ( X19 @ X20 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estie])])]) ).
thf(c_0_21,plain,
! [X2: nat] :
( ( esti
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) )
| ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
thf(c_0_22,plain,
! [X2: nat,X1: nat > $o] :
( ( X1 @ X2 )
| ~ ( esti @ X2 @ ( setof @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,plain,
( esti
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) ),
inference(ef,[status(thm)],[c_0_21]) ).
thf(c_0_24,plain,
! [X2: nat,X3: set] :
( ( esti @ X2 @ X3 )
| ~ ( esti @ ( suc @ ( esk1_1 @ X3 ) ) @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_25,plain,
( ( pl @ ( pl @ x @ y )
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) ) )
= ( pl @ x
@ ( pl @ y
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) ) ) ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]) ).
thf(c_0_26,plain,
! [X2: nat,X3: set] :
( ( esti @ X2 @ X3 )
| ~ ( esti @ ( pl @ ( esk1_1 @ X3 ) @ n_1 ) @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(rw,[status(thm)],[c_0_24,c_0_16]) ).
thf(c_0_27,plain,
( ( pl @ ( pl @ x @ y )
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) )
@ n_1 ) )
= ( pl @ x
@ ( pl @ y
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) )
@ n_1 ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_25]),c_0_19]),c_0_19]) ).
thf(c_0_28,plain,
! [X2: nat] :
( ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) )
| ~ ( esti @ n_1
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_27])]) ).
thf(c_0_29,plain,
! [X2: nat] :
( ( ( pl @ ( pl @ x @ y ) @ X2 )
= ( pl @ x @ ( pl @ y @ X2 ) ) )
| ~ ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) ) ),
inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]),c_0_22,c_0_14]) ).
thf(c_0_30,plain,
! [X2: nat] :
( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( ( pl @ ( pl @ x @ y ) @ Z0 )
= ( pl @ x @ ( pl @ y @ Z0 ) ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_13])]),c_0_19])]) ).
thf(c_0_31,plain,
! [X2: nat] :
( ( pl @ ( pl @ x @ y ) @ X2 )
= ( pl @ x @ ( pl @ y @ X2 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM643^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.15 % Computer : n017.cluster.edu
% 0.11/0.15 % Model : x86_64 x86_64
% 0.11/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.15 % Memory : 8046.5625MB
% 0.11/0.15 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Tue Sep 29 12:23:06 UTC 2026
% 0.11/0.16 % CPUTime :
% 0.11/0.16 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.20 Running higher-order theorem proving
% 0.11/0.21 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.8QCZ8uZfKW/E---3.1_268885.p
% 0.11/0.25 % Version: 3.5.1-ho
% 0.11/0.25 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting new_ho_14 with 1200s (4) cores
% 0.11/0.25 % Starting new_ho_13 with 600s (2) cores
% 0.11/0.25 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.11/0.25 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.25 % new_ho_13 with pid 268899 completed with status 0
% 0.11/0.25 % Result found by new_ho_13
% 0.11/0.25 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting new_ho_14 with 1200s (4) cores
% 0.11/0.25 % Starting new_ho_13 with 600s (2) cores
% 0.11/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25 % No SInE strategy applied
% 0.11/0.25 % Search class: HGUSM-FFSF21-MSFFFSBN
% 0.11/0.25 % partial match(1): HGUSM-FFSF21-SSFFFSBN
% 0.11/0.25 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.11/0.25 % Starting SubtermCWHack with 61s (1) cores
% 0.11/0.25 % Starting new_ho_14 with 361s (1) cores
% 0.11/0.25 % SubtermCWHack with pid 268904 completed with status 0
% 0.11/0.25 % Result found by SubtermCWHack
% 0.11/0.25 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.11/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting new_ho_14 with 1200s (4) cores
% 0.11/0.25 % Starting new_ho_13 with 600s (2) cores
% 0.11/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25 % No SInE strategy applied
% 0.11/0.25 % Search class: HGUSM-FFSF21-MSFFFSBN
% 0.11/0.25 % partial match(1): HGUSM-FFSF21-SSFFFSBN
% 0.11/0.25 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.11/0.25 % Starting SubtermCWHack with 61s (1) cores
% 0.11/0.25 % Preprocessing time : 0.001 s
% 0.11/0.25
% 0.11/0.25 % Proof found!
% 0.11/0.25 % SZS status Theorem
% 0.11/0.25 % SZS output start CNFRefutation
% See solution above
% 0.11/0.25 % Parsed axioms : 18
% 0.11/0.25 % Removed by relevancy pruning/SinE : 0
% 0.11/0.25 % Initial clauses : 19
% 0.11/0.25 % Removed in clause preprocessing : 10
% 0.11/0.25 % Initial clauses in saturation : 13
% 0.11/0.25 % Processed clauses : 57
% 0.11/0.25 % ...of these trivial : 27
% 0.11/0.25 % ...subsumed : 0
% 0.11/0.25 % ...remaining for further processing : 30
% 0.11/0.25 % Other redundant clauses eliminated : 0
% 0.11/0.25 % Clauses deleted for lack of memory : 0
% 0.11/0.25 % Backward-subsumed : 2
% 0.11/0.25 % Backward-rewritten : 6
% 0.11/0.25 % Generated clauses : 135
% 0.11/0.25 % ...of the previous two non-redundant : 118
% 0.11/0.25 % ...aggressively subsumed : 0
% 0.11/0.25 % Contextual simplify-reflections : 0
% 0.11/0.25 % Paramodulations : 133
% 0.11/0.25 % Factorizations : 2
% 0.11/0.25 % NegExts : 0
% 0.11/0.25 % Equation resolutions : 0
% 0.11/0.25 % Disequality decompositions : 0
% 0.11/0.25 % Total rewrite steps : 909
% 0.11/0.25 % ...of those cached : 608
% 0.11/0.25 % Propositional unsat checks : 0
% 0.11/0.25 % Propositional check models : 0
% 0.11/0.25 % Propositional check unsatisfiable : 0
% 0.11/0.25 % Propositional clauses : 0
% 0.11/0.25 % Propositional clauses after purity: 0
% 0.11/0.25 % Propositional unsat core size : 0
% 0.11/0.25 % Propositional preprocessing time : 0.000
% 0.11/0.25 % Propositional encoding time : 0.000
% 0.11/0.25 % Propositional solver time : 0.000
% 0.11/0.25 % Success case prop preproc time : 0.000
% 0.11/0.25 % Success case prop encoding time : 0.000
% 0.11/0.25 % Success case prop solver time : 0.000
% 0.11/0.25 % Current number of processed clauses : 22
% 0.11/0.25 % Positive orientable unit clauses : 12
% 0.11/0.25 % Positive unorientable unit clauses: 0
% 0.11/0.25 % Negative unit clauses : 0
% 0.11/0.25 % Non-unit-clauses : 10
% 0.11/0.25 % Current number of unprocessed clauses: 71
% 0.11/0.25 % ...number of literals in the above : 75
% 0.11/0.25 % Current number of archived formulas : 0
% 0.11/0.25 % Current number of archived clauses : 8
% 0.11/0.25 % Clause-clause subsumption calls (NU) : 42
% 0.11/0.25 % Rec. Clause-clause subsumption calls : 42
% 0.11/0.25 % Non-unit clause-clause subsumptions : 0
% 0.11/0.25 % Unit Clause-clause subsumption calls : 3
% 0.11/0.25 % Rewrite failures with RHS unbound : 0
% 0.11/0.25 % BW rewrite match attempts : 32
% 0.11/0.25 % BW rewrite match successes : 7
% 0.11/0.25 % Condensation attempts : 0
% 0.11/0.25 % Condensation successes : 0
% 0.11/0.25 % Termbank termtop insertions : 11497
% 0.11/0.25 % Search garbage collected termcells : 135
% 0.11/0.25
% 0.11/0.25 % -------------------------------------------------
% 0.11/0.25 % User time : 0.014 s
% 0.11/0.25 % System time : 0.003 s
% 0.11/0.25 % Total time : 0.017 s
% 0.11/0.25 % Maximum resident set size: 3640 pages
% 0.11/0.25
% 0.11/0.25 % -------------------------------------------------
% 0.11/0.25 % User time : 0.024 s
% 0.11/0.25 % System time : 0.010 s
% 0.11/0.25 % Total time : 0.034 s
% 0.11/0.25 % Maximum resident set size: 4864 pages
% 0.11/0.25 % E exiting
%------------------------------------------------------------------------------