TSTP Solution File: SEU126+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU126+2 : 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/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 : n024.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:40 EDT 2023
% Result : Theorem 6.38s 2.52s
% Output : CNFRefutation 6.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 25
% Syntax : Number of formulae : 40 ( 11 unt; 19 typ; 0 def)
% Number of atoms : 36 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 12 ~; 10 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 14 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_union2 > set_intersection2 > #nlpp > empty_set > #skF_11 > #skF_6 > #skF_1 > #skF_7 > #skF_10 > #skF_12 > #skF_5 > #skF_2 > #skF_9 > #skF_8 > #skF_3 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_110,negated_conjecture,
~ ! [A,B] :
( subset(A,B)
=> ( set_union2(A,B) = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
tff(f_101,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_33,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(f_181,lemma,
! [A,B,C] :
( ( subset(A,B)
& subset(C,B) )
=> subset(set_union2(A,C),B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
tff(f_167,lemma,
! [A,B] : subset(A,set_union2(A,B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
tff(f_41,axiom,
! [A,B] :
( ( A = B )
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
tff(c_88,plain,
set_union2('#skF_9','#skF_10') != '#skF_10',
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_84,plain,
! [A_40] : subset(A_40,A_40),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_union2(B_4,A_3) = set_union2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_90,plain,
subset('#skF_9','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_118,plain,
! [A_67,C_69,B_68] :
( subset(set_union2(A_67,C_69),B_68)
| ~ subset(C_69,B_68)
| ~ subset(A_67,B_68) ),
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_114,plain,
! [A_63,B_64] : subset(A_63,set_union2(A_63,B_64)),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_540,plain,
! [B_127,A_128] :
( ( B_127 = A_128 )
| ~ subset(B_127,A_128)
| ~ subset(A_128,B_127) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_3215,plain,
! [A_357,B_358] :
( ( set_union2(A_357,B_358) = A_357 )
| ~ subset(set_union2(A_357,B_358),A_357) ),
inference(resolution,[status(thm)],[c_114,c_540]) ).
tff(c_3227,plain,
! [B_68,C_69] :
( ( set_union2(B_68,C_69) = B_68 )
| ~ subset(C_69,B_68)
| ~ subset(B_68,B_68) ),
inference(resolution,[status(thm)],[c_118,c_3215]) ).
tff(c_3268,plain,
! [B_359,C_360] :
( ( set_union2(B_359,C_360) = B_359 )
| ~ subset(C_360,B_359) ),
inference(demodulation,[status(thm),theory(equality)],[c_84,c_3227]) ).
tff(c_3315,plain,
set_union2('#skF_10','#skF_9') = '#skF_10',
inference(resolution,[status(thm)],[c_90,c_3268]) ).
tff(c_552,plain,
! [A_63,B_64] :
( ( set_union2(A_63,B_64) = A_63 )
| ~ subset(set_union2(A_63,B_64),A_63) ),
inference(resolution,[status(thm)],[c_114,c_540]) ).
tff(c_3321,plain,
( ( set_union2('#skF_10','#skF_9') = '#skF_10' )
| ~ subset('#skF_10','#skF_10') ),
inference(superposition,[status(thm),theory(equality)],[c_3315,c_552]) ).
tff(c_3430,plain,
set_union2('#skF_9','#skF_10') = '#skF_10',
inference(demodulation,[status(thm),theory(equality)],[c_84,c_4,c_3321]) ).
tff(c_3432,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_88,c_3430]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU126+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.15 % 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.15/0.37 % Computer : n024.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 12:09:45 EDT 2023
% 0.15/0.37 % CPUTime :
% 6.38/2.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.38/2.53
% 6.38/2.53 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.38/2.55
% 6.38/2.55 Inference rules
% 6.38/2.55 ----------------------
% 6.38/2.55 #Ref : 1
% 6.38/2.55 #Sup : 852
% 6.38/2.55 #Fact : 2
% 6.38/2.55 #Define : 0
% 6.38/2.55 #Split : 2
% 6.38/2.55 #Chain : 0
% 6.38/2.55 #Close : 0
% 6.38/2.55
% 6.38/2.55 Ordering : KBO
% 6.38/2.55
% 6.38/2.55 Simplification rules
% 6.38/2.55 ----------------------
% 6.38/2.55 #Subsume : 346
% 6.38/2.55 #Demod : 152
% 6.38/2.55 #Tautology : 193
% 6.38/2.55 #SimpNegUnit : 9
% 6.38/2.55 #BackRed : 5
% 6.38/2.55
% 6.38/2.55 #Partial instantiations: 0
% 6.38/2.55 #Strategies tried : 1
% 6.38/2.55
% 6.38/2.55 Timing (in seconds)
% 6.38/2.55 ----------------------
% 6.38/2.55 Preprocessing : 0.58
% 6.38/2.55 Parsing : 0.30
% 6.38/2.56 CNF conversion : 0.05
% 6.38/2.56 Main loop : 0.88
% 6.38/2.56 Inferencing : 0.30
% 6.38/2.56 Reduction : 0.27
% 6.38/2.56 Demodulation : 0.20
% 6.38/2.56 BG Simplification : 0.04
% 6.38/2.56 Subsumption : 0.22
% 6.38/2.56 Abstraction : 0.03
% 6.38/2.56 MUC search : 0.00
% 6.38/2.56 Cooper : 0.00
% 6.38/2.56 Total : 1.50
% 6.38/2.56 Index Insertion : 0.00
% 6.38/2.56 Index Deletion : 0.00
% 6.38/2.56 Index Matching : 0.00
% 6.38/2.56 BG Taut test : 0.00
%------------------------------------------------------------------------------