%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT033+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 : Thu Sep 24 12:08:08 PM UTC 2026
% Result : Theorem 43.70s 11.59s
% Output : CNFRefutation 43.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 72 ( 3 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 80 ( 31 ~; 24 |; 10 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 1 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t49_ens_1,axiom,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( l1_cat_1(X2)
& v2_cat_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_cat_1(X2))
=> ( r1_tarski(k17_ens_1(X2),X1)
=> m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+308.ax',t49_ens_1) ).
fof(fc5_ens_1,axiom,
! [X1] :
( ( l1_cat_1(X1)
& v2_cat_1(X1) )
=> ~ v1_xboole_0(k17_ens_1(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+308.ax',fc5_ens_1) ).
fof(t2_yoneda_1,conjecture,
! [X1] :
( ( l1_cat_1(X1)
& v2_cat_1(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_cat_1(X1))
=> m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_yoneda_1) ).
fof(d1_yoneda_1,axiom,
! [X1] :
( ( l1_cat_1(X1)
& v2_cat_1(X1) )
=> k1_yoneda_1(X1) = k12_ens_1(k17_ens_1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_yoneda_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).
fof(c_0_5,plain,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( l1_cat_1(X2)
& v2_cat_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_cat_1(X2))
=> ( r1_tarski(k17_ens_1(X2),X1)
=> m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1)) ) ) ) ),
inference(fof_simplification,[status(thm)],[t49_ens_1]) ).
fof(c_0_6,plain,
! [X1] :
( ( l1_cat_1(X1)
& v2_cat_1(X1) )
=> ~ v1_xboole_0(k17_ens_1(X1)) ),
inference(fof_simplification,[status(thm)],[fc5_ens_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( l1_cat_1(X1)
& v2_cat_1(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_cat_1(X1))
=> m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X1)) ) ),
inference(assume_negation,[status(cth)],[t2_yoneda_1]) ).
fof(c_0_8,plain,
! [X72,X73,X74] :
( m2_cat_1(k20_ens_1(X73,X74),X73,k12_ens_1(X72))
| ~ r1_tarski(k17_ens_1(X73),X72)
| ~ m1_subset_1(X74,u1_cat_1(X73))
| ~ l1_cat_1(X73)
| ~ v2_cat_1(X73)
| v1_xboole_0(X72) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X61] :
( k1_yoneda_1(X61) = k12_ens_1(k17_ens_1(X61))
| ~ l1_cat_1(X61)
| ~ v2_cat_1(X61) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_yoneda_1])])]) ).
fof(c_0_10,plain,
! [X101] :
( ~ v1_xboole_0(k17_ens_1(X101))
| ~ l1_cat_1(X101)
| ~ v2_cat_1(X101) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,negated_conjecture,
( ~ m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k1_yoneda_1(esk1_0))
& m1_subset_1(esk2_0,u1_cat_1(esk1_0))
& l1_cat_1(esk1_0)
& v2_cat_1(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( ~ r1_tarski(k17_ens_1(X2),X1)
| ~ m1_subset_1(X3,u1_cat_1(X2))
| ~ l1_cat_1(X2)
| ~ v2_cat_1(X2)
| m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1))
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ l1_cat_1(X1)
| ~ v2_cat_1(X1)
| k1_yoneda_1(X1) = k12_ens_1(k17_ens_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ v1_xboole_0(k17_ens_1(X1))
| ~ l1_cat_1(X1)
| ~ v2_cat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X844] : r1_tarski(X844,X844),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_16,negated_conjecture,
~ m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k1_yoneda_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ r1_tarski(k17_ens_1(X1),k17_ens_1(X3))
| ~ m1_subset_1(X2,u1_cat_1(X1))
| ~ l1_cat_1(X3)
| ~ l1_cat_1(X1)
| ~ v2_cat_1(X3)
| ~ v2_cat_1(X1)
| m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
v2_cat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
l1_cat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk2_0,u1_cat_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CAT033+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 % Computer : n017.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Mon Sep 21 13:56:33 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.46 Running first-order theorem proving
% 0.22/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 43.70/11.59 % Version: 3.5.1
% 43.70/11.59 % Preprocessing class: FMLLMLLLSSSNFFN.
% 43.70/11.59 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 43.70/11.59 % Starting new_bool_3 with 894s (3) cores
% 43.70/11.59 % Starting new_bool_1 with 894s (3) cores
% 43.70/11.59 % Starting sh5l with 298s (1) cores
% 43.70/11.59 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 43.70/11.59 % G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 2492110 completed with status 0
% 43.70/11.59 % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 43.70/11.59 % Preprocessing class: FMLLMLLLSSSNFFN.
% 43.70/11.59 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 43.70/11.59 % Starting new_bool_3 with 894s (3) cores
% 43.70/11.59 % Starting new_bool_1 with 894s (3) cores
% 43.70/11.59 % Starting sh5l with 298s (1) cores
% 43.70/11.59 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 43.70/11.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 43.70/11.59 % SinE strategy is gf120_h_gu_R02_F100_L20000
% 43.70/11.59 % Search class: FGHSM-FSLM32-DFFFFFNN
% 43.70/11.59 % Scheduled 13 strats onto 1 cores with 298 seconds (298 total)
% 43.70/11.59 % Starting SubtermCWHack with 27s (1) cores
% 43.70/11.59 % SubtermCWHack with pid 2492111 completed with status 0
% 43.70/11.59 % Result found by SubtermCWHack
% 43.70/11.59 % Preprocessing class: FMLLMLLLSSSNFFN.
% 43.70/11.59 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 43.70/11.59 % Starting new_bool_3 with 894s (3) cores
% 43.70/11.59 % Starting new_bool_1 with 894s (3) cores
% 43.70/11.59 % Starting sh5l with 298s (1) cores
% 43.70/11.59 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 43.70/11.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 43.70/11.59 % SinE strategy is gf120_h_gu_R02_F100_L20000
% 43.70/11.59 % Search class: FGHSM-FSLM32-DFFFFFNN
% 43.70/11.59 % Scheduled 13 strats onto 1 cores with 298 seconds (298 total)
% 43.70/11.59 % Starting SubtermCWHack with 27s (1) cores
% 43.70/11.59 % Preprocessing time : 0.049 s
% 43.70/11.59
% 43.70/11.59 % Proof found!
% 43.70/11.59 % SZS status Theorem
% 43.70/11.59 % SZS output start CNFRefutation
% See solution above
% 43.70/11.59 % Parsed axioms : 42648
% 43.70/11.59 % Removed by relevancy pruning/SinE : 42348
% 43.70/11.59 % Initial clauses : 650
% 43.70/11.59 % Removed in clause preprocessing : 12
% 43.70/11.59 % Initial clauses in saturation : 638
% 43.70/11.59 % Processed clauses : 33770
% 43.70/11.59 % ...of these trivial : 138
% 43.70/11.59 % ...subsumed : 28194
% 43.70/11.59 % ...remaining for further processing : 5438
% 43.70/11.59 % Other redundant clauses eliminated : 370
% 43.70/11.59 % Clauses deleted for lack of memory : 0
% 43.70/11.59 % Backward-subsumed : 394
% 43.70/11.59 % Backward-rewritten : 140
% 43.70/11.59 % Generated clauses : 368904
% 43.70/11.59 % ...of the previous two non-redundant : 311100
% 43.70/11.59 % ...aggressively subsumed : 0
% 43.70/11.59 % Contextual simplify-reflections : 407
% 43.70/11.59 % Paramodulations : 368477
% 43.70/11.59 % Factorizations : 10
% 43.70/11.59 % NegExts : 0
% 43.70/11.59 % Equation resolutions : 391
% 43.70/11.59 % Disequality decompositions : 0
% 43.70/11.59 % Total rewrite steps : 146588
% 43.70/11.59 % ...of those cached : 144569
% 43.70/11.59 % Propositional unsat checks : 0
% 43.70/11.59 % Propositional check models : 0
% 43.70/11.59 % Propositional check unsatisfiable : 0
% 43.70/11.59 % Propositional clauses : 0
% 43.70/11.59 % Propositional clauses after purity: 0
% 43.70/11.59 % Propositional unsat core size : 0
% 43.70/11.59 % Propositional preprocessing time : 0.000
% 43.70/11.59 % Propositional encoding time : 0.000
% 43.70/11.59 % Propositional solver time : 0.000
% 43.70/11.59 % Success case prop preproc time : 0.000
% 43.70/11.59 % Success case prop encoding time : 0.000
% 43.70/11.59 % Success case prop solver time : 0.000
% 43.70/11.59 % Current number of processed clauses : 4825
% 43.70/11.59 % Positive orientable unit clauses : 271
% 43.70/11.59 % Positive unorientable unit clauses: 2
% 43.70/11.59 % Negative unit clauses : 254
% 43.70/11.59 % Non-unit-clauses : 4298
% 43.70/11.59 % Current number of unprocessed clauses: 274985
% 43.70/11.59 % ...number of literals in the above : 1185904
% 43.70/11.59 % Current number of archived formulas : 0
% 43.70/11.59 % Current number of archived clauses : 564
% 43.70/11.59 % Clause-clause subsumption calls (NU) : 5831327
% 43.70/11.59 % Rec. Clause-clause subsumption calls : 3689274
% 43.70/11.59 % Non-unit clause-clause subsumptions : 18789
% 43.70/11.59 % Unit Clause-clause subsumption calls : 66170
% 43.70/11.59 % Rewrite failures with RHS unbound : 0
% 43.70/11.59 % BW rewrite match attempts : 1655
% 43.70/11.59 % BW rewrite match successes : 34
% 43.70/11.59 % Condensation attempts : 0
% 43.70/11.59 % Condensation successes : 0
% 43.70/11.59 % Termbank termtop insertions : 6457019
% 43.70/11.59 % Search garbage collected termcells : 444737
% 43.70/11.59
% 43.70/11.59 % -------------------------------------------------
% 43.70/11.59 % User time : 8.044 s
% 43.70/11.59 % System time : 0.393 s
% 43.70/11.59 % Total time : 8.437 s
% 43.70/11.59 % Maximum resident set size: 87392 pages
% 43.70/11.59
% 43.70/11.59 % -------------------------------------------------
% 43.70/11.59 % User time : 10.382 s
% 43.70/11.59 % System time : 0.528 s
% 43.70/11.59 % Total time : 10.909 s
% 43.70/11.59 % Maximum resident set size: 70656 pages
% 43.70/11.59 % E exiting
%------------------------------------------------------------------------------