TSTP Solution File: SET903+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET903+1 : TPTP v8.1.2. Released v3.2.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 : n023.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:18 EDT 2023
% Result : Theorem 3.16s 1.80s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 9 unt; 9 typ; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 37 ( 18 ~; 10 |; 9 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ empty > set_union2 > #nlpp > singleton > empty_set > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(f_79,negated_conjecture,
~ ! [A,B,C] :
~ ( ( singleton(A) = set_union2(B,C) )
& ( B != C )
& ( B != empty_set )
& ( C != empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_zfmisc_1) ).
tff(f_66,axiom,
! [A,B,C] :
~ ( ( singleton(A) = set_union2(B,C) )
& ~ ( ( B = singleton(A) )
& ( C = singleton(A) ) )
& ~ ( ( B = empty_set )
& ( C = singleton(A) ) )
& ~ ( ( B = singleton(A) )
& ( C = empty_set ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t43_zfmisc_1) ).
tff(c_36,plain,
'#skF_5' != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_34,plain,
empty_set != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_38,plain,
set_union2('#skF_4','#skF_5') = singleton('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_112,plain,
! [B_19,A_20,C_21] :
( ( empty_set = B_19 )
| ( singleton(A_20) = B_19 )
| ( singleton(A_20) != set_union2(B_19,C_21) ) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_121,plain,
! [A_20] :
( ( empty_set = '#skF_4' )
| ( singleton(A_20) = '#skF_4' )
| ( singleton(A_20) != singleton('#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_112]) ).
tff(c_125,plain,
! [A_20] :
( ( singleton(A_20) = '#skF_4' )
| ( singleton(A_20) != singleton('#skF_3') ) ),
inference(negUnitSimplification,[status(thm)],[c_34,c_121]) ).
tff(c_128,plain,
singleton('#skF_3') = '#skF_4',
inference(reflexivity,[status(thm),theory(equality)],[c_125]) ).
tff(c_32,plain,
empty_set != '#skF_5',
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_132,plain,
set_union2('#skF_4','#skF_5') = '#skF_4',
inference(demodulation,[status(thm),theory(equality)],[c_128,c_38]) ).
tff(c_152,plain,
! [A_23,C_24,B_25] :
( ( singleton(A_23) = C_24 )
| ( empty_set = C_24 )
| ( singleton(A_23) != set_union2(B_25,C_24) ) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_155,plain,
! [A_23] :
( ( singleton(A_23) = '#skF_5' )
| ( empty_set = '#skF_5' )
| ( singleton(A_23) != '#skF_4' ) ),
inference(superposition,[status(thm),theory(equality)],[c_132,c_152]) ).
tff(c_166,plain,
! [A_26] :
( ( singleton(A_26) = '#skF_5' )
| ( singleton(A_26) != '#skF_4' ) ),
inference(negUnitSimplification,[status(thm)],[c_32,c_155]) ).
tff(c_169,plain,
singleton('#skF_3') = '#skF_5',
inference(superposition,[status(thm),theory(equality)],[c_128,c_166]) ).
tff(c_171,plain,
'#skF_5' = '#skF_4',
inference(demodulation,[status(thm),theory(equality)],[c_128,c_169]) ).
tff(c_173,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET903+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/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.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 16:26:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.16/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.16/1.80
% 3.16/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.16/1.83
% 3.16/1.83 Inference rules
% 3.16/1.83 ----------------------
% 3.16/1.83 #Ref : 1
% 3.16/1.83 #Sup : 36
% 3.16/1.83 #Fact : 0
% 3.16/1.83 #Define : 0
% 3.16/1.83 #Split : 1
% 3.16/1.83 #Chain : 0
% 3.16/1.83 #Close : 0
% 3.16/1.83
% 3.16/1.83 Ordering : KBO
% 3.16/1.83
% 3.16/1.83 Simplification rules
% 3.16/1.83 ----------------------
% 3.16/1.83 #Subsume : 14
% 3.16/1.83 #Demod : 4
% 3.16/1.83 #Tautology : 22
% 3.16/1.83 #SimpNegUnit : 5
% 3.16/1.83 #BackRed : 2
% 3.16/1.83
% 3.16/1.83 #Partial instantiations: 0
% 3.16/1.83 #Strategies tried : 1
% 3.16/1.83
% 3.16/1.83 Timing (in seconds)
% 3.16/1.83 ----------------------
% 3.16/1.83 Preprocessing : 0.50
% 3.16/1.83 Parsing : 0.27
% 3.16/1.83 CNF conversion : 0.03
% 3.16/1.83 Main loop : 0.25
% 3.16/1.83 Inferencing : 0.09
% 3.16/1.83 Reduction : 0.07
% 3.16/1.83 Demodulation : 0.05
% 3.16/1.83 BG Simplification : 0.02
% 3.16/1.83 Subsumption : 0.05
% 3.16/1.83 Abstraction : 0.01
% 3.16/1.83 MUC search : 0.00
% 3.16/1.83 Cooper : 0.00
% 3.16/1.83 Total : 0.79
% 3.16/1.83 Index Insertion : 0.00
% 3.16/1.83 Index Deletion : 0.00
% 3.16/1.83 Index Matching : 0.00
% 3.16/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------