%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU775^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:25:35 AM UTC 2026
% Result : Theorem 0.25s 0.26s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 44 ( 8 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 144 ( 4 ~; 0 |; 2 &; 130 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 50 ( 32 ^; 18 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
subset: $i > $i > $o ).
thf(decl_25,type,
kpair: $i > $i > $i ).
thf(decl_26,type,
cartprod: $i > $i > $i ).
thf(decl_27,type,
breln: $i > $i > $i > $o ).
thf(decl_28,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(decl_29,type,
breln1: $i > $i > $o ).
thf(decl_30,type,
setOfPairsIsBReln1: $o ).
thf(decl_31,type,
breln1invset: $i > $i > $i ).
thf(decl_32,type,
esk1_0: $i ).
thf(decl_33,type,
esk2_0: $i ).
thf(breln1,axiom,
( breln1
= ( ^ [X1: $i,X4: $i] : ( breln @ X1 @ X1 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RWMyqbkpo2/E---3.1_3233082.p',breln1) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X2: $i,X3: $i] : ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RWMyqbkpo2/E---3.1_3233082.p',breln) ).
thf(setOfPairsIsBReln1,axiom,
( setOfPairsIsBReln1
<=> ! [X1: $i,X5: $i > $i > $o] :
( breln1 @ X1
@ ( dpsetconstr @ X1 @ X1
@ ^ [X6: $i,X7: $i] : ( X5 @ X6 @ X7 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RWMyqbkpo2/E---3.1_3233082.p',setOfPairsIsBReln1) ).
thf(breln1invprop,conjecture,
( setOfPairsIsBReln1
=> ! [X1: $i,X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( breln1 @ X1 @ ( breln1invset @ X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RWMyqbkpo2/E---3.1_3233082.p',breln1invprop) ).
thf(breln1invset,axiom,
( breln1invset
= ( ^ [X1: $i,X4: $i] :
( dpsetconstr @ X1 @ X1
@ ^ [X6: $i,X7: $i] : ( in @ ( kpair @ X7 @ X6 ) @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RWMyqbkpo2/E---3.1_3233082.p',breln1invset) ).
thf(c_0_5,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( subset @ Z1 @ ( cartprod @ Z0 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln1]) ).
thf(c_0_6,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_7,plain,
( setOfPairsIsBReln1
<=> ! [X1: $i,X5: $i > $i > $o] :
( breln1 @ X1
@ ( dpsetconstr @ X1 @ X1
@ ^ [Z0: $i,Z1: $i] : ( X5 @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[setOfPairsIsBReln1]) ).
thf(c_0_8,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( subset @ Z1 @ ( cartprod @ Z0 @ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( setOfPairsIsBReln1
=> ! [X1: $i,X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( breln1 @ X1 @ ( breln1invset @ X1 @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[breln1invprop]) ).
thf(c_0_10,plain,
( breln1invset
= ( ^ [Z0: $i,Z1: $i] :
( dpsetconstr @ Z0 @ Z0
@ ^ [Z2: $i,Z3: $i] : ( in @ ( kpair @ Z3 @ Z2 ) @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln1invset]) ).
thf(c_0_11,plain,
( setOfPairsIsBReln1
= ( ! [X1: $i,X5: $i > $i > $o] :
( subset
@ ( dpsetconstr @ X1 @ X1
@ ^ [Z0: $i,Z1: $i] : ( X5 @ Z0 @ Z1 ) )
@ ( cartprod @ X1 @ X1 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
~ ( ! [X12: $i,X13: $i > $i > $o] : ( subset @ ( dpsetconstr @ X12 @ X12 @ X13 ) @ ( cartprod @ X12 @ X12 ) )
=> ! [X1: $i,X4: $i] :
( ( subset @ X4 @ ( cartprod @ X1 @ X1 ) )
=> ( subset
@ ( dpsetconstr @ X1 @ X1
@ ^ [Z0: $i,Z1: $i] : ( in @ ( kpair @ Z1 @ Z0 ) @ X4 ) )
@ ( cartprod @ X1 @ X1 ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_8])]) ).
thf(c_0_13,negated_conjecture,
! [X14: $i,X15: $i > $i > $o] :
( ( subset @ ( dpsetconstr @ X14 @ X14 @ X15 ) @ ( cartprod @ X14 @ X14 ) )
& ( subset @ esk2_0 @ ( cartprod @ esk1_0 @ esk1_0 ) )
& ~ ( subset
@ ( dpsetconstr @ esk1_0 @ esk1_0
@ ^ [Z0: $i,Z1: $i] : ( in @ ( kpair @ Z1 @ Z0 ) @ esk2_0 ) )
@ ( cartprod @ esk1_0 @ esk1_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_12])])])])]) ).
thf(c_0_14,negated_conjecture,
~ ( subset
@ ( dpsetconstr @ esk1_0 @ esk1_0
@ ^ [Z0: $i,Z1: $i] : ( in @ ( kpair @ Z1 @ Z0 ) @ esk2_0 ) )
@ ( cartprod @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X5: $i > $i > $o,X1: $i] : ( subset @ ( dpsetconstr @ X1 @ X1 @ X5 ) @ ( cartprod @ X1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU775^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n008.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 14:28:39 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.25 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.RWMyqbkpo2/E---3.1_3233082.p
% 0.25/0.26 % Version: 3.5.1-ho
% 0.25/0.26 % Preprocessing class: HSSSSMSSSLMNSFN.
% 0.25/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.26 % Starting sh5l with 300s (1) cores
% 0.25/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.25/0.26 % Starting lpo1_def_fix with 300s (1) cores
% 0.25/0.26 % lpo1_def_fix with pid 3233098 completed with status 0
% 0.25/0.26 % Result found by lpo1_def_fix
% 0.25/0.26 % Preprocessing class: HSSSSMSSSLMNSFN.
% 0.25/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.26 % Starting sh5l with 300s (1) cores
% 0.25/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.25/0.26 % Starting lpo1_def_fix with 300s (1) cores
% 0.25/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf600_gu_R05_F100_L20000)
% 0.25/0.26 % SinE strategy is gf600_gu_R05_F100_L20000
% 0.25/0.26 % Search class: HUUNF-FFSF32-MSFFMFBN
% 0.25/0.26 % partial match(4): HGUNF-FFSF32-SFFFMFNN
% 0.25/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.26 % SubtermCWHack with pid 3233099 completed with status 0
% 0.25/0.26 % Result found by SubtermCWHack
% 0.25/0.26 % Preprocessing class: HSSSSMSSSLMNSFN.
% 0.25/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.26 % Starting sh5l with 300s (1) cores
% 0.25/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.25/0.26 % Starting lpo1_def_fix with 300s (1) cores
% 0.25/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf600_gu_R05_F100_L20000)
% 0.25/0.26 % SinE strategy is gf600_gu_R05_F100_L20000
% 0.25/0.26 % Search class: HUUNF-FFSF32-MSFFMFBN
% 0.25/0.26 % partial match(4): HGUNF-FFSF32-SFFFMFNN
% 0.25/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.26 % Preprocessing time : 0.001 s
% 0.25/0.26
% 0.25/0.26 % Proof found!
% 0.25/0.26 % SZS status Theorem
% 0.25/0.26 % SZS output start CNFRefutation
% See solution above
% 0.25/0.26 % Parsed axioms : 14
% 0.25/0.26 % Removed by relevancy pruning/SinE : 9
% 0.25/0.26 % Initial clauses : 3
% 0.25/0.26 % Removed in clause preprocessing : 0
% 0.25/0.26 % Initial clauses in saturation : 3
% 0.25/0.26 % Processed clauses : 3
% 0.25/0.26 % ...of these trivial : 0
% 0.25/0.26 % ...subsumed : 0
% 0.25/0.26 % ...remaining for further processing : 3
% 0.25/0.26 % Other redundant clauses eliminated : 0
% 0.25/0.26 % Clauses deleted for lack of memory : 0
% 0.25/0.26 % Backward-subsumed : 0
% 0.25/0.26 % Backward-rewritten : 0
% 0.25/0.26 % Generated clauses : 1
% 0.25/0.26 % ...of the previous two non-redundant : 0
% 0.25/0.26 % ...aggressively subsumed : 0
% 0.25/0.26 % Contextual simplify-reflections : 0
% 0.25/0.26 % Paramodulations : 1
% 0.25/0.26 % Factorizations : 0
% 0.25/0.26 % NegExts : 0
% 0.25/0.26 % Equation resolutions : 0
% 0.25/0.26 % Disequality decompositions : 0
% 0.25/0.26 % Total rewrite steps : 0
% 0.25/0.26 % ...of those cached : 0
% 0.25/0.26 % Propositional unsat checks : 0
% 0.25/0.26 % Propositional check models : 0
% 0.25/0.26 % Propositional check unsatisfiable : 0
% 0.25/0.26 % Propositional clauses : 0
% 0.25/0.26 % Propositional clauses after purity: 0
% 0.25/0.26 % Propositional unsat core size : 0
% 0.25/0.26 % Propositional preprocessing time : 0.000
% 0.25/0.26 % Propositional encoding time : 0.000
% 0.25/0.26 % Propositional solver time : 0.000
% 0.25/0.26 % Success case prop preproc time : 0.000
% 0.25/0.26 % Success case prop encoding time : 0.000
% 0.25/0.26 % Success case prop solver time : 0.000
% 0.25/0.26 % Current number of processed clauses : 3
% 0.25/0.26 % Positive orientable unit clauses : 2
% 0.25/0.26 % Positive unorientable unit clauses: 0
% 0.25/0.26 % Negative unit clauses : 1
% 0.25/0.26 % Non-unit-clauses : 0
% 0.25/0.26 % Current number of unprocessed clauses: 0
% 0.25/0.26 % ...number of literals in the above : 0
% 0.25/0.26 % Current number of archived formulas : 0
% 0.25/0.26 % Current number of archived clauses : 0
% 0.25/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.25/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.25/0.26 % Non-unit clause-clause subsumptions : 0
% 0.25/0.26 % Unit Clause-clause subsumption calls : 0
% 0.25/0.26 % Rewrite failures with RHS unbound : 0
% 0.25/0.26 % BW rewrite match attempts : 0
% 0.25/0.26 % BW rewrite match successes : 0
% 0.25/0.26 % Condensation attempts : 0
% 0.25/0.26 % Condensation successes : 0
% 0.25/0.26 % Termbank termtop insertions : 455
% 0.25/0.26 % Search garbage collected termcells : 125
% 0.25/0.26
% 0.25/0.26 % -------------------------------------------------
% 0.25/0.26 % User time : 0.003 s
% 0.25/0.26 % System time : 0.001 s
% 0.25/0.26 % Total time : 0.004 s
% 0.25/0.26 % Maximum resident set size: 3588 pages
% 0.25/0.26
% 0.25/0.26 % -------------------------------------------------
% 0.25/0.26 % User time : 0.004 s
% 0.25/0.26 % System time : 0.006 s
% 0.25/0.26 % Total time : 0.010 s
% 0.25/0.26 % Maximum resident set size: 4864 pages
% 0.25/0.26 % E exiting
%------------------------------------------------------------------------------