TSTP Solution File: SEU444+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU444+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n004.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:58:48 EDT 2023
% Result : Theorem 5.15s 2.28s
% Output : CNFRefutation 5.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 33
% Syntax : Number of formulae : 60 ( 16 unt; 28 typ; 0 def)
% Number of atoms : 50 ( 23 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 11 |; 2 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 37 ( 21 >; 16 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 7 con; 0-4 aty)
% Number of variables : 39 (; 39 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ m2_relset_1 > m1_relset_1 > r2_hidden > r1_tarski > m1_subset_1 > v3_relat_1 > v1_xboole_0 > v1_relat_1 > k10_relset_1 > k6_relset_1 > k9_relat_1 > k2_zfmisc_1 > #nlpp > k4_relat_1 > k2_funct_5 > k1_zfmisc_1 > k1_funct_5 > k1_xboole_0 > #skF_11 > #skF_8 > #skF_7 > #skF_5 > #skF_10 > #skF_2 > #skF_3 > #skF_1 > #skF_4 > #skF_9 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(m2_relset_1,type,
m2_relset_1: ( $i * $i * $i ) > $o ).
tff(k1_funct_5,type,
k1_funct_5: $i > $i ).
tff(r2_hidden,type,
r2_hidden: ( $i * $i ) > $o ).
tff(k1_xboole_0,type,
k1_xboole_0: $i ).
tff(v3_relat_1,type,
v3_relat_1: $i > $o ).
tff(k6_relset_1,type,
k6_relset_1: ( $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(r1_tarski,type,
r1_tarski: ( $i * $i ) > $o ).
tff(m1_relset_1,type,
m1_relset_1: ( $i * $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(k9_relat_1,type,
k9_relat_1: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(k1_zfmisc_1,type,
k1_zfmisc_1: $i > $i ).
tff(k2_funct_5,type,
k2_funct_5: $i > $i ).
tff(v1_relat_1,type,
v1_relat_1: $i > $o ).
tff(k2_zfmisc_1,type,
k2_zfmisc_1: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(k10_relset_1,type,
k10_relset_1: ( $i * $i * $i * $i ) > $i ).
tff(v1_xboole_0,type,
v1_xboole_0: $i > $o ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(k4_relat_1,type,
k4_relat_1: $i > $i ).
tff(m1_subset_1,type,
m1_subset_1: ( $i * $i ) > $o ).
tff(f_36,negated_conjecture,
~ ! [A,B,C] :
( m2_relset_1(C,B,A)
=> ( ( k1_funct_5(C) = k10_relset_1(A,B,k6_relset_1(B,A,C),A) )
& ( k10_relset_1(A,B,k6_relset_1(B,A,C),k10_relset_1(B,A,C,B)) = k10_relset_1(A,B,k6_relset_1(B,A,C),k2_funct_5(C)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t56_relset_2) ).
tff(f_202,axiom,
! [A,B,C] :
( m2_relset_1(C,B,A)
=> ( ( k1_funct_5(C) = k10_relset_1(A,B,k6_relset_1(B,A,C),A) )
& ( k2_funct_5(C) = k10_relset_1(B,A,C,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_relset_2) ).
tff(f_184,axiom,
! [A,B,C] :
( m2_relset_1(C,A,B)
<=> m1_relset_1(C,A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
tff(f_180,axiom,
! [A,B,C] :
( m1_relset_1(C,A,B)
=> ( k6_relset_1(A,B,C) = k4_relat_1(C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k6_relset_1) ).
tff(f_192,axiom,
! [A,B,C] :
( m1_relset_1(C,A,B)
=> m2_relset_1(k6_relset_1(A,B,C),B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_relset_1) ).
tff(c_4,plain,
m2_relset_1('#skF_3','#skF_2','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_1352,plain,
! [B_301,A_302,C_303] :
( ( k10_relset_1(B_301,A_302,C_303,B_301) = k2_funct_5(C_303) )
| ~ m2_relset_1(C_303,B_301,A_302) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_1361,plain,
k10_relset_1('#skF_2','#skF_1','#skF_3','#skF_2') = k2_funct_5('#skF_3'),
inference(resolution,[status(thm)],[c_4,c_1352]) ).
tff(c_1188,plain,
! [C_250,A_251,B_252] :
( m1_relset_1(C_250,A_251,B_252)
| ~ m2_relset_1(C_250,A_251,B_252) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_1200,plain,
m1_relset_1('#skF_3','#skF_2','#skF_1'),
inference(resolution,[status(thm)],[c_4,c_1188]) ).
tff(c_1308,plain,
! [A_290,B_291,C_292] :
( ( k6_relset_1(A_290,B_291,C_292) = k4_relat_1(C_292) )
| ~ m1_relset_1(C_292,A_290,B_291) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_1319,plain,
k6_relset_1('#skF_2','#skF_1','#skF_3') = k4_relat_1('#skF_3'),
inference(resolution,[status(thm)],[c_1200,c_1308]) ).
tff(c_338,plain,
! [C_111,A_112,B_113] :
( m1_relset_1(C_111,A_112,B_113)
| ~ m2_relset_1(C_111,A_112,B_113) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_346,plain,
m1_relset_1('#skF_3','#skF_2','#skF_1'),
inference(resolution,[status(thm)],[c_4,c_338]) ).
tff(c_465,plain,
! [A_141,B_142,C_143] :
( ( k6_relset_1(A_141,B_142,C_143) = k4_relat_1(C_143) )
| ~ m1_relset_1(C_143,A_141,B_142) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_476,plain,
k6_relset_1('#skF_2','#skF_1','#skF_3') = k4_relat_1('#skF_3'),
inference(resolution,[status(thm)],[c_346,c_465]) ).
tff(c_591,plain,
! [A_178,B_179,C_180] :
( m2_relset_1(k6_relset_1(A_178,B_179,C_180),B_179,A_178)
| ~ m1_relset_1(C_180,A_178,B_179) ),
inference(cnfTransformation,[status(thm)],[f_192]) ).
tff(c_602,plain,
( m2_relset_1(k4_relat_1('#skF_3'),'#skF_1','#skF_2')
| ~ m1_relset_1('#skF_3','#skF_2','#skF_1') ),
inference(superposition,[status(thm),theory(equality)],[c_476,c_591]) ).
tff(c_607,plain,
m2_relset_1(k4_relat_1('#skF_3'),'#skF_1','#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_346,c_602]) ).
tff(c_114,plain,
! [B_70,A_69,C_71] :
( ( k10_relset_1(B_70,A_69,C_71,B_70) = k2_funct_5(C_71) )
| ~ m2_relset_1(C_71,B_70,A_69) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_616,plain,
k10_relset_1('#skF_1','#skF_2',k4_relat_1('#skF_3'),'#skF_1') = k2_funct_5(k4_relat_1('#skF_3')),
inference(resolution,[status(thm)],[c_607,c_114]) ).
tff(c_2,plain,
( ( k10_relset_1('#skF_1','#skF_2',k6_relset_1('#skF_2','#skF_1','#skF_3'),k10_relset_1('#skF_2','#skF_1','#skF_3','#skF_2')) != k10_relset_1('#skF_1','#skF_2',k6_relset_1('#skF_2','#skF_1','#skF_3'),k2_funct_5('#skF_3')) )
| ( k10_relset_1('#skF_1','#skF_2',k6_relset_1('#skF_2','#skF_1','#skF_3'),'#skF_1') != k1_funct_5('#skF_3') ) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_163,plain,
k10_relset_1('#skF_1','#skF_2',k6_relset_1('#skF_2','#skF_1','#skF_3'),'#skF_1') != k1_funct_5('#skF_3'),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_486,plain,
k10_relset_1('#skF_1','#skF_2',k4_relat_1('#skF_3'),'#skF_1') != k1_funct_5('#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_476,c_163]) ).
tff(c_723,plain,
k2_funct_5(k4_relat_1('#skF_3')) != k1_funct_5('#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_616,c_486]) ).
tff(c_887,plain,
! [A_199,B_200,C_201] :
( ( k10_relset_1(A_199,B_200,k6_relset_1(B_200,A_199,C_201),A_199) = k1_funct_5(C_201) )
| ~ m2_relset_1(C_201,B_200,A_199) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_914,plain,
( ( k10_relset_1('#skF_1','#skF_2',k4_relat_1('#skF_3'),'#skF_1') = k1_funct_5('#skF_3') )
| ~ m2_relset_1('#skF_3','#skF_2','#skF_1') ),
inference(superposition,[status(thm),theory(equality)],[c_476,c_887]) ).
tff(c_920,plain,
k2_funct_5(k4_relat_1('#skF_3')) = k1_funct_5('#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_616,c_914]) ).
tff(c_922,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_723,c_920]) ).
tff(c_923,plain,
k10_relset_1('#skF_1','#skF_2',k6_relset_1('#skF_2','#skF_1','#skF_3'),k10_relset_1('#skF_2','#skF_1','#skF_3','#skF_2')) != k10_relset_1('#skF_1','#skF_2',k6_relset_1('#skF_2','#skF_1','#skF_3'),k2_funct_5('#skF_3')),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_1337,plain,
k10_relset_1('#skF_1','#skF_2',k4_relat_1('#skF_3'),k10_relset_1('#skF_2','#skF_1','#skF_3','#skF_2')) != k10_relset_1('#skF_1','#skF_2',k4_relat_1('#skF_3'),k2_funct_5('#skF_3')),
inference(demodulation,[status(thm),theory(equality)],[c_1319,c_1319,c_923]) ).
tff(c_1375,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1361,c_1337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.16 % Problem : SEU444+1 : TPTP v8.1.2. Released v3.4.0.
% 0.16/0.17 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.37 % Computer : n004.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 12:04:11 EDT 2023
% 0.16/0.37 % CPUTime :
% 5.15/2.28 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.15/2.28
% 5.15/2.28 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.55/2.31
% 5.55/2.31 Inference rules
% 5.55/2.31 ----------------------
% 5.55/2.31 #Ref : 0
% 5.55/2.31 #Sup : 293
% 5.55/2.31 #Fact : 0
% 5.55/2.31 #Define : 0
% 5.55/2.31 #Split : 7
% 5.55/2.31 #Chain : 0
% 5.55/2.31 #Close : 0
% 5.55/2.31
% 5.55/2.31 Ordering : KBO
% 5.55/2.31
% 5.55/2.31 Simplification rules
% 5.55/2.31 ----------------------
% 5.55/2.31 #Subsume : 29
% 5.55/2.31 #Demod : 111
% 5.55/2.31 #Tautology : 138
% 5.55/2.31 #SimpNegUnit : 1
% 5.55/2.31 #BackRed : 12
% 5.55/2.31
% 5.55/2.31 #Partial instantiations: 0
% 5.55/2.31 #Strategies tried : 1
% 5.55/2.31
% 5.55/2.31 Timing (in seconds)
% 5.55/2.31 ----------------------
% 5.55/2.32 Preprocessing : 0.63
% 5.55/2.32 Parsing : 0.36
% 5.55/2.32 CNF conversion : 0.04
% 5.55/2.32 Main loop : 0.61
% 5.55/2.32 Inferencing : 0.23
% 5.55/2.32 Reduction : 0.18
% 5.55/2.32 Demodulation : 0.12
% 5.55/2.32 BG Simplification : 0.03
% 5.55/2.32 Subsumption : 0.11
% 5.55/2.32 Abstraction : 0.02
% 5.55/2.32 MUC search : 0.00
% 5.55/2.32 Cooper : 0.00
% 5.55/2.32 Total : 1.29
% 5.55/2.32 Index Insertion : 0.00
% 5.55/2.32 Index Deletion : 0.00
% 5.55/2.32 Index Matching : 0.00
% 5.55/2.32 BG Taut test : 0.00
%------------------------------------------------------------------------------