TSTP Solution File: CAT033+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CAT033+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 : 600s
% DateTime : Thu Jul 14 23:59:01 EDT 2022
% Result : Theorem 8.22s 2.34s
% Output : CNFRefutation 8.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 12 unt; 4 nHn; 18 RR)
% Number of literals : 41 ( 2 equ; 21 neg)
% Maximal clause size : 6 ( 2 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 : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_84,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) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5mawjx2t/input.p',i_0_84) ).
cnf(i_0_2,negated_conjecture,
m1_subset_1(esk2_0,u1_cat_1(esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5mawjx2t/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
l1_cat_1(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5mawjx2t/input.p',i_0_3) ).
cnf(i_0_4,negated_conjecture,
v2_cat_1(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5mawjx2t/input.p',i_0_4) ).
cnf(i_0_55,plain,
r1_tarski(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5mawjx2t/input.p',i_0_55) ).
cnf(i_0_83,plain,
( k1_yoneda_1(X1) = k12_ens_1(k17_ens_1(X1))
| ~ v2_cat_1(X1)
| ~ l1_cat_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5mawjx2t/input.p',i_0_83) ).
cnf(i_0_1,negated_conjecture,
~ m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k1_yoneda_1(esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5mawjx2t/input.p',i_0_1) ).
cnf(i_0_75,plain,
( ~ v2_cat_1(X1)
| ~ l1_cat_1(X1)
| ~ v1_xboole_0(k17_ens_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5mawjx2t/input.p',i_0_75) ).
cnf(c_0_93,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) ),
i_0_84 ).
cnf(c_0_94,negated_conjecture,
m1_subset_1(esk2_0,u1_cat_1(esk1_0)),
i_0_2 ).
cnf(c_0_95,negated_conjecture,
l1_cat_1(esk1_0),
i_0_3 ).
cnf(c_0_96,negated_conjecture,
v2_cat_1(esk1_0),
i_0_4 ).
cnf(c_0_97,negated_conjecture,
( m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k12_ens_1(X1))
| v1_xboole_0(X1)
| ~ r1_tarski(k17_ens_1(esk1_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_96])]) ).
cnf(c_0_98,plain,
r1_tarski(X1,X1),
i_0_55 ).
cnf(c_0_99,plain,
( m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k12_ens_1(k17_ens_1(esk1_0)))
| v1_xboole_0(k17_ens_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_100,plain,
( k1_yoneda_1(X1) = k12_ens_1(k17_ens_1(X1))
| ~ v2_cat_1(X1)
| ~ l1_cat_1(X1) ),
i_0_83 ).
cnf(c_0_101,negated_conjecture,
~ m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k1_yoneda_1(esk1_0)),
i_0_1 ).
cnf(c_0_102,plain,
( ~ v2_cat_1(X1)
| ~ l1_cat_1(X1)
| ~ v1_xboole_0(k17_ens_1(X1)) ),
i_0_75 ).
cnf(c_0_103,plain,
v1_xboole_0(k17_ens_1(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_95]),c_0_96])]),c_0_101]) ).
cnf(c_0_104,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_95]),c_0_96])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CAT033+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun May 29 23:55:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.22/2.34 # ENIGMATIC: Solved by autoschedule:
% 8.22/2.34 # No SInE strategy applied
% 8.22/2.34 # Trying AutoSched0 for 150 seconds
% 8.22/2.34 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 8.22/2.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.22/2.34 #
% 8.22/2.34 # Preprocessing time : 0.013 s
% 8.22/2.34 # Presaturation interreduction done
% 8.22/2.34
% 8.22/2.34 # Proof found!
% 8.22/2.34 # SZS status Theorem
% 8.22/2.34 # SZS output start CNFRefutation
% See solution above
% 8.22/2.34 # Training examples: 0 positive, 0 negative
% 8.22/2.34
% 8.22/2.34 # -------------------------------------------------
% 8.22/2.34 # User time : 0.021 s
% 8.22/2.34 # System time : 0.003 s
% 8.22/2.34 # Total time : 0.024 s
% 8.22/2.34 # Maximum resident set size: 7116 pages
% 8.22/2.34
%------------------------------------------------------------------------------