TSTP Solution File: SEU160+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU160+1 : TPTP v8.1.2. Released v3.3.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 : n001.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:50 EDT 2023
% Result : Theorem 2.75s 1.73s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 33 unt; 10 typ; 0 def)
% Number of atoms : 70 ( 38 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 18 ~; 20 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > empty > #nlpp > singleton > empty_set > #skF_5 > #skF_6 > #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(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $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(f_33,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_42,negated_conjecture,
~ ! [A,B] :
( subset(A,singleton(B))
<=> ( ( A = empty_set )
| ( A = singleton(B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_zfmisc_1) ).
tff(f_48,axiom,
! [A,B] :
( subset(A,singleton(B))
<=> ( ( A = empty_set )
| ( A = singleton(B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
tff(c_6,plain,
! [A_1] : subset(A_1,A_1),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_18,plain,
( ~ subset('#skF_3',singleton('#skF_4'))
| ( empty_set != '#skF_5' ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_34,plain,
empty_set != '#skF_5',
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_14,plain,
( ~ subset('#skF_3',singleton('#skF_4'))
| ( singleton('#skF_6') != '#skF_5' ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_35,plain,
singleton('#skF_6') != '#skF_5',
inference(splitLeft,[status(thm)],[c_14]) ).
tff(c_24,plain,
( ( singleton('#skF_4') = '#skF_3' )
| ( empty_set = '#skF_3' )
| subset('#skF_5',singleton('#skF_6')) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_49,plain,
subset('#skF_5',singleton('#skF_6')),
inference(splitLeft,[status(thm)],[c_24]) ).
tff(c_26,plain,
! [B_4,A_3] :
( ( singleton(B_4) = A_3 )
| ( empty_set = A_3 )
| ~ subset(A_3,singleton(B_4)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_52,plain,
( ( singleton('#skF_6') = '#skF_5' )
| ( empty_set = '#skF_5' ) ),
inference(resolution,[status(thm)],[c_49,c_26]) ).
tff(c_56,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_34,c_35,c_52]) ).
tff(c_57,plain,
( ( empty_set = '#skF_3' )
| ( singleton('#skF_4') = '#skF_3' ) ),
inference(splitRight,[status(thm)],[c_24]) ).
tff(c_59,plain,
singleton('#skF_4') = '#skF_3',
inference(splitLeft,[status(thm)],[c_57]) ).
tff(c_22,plain,
( ~ subset('#skF_3',singleton('#skF_4'))
| subset('#skF_5',singleton('#skF_6')) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_36,plain,
~ subset('#skF_3',singleton('#skF_4')),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_60,plain,
~ subset('#skF_3','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_59,c_36]) ).
tff(c_63,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_60]) ).
tff(c_64,plain,
empty_set = '#skF_3',
inference(splitRight,[status(thm)],[c_57]) ).
tff(c_30,plain,
! [B_4] : subset(empty_set,singleton(B_4)),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_68,plain,
! [B_4] : subset('#skF_3',singleton(B_4)),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_30]) ).
tff(c_76,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_68,c_36]) ).
tff(c_77,plain,
subset('#skF_5',singleton('#skF_6')),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_80,plain,
! [B_9,A_10] :
( ( singleton(B_9) = A_10 )
| ( empty_set = A_10 )
| ~ subset(A_10,singleton(B_9)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_86,plain,
( ( singleton('#skF_6') = '#skF_5' )
| ( empty_set = '#skF_5' ) ),
inference(resolution,[status(thm)],[c_77,c_80]) ).
tff(c_98,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_34,c_35,c_86]) ).
tff(c_100,plain,
singleton('#skF_6') = '#skF_5',
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_16,plain,
( ( singleton('#skF_4') = '#skF_3' )
| ( empty_set = '#skF_3' )
| ( singleton('#skF_6') != '#skF_5' ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_109,plain,
( ( singleton('#skF_4') = '#skF_3' )
| ( empty_set = '#skF_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_100,c_16]) ).
tff(c_110,plain,
empty_set = '#skF_3',
inference(splitLeft,[status(thm)],[c_109]) ).
tff(c_113,plain,
! [B_4] : subset('#skF_3',singleton(B_4)),
inference(demodulation,[status(thm),theory(equality)],[c_110,c_30]) ).
tff(c_99,plain,
~ subset('#skF_3',singleton('#skF_4')),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_122,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_113,c_99]) ).
tff(c_123,plain,
singleton('#skF_4') = '#skF_3',
inference(splitRight,[status(thm)],[c_109]) ).
tff(c_125,plain,
~ subset('#skF_3','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_123,c_99]) ).
tff(c_128,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_125]) ).
tff(c_130,plain,
empty_set = '#skF_5',
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_20,plain,
( ( singleton('#skF_4') = '#skF_3' )
| ( empty_set = '#skF_3' )
| ( empty_set != '#skF_5' ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_139,plain,
( ( singleton('#skF_4') = '#skF_3' )
| ( '#skF_5' = '#skF_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_130,c_130,c_20]) ).
tff(c_140,plain,
'#skF_5' = '#skF_3',
inference(splitLeft,[status(thm)],[c_139]) ).
tff(c_131,plain,
! [B_4] : subset('#skF_5',singleton(B_4)),
inference(demodulation,[status(thm),theory(equality)],[c_130,c_30]) ).
tff(c_141,plain,
! [B_4] : subset('#skF_3',singleton(B_4)),
inference(demodulation,[status(thm),theory(equality)],[c_140,c_131]) ).
tff(c_129,plain,
~ subset('#skF_3',singleton('#skF_4')),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_155,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_141,c_129]) ).
tff(c_156,plain,
singleton('#skF_4') = '#skF_3',
inference(splitRight,[status(thm)],[c_139]) ).
tff(c_158,plain,
~ subset('#skF_3','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_156,c_129]) ).
tff(c_161,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU160+1 : TPTP v8.1.2. Released v3.3.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.14/0.35 % Computer : n001.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 12:33:40 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.75/1.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.01/1.74
% 3.01/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.01/1.77
% 3.01/1.77 Inference rules
% 3.01/1.77 ----------------------
% 3.01/1.77 #Ref : 0
% 3.01/1.77 #Sup : 20
% 3.01/1.77 #Fact : 0
% 3.01/1.77 #Define : 0
% 3.01/1.77 #Split : 7
% 3.01/1.77 #Chain : 0
% 3.01/1.77 #Close : 0
% 3.01/1.77
% 3.01/1.77 Ordering : KBO
% 3.01/1.77
% 3.01/1.77 Simplification rules
% 3.01/1.77 ----------------------
% 3.01/1.77 #Subsume : 6
% 3.01/1.77 #Demod : 33
% 3.01/1.77 #Tautology : 19
% 3.01/1.77 #SimpNegUnit : 2
% 3.01/1.77 #BackRed : 19
% 3.01/1.77
% 3.01/1.77 #Partial instantiations: 0
% 3.01/1.77 #Strategies tried : 1
% 3.01/1.77
% 3.01/1.77 Timing (in seconds)
% 3.01/1.77 ----------------------
% 3.01/1.77 Preprocessing : 0.48
% 3.01/1.77 Parsing : 0.24
% 3.01/1.77 CNF conversion : 0.03
% 3.01/1.77 Main loop : 0.23
% 3.01/1.77 Inferencing : 0.07
% 3.01/1.77 Reduction : 0.07
% 3.01/1.77 Demodulation : 0.05
% 3.01/1.77 BG Simplification : 0.02
% 3.01/1.77 Subsumption : 0.05
% 3.01/1.77 Abstraction : 0.01
% 3.01/1.77 MUC search : 0.00
% 3.01/1.77 Cooper : 0.00
% 3.01/1.77 Total : 0.76
% 3.01/1.77 Index Insertion : 0.00
% 3.01/1.77 Index Deletion : 0.00
% 3.01/1.77 Index Matching : 0.00
% 3.01/1.78 BG Taut test : 0.00
%------------------------------------------------------------------------------