%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CAT033+2 : TPTP v9.2.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:11:48 PM UTC 2026
% Result : Theorem 33.20s 20.36s
% Output : CNFRefutation 33.30s
% 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] :
( ( v2_cat_1(X2)
& l1_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] :
( ( v2_cat_1(X1)
& l1_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] :
( ( v2_cat_1(X1)
& l1_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] :
( ( v2_cat_1(X1)
& l1_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] :
( ( v2_cat_1(X2)
& l1_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] :
( ( v2_cat_1(X1)
& l1_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] :
( ( v2_cat_1(X1)
& l1_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,
! [X1574,X1575,X1576] :
( v1_xboole_0(X1574)
| ~ v2_cat_1(X1575)
| ~ l1_cat_1(X1575)
| ~ m1_subset_1(X1576,u1_cat_1(X1575))
| ~ r1_tarski(k17_ens_1(X1575),X1574)
| m2_cat_1(k20_ens_1(X1575,X1576),X1575,k12_ens_1(X1574)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X1563] :
( ~ v2_cat_1(X1563)
| ~ l1_cat_1(X1563)
| k1_yoneda_1(X1563) = k12_ens_1(k17_ens_1(X1563)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_yoneda_1])]) ).
fof(c_0_10,plain,
! [X1682] :
( ~ v2_cat_1(X1682)
| ~ l1_cat_1(X1682)
| ~ v1_xboole_0(k17_ens_1(X1682)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_11,negated_conjecture,
( v2_cat_1(esk1_0)
& l1_cat_1(esk1_0)
& m1_subset_1(esk2_0,u1_cat_1(esk1_0))
& ~ m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k1_yoneda_1(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( v1_xboole_0(X1)
| m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1))
| ~ v2_cat_1(X2)
| ~ l1_cat_1(X2)
| ~ m1_subset_1(X3,u1_cat_1(X2))
| ~ r1_tarski(k17_ens_1(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( k1_yoneda_1(X1) = k12_ens_1(k17_ens_1(X1))
| ~ v2_cat_1(X1)
| ~ l1_cat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ v2_cat_1(X1)
| ~ l1_cat_1(X1)
| ~ v1_xboole_0(k17_ens_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X2259] : r1_tarski(X2259,X2259),
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,
( m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X3))
| ~ v2_cat_1(X1)
| ~ v2_cat_1(X3)
| ~ l1_cat_1(X1)
| ~ l1_cat_1(X3)
| ~ m1_subset_1(X2,u1_cat_1(X1))
| ~ r1_tarski(k17_ens_1(X1),k17_ens_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.12 % Problem : CAT033+2 : TPTP v9.2.1. Released v3.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n022.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 10:50:21 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 33.20/20.36 % Version : CSE_E---1.7
% 33.20/20.36 % Problem : theBenchmark.p
% 33.20/20.36 % SZS status Theorem for theBenchmark.p
% 33.20/20.36 % SZS output start CNFRefutation
% See solution above
% 33.30/20.49 % Total time : 15.646s
%------------------------------------------------------------------------------