%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT033+1 : 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 0.10s 0.45s
% Output : CNFRefutation 0.10s
% 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/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',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,
! [X21,X22,X23] :
( m2_cat_1(k20_ens_1(X22,X23),X22,k12_ens_1(X21))
| ~ r1_tarski(k17_ens_1(X22),X21)
| ~ m1_subset_1(X23,u1_cat_1(X22))
| ~ l1_cat_1(X22)
| ~ v2_cat_1(X22)
| v1_xboole_0(X21) ),
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,
! [X25] :
( k1_yoneda_1(X25) = k12_ens_1(k17_ens_1(X25))
| ~ l1_cat_1(X25)
| ~ v2_cat_1(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_yoneda_1])])]) ).
fof(c_0_10,plain,
! [X42] :
( ~ v1_xboole_0(k17_ens_1(X42))
| ~ l1_cat_1(X42)
| ~ v2_cat_1(X42) ),
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,
! [X39] : r1_tarski(X39,X39),
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,
( ~ v2_cat_1(X3)
| ~ v2_cat_1(X1)
| ~ l1_cat_1(X3)
| ~ l1_cat_1(X1)
| ~ m1_subset_1(X2,u1_cat_1(X1))
| ~ r1_tarski(k17_ens_1(X1),k17_ens_1(X3))
| 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,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
m1_subset_1(esk2_0,u1_cat_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
l1_cat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
v2_cat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
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.03 % Problem : CAT033+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 13:56:12 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 0.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % new_bool_3 with pid 2487541 completed with status 0
% 0.10/0.45 % Result found by new_bool_3
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSS-FFMS31-SFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 2487546 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSS-FFMS31-SFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % Preprocessing time : 0.002 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 53
% 0.10/0.45 % Removed by relevancy pruning/SinE : 25
% 0.10/0.45 % Initial clauses : 39
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 39
% 0.10/0.45 % Processed clauses : 72
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 9
% 0.10/0.45 % ...remaining for further processing : 63
% 0.10/0.45 % Other redundant clauses eliminated : 0
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 0
% 0.10/0.45 % Backward-rewritten : 0
% 0.10/0.45 % Generated clauses : 42
% 0.10/0.45 % ...of the previous two non-redundant : 39
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 2
% 0.10/0.45 % Paramodulations : 42
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 0
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 5
% 0.10/0.45 % ...of those cached : 0
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 63
% 0.10/0.45 % Positive orientable unit clauses : 12
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 2
% 0.10/0.45 % Non-unit-clauses : 49
% 0.10/0.45 % Current number of unprocessed clauses: 3
% 0.10/0.45 % ...number of literals in the above : 37
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 0
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 1035
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 263
% 0.10/0.45 % Non-unit clause-clause subsumptions : 11
% 0.10/0.45 % Unit Clause-clause subsumption calls : 32
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 0
% 0.10/0.45 % BW rewrite match successes : 0
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 4426
% 0.10/0.45 % Search garbage collected termcells : 666
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.009 s
% 0.10/0.45 % System time : 0.001 s
% 0.10/0.45 % Total time : 0.011 s
% 0.10/0.45 % Maximum resident set size: 3640 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.014 s
% 0.10/0.45 % System time : 0.004 s
% 0.10/0.45 % Total time : 0.018 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------