TSTP Solution File: CAT033+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : CAT033+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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 : Fri Jul 15 00:07:36 EDT 2022
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 8 unt; 4 nHn; 16 RR)
% Number of literals : 35 ( 0 equ; 19 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
v2_cat_1(skc8),
file('CAT033+1.p',unknown),
[] ).
cnf(2,axiom,
l1_cat_1(skc8),
file('CAT033+1.p',unknown),
[] ).
cnf(14,axiom,
r1_tarski(u,u),
file('CAT033+1.p',unknown),
[] ).
cnf(16,axiom,
m1_subset_1(skc9,u1_cat_1(skc8)),
file('CAT033+1.p',unknown),
[] ).
cnf(34,axiom,
~ m2_cat_1(k20_ens_1(skc8,skc9),skc8,k1_yoneda_1(skc8)),
file('CAT033+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ l1_cat_1(u)
| ~ v2_cat_1(u)
| ~ v1_xboole_0(k17_ens_1(u)) ),
file('CAT033+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ l1_cat_1(u)
| ~ v2_cat_1(u)
| equal(k12_ens_1(k17_ens_1(u)),k1_yoneda_1(u)) ),
file('CAT033+1.p',unknown),
[] ).
cnf(66,axiom,
( ~ l1_cat_1(u)
| ~ v2_cat_1(u)
| ~ m1_subset_1(v,u1_cat_1(u))
| ~ r1_tarski(k17_ens_1(u),w)
| v1_xboole_0(w)
| m2_cat_1(k20_ens_1(u,v),u,k12_ens_1(w)) ),
file('CAT033+1.p',unknown),
[] ).
cnf(86,plain,
( ~ v2_cat_1(skc8)
| equal(k12_ens_1(k17_ens_1(skc8)),k1_yoneda_1(skc8)) ),
inference(res,[status(thm),theory(equality)],[2,56]),
[iquote('0:Res:2.0,56.1')] ).
cnf(93,plain,
( ~ v2_cat_1(skc8)
| ~ v1_xboole_0(k17_ens_1(skc8)) ),
inference(res,[status(thm),theory(equality)],[2,51]),
[iquote('0:Res:2.0,51.1')] ).
cnf(123,plain,
( ~ v2_cat_1(skc8)
| ~ l1_cat_1(skc8)
| ~ r1_tarski(k17_ens_1(skc8),u)
| v1_xboole_0(u)
| m2_cat_1(k20_ens_1(skc8,skc9),skc8,k12_ens_1(u)) ),
inference(res,[status(thm),theory(equality)],[16,66]),
[iquote('0:Res:16.0,66.2')] ).
cnf(129,plain,
~ v1_xboole_0(k17_ens_1(skc8)),
inference(mrr,[status(thm)],[93,1]),
[iquote('0:MRR:93.0,1.0')] ).
cnf(131,plain,
equal(k12_ens_1(k17_ens_1(skc8)),k1_yoneda_1(skc8)),
inference(mrr,[status(thm)],[86,1]),
[iquote('0:MRR:86.0,1.0')] ).
cnf(142,plain,
( ~ r1_tarski(k17_ens_1(skc8),u)
| v1_xboole_0(u)
| m2_cat_1(k20_ens_1(skc8,skc9),skc8,k12_ens_1(u)) ),
inference(mrr,[status(thm)],[123,1,2]),
[iquote('0:MRR:123.0,123.1,1.0,2.0')] ).
cnf(352,plain,
( ~ r1_tarski(k17_ens_1(skc8),k17_ens_1(skc8))
| v1_xboole_0(k17_ens_1(skc8))
| m2_cat_1(k20_ens_1(skc8,skc9),skc8,k1_yoneda_1(skc8)) ),
inference(spr,[status(thm),theory(equality)],[131,142]),
[iquote('0:SpR:131.0,142.2')] ).
cnf(356,plain,
$false,
inference(mrr,[status(thm)],[352,14,129,34]),
[iquote('0:MRR:352.0,352.1,352.2,14.0,129.0,34.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CAT033+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n018.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:52:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48
% 0.18/0.48 SPASS V 3.9
% 0.18/0.48 SPASS beiseite: Proof found.
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 SPASS derived 229 clauses, backtracked 0 clauses, performed 0 splits and kept 191 clauses.
% 0.18/0.48 SPASS allocated 97945 KBytes.
% 0.18/0.48 SPASS spent 0:00:00.14 on the problem.
% 0.18/0.48 0:00:00.03 for the input.
% 0.18/0.48 0:00:00.06 for the FLOTTER CNF translation.
% 0.18/0.48 0:00:00.00 for inferences.
% 0.18/0.48 0:00:00.00 for the backtracking.
% 0.18/0.48 0:00:00.02 for the reduction.
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Here is a proof with depth 2, length 16 :
% 0.18/0.48 % SZS output start Refutation
% See solution above
% 0.18/0.48 Formulae used in the proof : t2_yoneda_1 reflexivity_r1_tarski fc5_ens_1 d1_yoneda_1 t49_ens_1
% 0.18/0.48
%------------------------------------------------------------------------------