TSTP Solution File: CAT033+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT033+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n009.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 Aug 22 10:34:44 EDT 2023
% Result : Theorem 6.46s 2.45s
% Output : CNFRefutation 6.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 46
% Syntax : Number of formulae : 59 ( 8 unt; 41 typ; 0 def)
% Number of atoms : 51 ( 2 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 58 ( 25 ~; 21 |; 4 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 53 ( 32 >; 21 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 27 ( 27 usr; 9 con; 0-6 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ v1_funct_2 > m2_relset_1 > m2_cat_1 > m1_relset_1 > r2_hidden > r1_tarski > m1_subset_1 > v2_funct_1 > v2_cat_1 > v1_xboole_0 > v1_relat_1 > v1_funct_1 > v1_cat_1 > l1_cat_1 > g1_cat_1 > k2_zfmisc_1 > k20_ens_1 > #nlpp > u6_cat_1 > u5_cat_1 > u4_cat_1 > u3_cat_1 > u2_cat_1 > u1_cat_1 > k2_ens_1 > k1_zfmisc_1 > k1_yoneda_1 > k17_ens_1 > k12_ens_1 > k1_xboole_0 > #skF_9 > #skF_6 > #skF_11 > #skF_5 > #skF_2 > #skF_10 > #skF_3 > #skF_1 > #skF_8 > #skF_4 > #skF_7 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff(m2_relset_1,type,
m2_relset_1: ( $i * $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(v1_funct_1,type,
v1_funct_1: $i > $o ).
tff(v2_funct_1,type,
v2_funct_1: $i > $o ).
tff(r2_hidden,type,
r2_hidden: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(u2_cat_1,type,
u2_cat_1: $i > $i ).
tff(k1_yoneda_1,type,
k1_yoneda_1: $i > $i ).
tff(k1_xboole_0,type,
k1_xboole_0: $i ).
tff(k2_ens_1,type,
k2_ens_1: $i > $i ).
tff(r1_tarski,type,
r1_tarski: ( $i * $i ) > $o ).
tff(m1_relset_1,type,
m1_relset_1: ( $i * $i * $i ) > $o ).
tff(g1_cat_1,type,
g1_cat_1: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(u1_cat_1,type,
u1_cat_1: $i > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(v1_funct_2,type,
v1_funct_2: ( $i * $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(u5_cat_1,type,
u5_cat_1: $i > $i ).
tff(k1_zfmisc_1,type,
k1_zfmisc_1: $i > $i ).
tff(u4_cat_1,type,
u4_cat_1: $i > $i ).
tff(u3_cat_1,type,
u3_cat_1: $i > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(k20_ens_1,type,
k20_ens_1: ( $i * $i ) > $i ).
tff(m2_cat_1,type,
m2_cat_1: ( $i * $i * $i ) > $o ).
tff(v1_relat_1,type,
v1_relat_1: $i > $o ).
tff(k2_zfmisc_1,type,
k2_zfmisc_1: ( $i * $i ) > $i ).
tff(l1_cat_1,type,
l1_cat_1: $i > $o ).
tff(u6_cat_1,type,
u6_cat_1: $i > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(k12_ens_1,type,
k12_ens_1: $i > $i ).
tff(v1_cat_1,type,
v1_cat_1: $i > $o ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff(k17_ens_1,type,
k17_ens_1: $i > $i ).
tff(v1_xboole_0,type,
v1_xboole_0: $i > $o ).
tff(v2_cat_1,type,
v2_cat_1: $i > $o ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(m1_subset_1,type,
m1_subset_1: ( $i * $i ) > $o ).
tff(f_39,negated_conjecture,
~ ! [A] :
( ( v2_cat_1(A)
& l1_cat_1(A) )
=> ! [B] :
( m1_subset_1(B,u1_cat_1(A))
=> m2_cat_1(k20_ens_1(A,B),A,k1_yoneda_1(A)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_yoneda_1) ).
tff(f_241,axiom,
! [A,B] : r1_tarski(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_352,axiom,
! [A] :
( ( v2_cat_1(A)
& l1_cat_1(A) )
=> ( k1_yoneda_1(A) = k12_ens_1(k17_ens_1(A)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_yoneda_1) ).
tff(f_367,axiom,
! [A] :
( ~ v1_xboole_0(A)
=> ! [B] :
( ( v2_cat_1(B)
& l1_cat_1(B) )
=> ! [C] :
( m1_subset_1(C,u1_cat_1(B))
=> ( r1_tarski(k17_ens_1(B),A)
=> m2_cat_1(k20_ens_1(B,C),B,k12_ens_1(A)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t49_ens_1) ).
tff(f_322,axiom,
! [A] :
( ( v2_cat_1(A)
& l1_cat_1(A) )
=> ~ v1_xboole_0(k17_ens_1(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc5_ens_1) ).
tff(c_8,plain,
v2_cat_1('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_6,plain,
l1_cat_1('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_4,plain,
m1_subset_1('#skF_2',u1_cat_1('#skF_1')),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_110,plain,
! [A_61] : r1_tarski(A_61,A_61),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_166,plain,
! [A_87] :
( ( k12_ens_1(k17_ens_1(A_87)) = k1_yoneda_1(A_87) )
| ~ l1_cat_1(A_87)
| ~ v2_cat_1(A_87) ),
inference(cnfTransformation,[status(thm)],[f_352]) ).
tff(c_811,plain,
! [B_252,C_253,A_254] :
( m2_cat_1(k20_ens_1(B_252,C_253),B_252,k12_ens_1(A_254))
| ~ r1_tarski(k17_ens_1(B_252),A_254)
| ~ m1_subset_1(C_253,u1_cat_1(B_252))
| ~ l1_cat_1(B_252)
| ~ v2_cat_1(B_252)
| v1_xboole_0(A_254) ),
inference(cnfTransformation,[status(thm)],[f_367]) ).
tff(c_1473,plain,
! [B_422,C_423,A_424] :
( m2_cat_1(k20_ens_1(B_422,C_423),B_422,k1_yoneda_1(A_424))
| ~ r1_tarski(k17_ens_1(B_422),k17_ens_1(A_424))
| ~ m1_subset_1(C_423,u1_cat_1(B_422))
| ~ l1_cat_1(B_422)
| ~ v2_cat_1(B_422)
| v1_xboole_0(k17_ens_1(A_424))
| ~ l1_cat_1(A_424)
| ~ v2_cat_1(A_424) ),
inference(superposition,[status(thm),theory(equality)],[c_166,c_811]) ).
tff(c_2,plain,
~ m2_cat_1(k20_ens_1('#skF_1','#skF_2'),'#skF_1',k1_yoneda_1('#skF_1')),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_1482,plain,
( ~ r1_tarski(k17_ens_1('#skF_1'),k17_ens_1('#skF_1'))
| ~ m1_subset_1('#skF_2',u1_cat_1('#skF_1'))
| v1_xboole_0(k17_ens_1('#skF_1'))
| ~ l1_cat_1('#skF_1')
| ~ v2_cat_1('#skF_1') ),
inference(resolution,[status(thm)],[c_1473,c_2]) ).
tff(c_1487,plain,
v1_xboole_0(k17_ens_1('#skF_1')),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6,c_4,c_110,c_1482]) ).
tff(c_150,plain,
! [A_79] :
( ~ v1_xboole_0(k17_ens_1(A_79))
| ~ l1_cat_1(A_79)
| ~ v2_cat_1(A_79) ),
inference(cnfTransformation,[status(thm)],[f_322]) ).
tff(c_1492,plain,
( ~ l1_cat_1('#skF_1')
| ~ v2_cat_1('#skF_1') ),
inference(resolution,[status(thm)],[c_1487,c_150]) ).
tff(c_1505,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6,c_1492]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CAT033+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.17/0.35 % Computer : n009.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 17:46:53 EDT 2023
% 0.17/0.35 % CPUTime :
% 6.46/2.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.46/2.45
% 6.46/2.45 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.73/2.48
% 6.73/2.48 Inference rules
% 6.73/2.48 ----------------------
% 6.73/2.48 #Ref : 6
% 6.73/2.48 #Sup : 306
% 6.73/2.48 #Fact : 0
% 6.73/2.48 #Define : 0
% 6.73/2.48 #Split : 4
% 6.73/2.48 #Chain : 0
% 6.73/2.48 #Close : 0
% 6.73/2.48
% 6.73/2.48 Ordering : KBO
% 6.73/2.48
% 6.73/2.48 Simplification rules
% 6.73/2.48 ----------------------
% 6.73/2.48 #Subsume : 130
% 6.73/2.48 #Demod : 33
% 6.73/2.48 #Tautology : 50
% 6.73/2.48 #SimpNegUnit : 35
% 6.73/2.48 #BackRed : 13
% 6.73/2.48
% 6.73/2.48 #Partial instantiations: 0
% 6.73/2.48 #Strategies tried : 1
% 6.73/2.48
% 6.73/2.48 Timing (in seconds)
% 6.73/2.48 ----------------------
% 6.73/2.48 Preprocessing : 0.63
% 6.73/2.48 Parsing : 0.34
% 6.73/2.48 CNF conversion : 0.06
% 6.73/2.48 Main loop : 0.80
% 6.73/2.49 Inferencing : 0.32
% 6.73/2.49 Reduction : 0.21
% 6.73/2.49 Demodulation : 0.15
% 6.73/2.49 BG Simplification : 0.04
% 6.73/2.49 Subsumption : 0.18
% 6.73/2.49 Abstraction : 0.02
% 6.73/2.49 MUC search : 0.00
% 6.73/2.49 Cooper : 0.00
% 6.73/2.49 Total : 1.48
% 6.73/2.49 Index Insertion : 0.00
% 6.73/2.49 Index Deletion : 0.00
% 6.73/2.49 Index Matching : 0.00
% 6.73/2.49 BG Taut test : 0.00
%------------------------------------------------------------------------------