TSTP Solution File: SET959+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET959+1 : TPTP v8.1.2. Bugfixed v4.0.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 : n019.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:57:25 EDT 2023
% Result : Theorem 3.68s 1.97s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 42 ( 7 unt; 15 typ; 0 def)
% Number of atoms : 66 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 72 ( 33 ~; 31 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 11 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 33 (; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > unordered_pair > ordered_pair > #nlpp > singleton > #skF_7 > #skF_5 > #skF_8 > #skF_2 > #skF_10 > #skF_3 > #skF_1 > #skF_4 > #skF_9 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff(in,type,
in: ( $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(empty,type,
empty: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(f_68,negated_conjecture,
~ ! [A,B] :
( ( ! [C] :
~ ( in(C,A)
& ! [D,E] : ( C != ordered_pair(D,E) ) )
& ! [C] :
~ ( in(C,B)
& ! [D,E] : ( C != ordered_pair(D,E) ) )
& ! [C,D] :
( in(ordered_pair(C,D),A)
<=> in(ordered_pair(C,D),B) ) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t112_zfmisc_1) ).
tff(f_75,axiom,
! [A,B] :
( ! [C] :
( in(C,A)
<=> in(C,B) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
tff(c_14,plain,
'#skF_3' != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_30,plain,
! [A_29,B_30] :
( in('#skF_9'(A_29,B_30),B_30)
| in('#skF_10'(A_29,B_30),A_29)
| ( B_30 = A_29 ) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_20,plain,
! [C_24] :
( ( ordered_pair('#skF_7'(C_24),'#skF_8'(C_24)) = C_24 )
| ~ in(C_24,'#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_89,plain,
! [C_41,D_42] :
( in(ordered_pair(C_41,D_42),'#skF_3')
| ~ in(ordered_pair(C_41,D_42),'#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_491,plain,
! [C_82] :
( in(C_82,'#skF_3')
| ~ in(ordered_pair('#skF_7'(C_82),'#skF_8'(C_82)),'#skF_4')
| ~ in(C_82,'#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_89]) ).
tff(c_499,plain,
! [C_83] :
( in(C_83,'#skF_3')
| ~ in(C_83,'#skF_4')
| ~ in(C_83,'#skF_4')
| ~ in(C_83,'#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_491]) ).
tff(c_26,plain,
! [A_29,B_30] :
( in('#skF_9'(A_29,B_30),B_30)
| ~ in('#skF_10'(A_29,B_30),B_30)
| ( B_30 = A_29 ) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_550,plain,
! [A_86] :
( in('#skF_9'(A_86,'#skF_3'),'#skF_3')
| ( A_86 = '#skF_3' )
| ~ in('#skF_10'(A_86,'#skF_3'),'#skF_4') ),
inference(resolution,[status(thm)],[c_499,c_26]) ).
tff(c_554,plain,
( in('#skF_9'('#skF_4','#skF_3'),'#skF_3')
| ( '#skF_3' = '#skF_4' ) ),
inference(resolution,[status(thm)],[c_30,c_550]) ).
tff(c_561,plain,
in('#skF_9'('#skF_4','#skF_3'),'#skF_3'),
inference(negUnitSimplification,[status(thm)],[c_14,c_14,c_554]) ).
tff(c_22,plain,
! [C_21] :
( ( ordered_pair('#skF_5'(C_21),'#skF_6'(C_21)) = C_21 )
| ~ in(C_21,'#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_166,plain,
! [C_48,D_49] :
( in(ordered_pair(C_48,D_49),'#skF_4')
| ~ in(ordered_pair(C_48,D_49),'#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_427,plain,
! [C_71] :
( in(ordered_pair('#skF_5'(C_71),'#skF_6'(C_71)),'#skF_4')
| ~ in(C_71,'#skF_3')
| ~ in(C_71,'#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_166]) ).
tff(c_438,plain,
! [C_21] :
( in(C_21,'#skF_4')
| ~ in(C_21,'#skF_3')
| ~ in(C_21,'#skF_3')
| ~ in(C_21,'#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_427]) ).
tff(c_625,plain,
( in('#skF_9'('#skF_4','#skF_3'),'#skF_4')
| ~ in('#skF_9'('#skF_4','#skF_3'),'#skF_3') ),
inference(resolution,[status(thm)],[c_561,c_438]) ).
tff(c_633,plain,
in('#skF_9'('#skF_4','#skF_3'),'#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_561,c_625]) ).
tff(c_28,plain,
! [A_29,B_30] :
( ~ in('#skF_9'(A_29,B_30),A_29)
| in('#skF_10'(A_29,B_30),A_29)
| ( B_30 = A_29 ) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_497,plain,
! [C_24] :
( in(C_24,'#skF_3')
| ~ in(C_24,'#skF_4')
| ~ in(C_24,'#skF_4')
| ~ in(C_24,'#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_491]) ).
tff(c_24,plain,
! [A_29,B_30] :
( ~ in('#skF_9'(A_29,B_30),A_29)
| ~ in('#skF_10'(A_29,B_30),B_30)
| ( B_30 = A_29 ) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_643,plain,
( ~ in('#skF_10'('#skF_4','#skF_3'),'#skF_3')
| ( '#skF_3' = '#skF_4' ) ),
inference(resolution,[status(thm)],[c_633,c_24]) ).
tff(c_656,plain,
~ in('#skF_10'('#skF_4','#skF_3'),'#skF_3'),
inference(negUnitSimplification,[status(thm)],[c_14,c_643]) ).
tff(c_662,plain,
~ in('#skF_10'('#skF_4','#skF_3'),'#skF_4'),
inference(resolution,[status(thm)],[c_497,c_656]) ).
tff(c_668,plain,
( ~ in('#skF_9'('#skF_4','#skF_3'),'#skF_4')
| ( '#skF_3' = '#skF_4' ) ),
inference(resolution,[status(thm)],[c_28,c_662]) ).
tff(c_674,plain,
'#skF_3' = '#skF_4',
inference(demodulation,[status(thm),theory(equality)],[c_633,c_668]) ).
tff(c_676,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_674]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET959+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.14 % 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.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 16:41:16 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.68/1.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.98
% 3.68/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.68/2.00
% 3.68/2.00 Inference rules
% 3.68/2.00 ----------------------
% 3.68/2.00 #Ref : 0
% 3.68/2.00 #Sup : 149
% 3.68/2.00 #Fact : 0
% 3.68/2.00 #Define : 0
% 3.68/2.00 #Split : 2
% 3.68/2.00 #Chain : 0
% 3.68/2.00 #Close : 0
% 3.68/2.00
% 3.68/2.00 Ordering : KBO
% 3.68/2.00
% 3.68/2.00 Simplification rules
% 3.68/2.00 ----------------------
% 3.68/2.00 #Subsume : 15
% 3.68/2.00 #Demod : 28
% 3.68/2.00 #Tautology : 54
% 3.68/2.00 #SimpNegUnit : 11
% 3.68/2.00 #BackRed : 0
% 3.68/2.00
% 3.68/2.00 #Partial instantiations: 0
% 3.68/2.00 #Strategies tried : 1
% 3.68/2.00
% 3.68/2.01 Timing (in seconds)
% 3.68/2.01 ----------------------
% 4.04/2.01 Preprocessing : 0.47
% 4.04/2.01 Parsing : 0.24
% 4.04/2.01 CNF conversion : 0.04
% 4.04/2.01 Main loop : 0.48
% 4.04/2.01 Inferencing : 0.19
% 4.04/2.01 Reduction : 0.13
% 4.04/2.01 Demodulation : 0.09
% 4.04/2.01 BG Simplification : 0.02
% 4.04/2.01 Subsumption : 0.11
% 4.04/2.01 Abstraction : 0.02
% 4.04/2.01 MUC search : 0.00
% 4.04/2.01 Cooper : 0.00
% 4.04/2.01 Total : 1.00
% 4.04/2.01 Index Insertion : 0.00
% 4.04/2.01 Index Deletion : 0.00
% 4.04/2.01 Index Matching : 0.00
% 4.04/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------