TSTP Solution File: SEU129+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU129+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/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 : n008.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:41 EDT 2023
% Result : Theorem 15.71s 5.46s
% Output : CNFRefutation 15.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 40 ( 9 unt; 13 typ; 0 def)
% Number of atoms : 59 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 24 ~; 26 |; 1 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 7 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 58 (; 58 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > set_intersection2 > #nlpp > empty_set > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_8 > #skF_4 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $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(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_33,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_40,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_49,axiom,
! [A,B,C] :
( ( C = set_intersection2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
tff(f_65,negated_conjecture,
~ ! [A,B,C] :
( subset(A,B)
=> subset(set_intersection2(A,C),set_intersection2(B,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_intersection2(B_4,A_3) = set_intersection2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_10,plain,
! [A_5,B_6] :
( in('#skF_1'(A_5,B_6),A_5)
| subset(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_219,plain,
! [D_44,B_45,A_46] :
( in(D_44,B_45)
| ~ in(D_44,set_intersection2(A_46,B_45)) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_807,plain,
! [A_122,B_123,B_124] :
( in('#skF_1'(set_intersection2(A_122,B_123),B_124),B_123)
| subset(set_intersection2(A_122,B_123),B_124) ),
inference(resolution,[status(thm)],[c_10,c_219]) ).
tff(c_8,plain,
! [A_5,B_6] :
( ~ in('#skF_1'(A_5,B_6),B_6)
| subset(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_866,plain,
! [A_125,B_126] : subset(set_intersection2(A_125,B_126),B_126),
inference(resolution,[status(thm)],[c_807,c_8]) ).
tff(c_877,plain,
! [B_4,A_3] : subset(set_intersection2(B_4,A_3),B_4),
inference(superposition,[status(thm),theory(equality)],[c_4,c_866]) ).
tff(c_856,plain,
! [A_122,B_123] : subset(set_intersection2(A_122,B_123),B_123),
inference(resolution,[status(thm)],[c_807,c_8]) ).
tff(c_274,plain,
! [C_56,B_57,A_58] :
( in(C_56,B_57)
| ~ in(C_56,A_58)
| ~ subset(A_58,B_57) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_277,plain,
! [A_5,B_6,B_57] :
( in('#skF_1'(A_5,B_6),B_57)
| ~ subset(A_5,B_57)
| subset(A_5,B_6) ),
inference(resolution,[status(thm)],[c_10,c_274]) ).
tff(c_46,plain,
subset('#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_431,plain,
! [A_73,B_74,B_75] :
( in('#skF_1'(A_73,B_74),B_75)
| ~ subset(A_73,B_75)
| subset(A_73,B_74) ),
inference(resolution,[status(thm)],[c_10,c_274]) ).
tff(c_6,plain,
! [C_9,B_6,A_5] :
( in(C_9,B_6)
| ~ in(C_9,A_5)
| ~ subset(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_24378,plain,
! [A_564,B_565,B_566,B_567] :
( in('#skF_1'(A_564,B_565),B_566)
| ~ subset(B_567,B_566)
| ~ subset(A_564,B_567)
| subset(A_564,B_565) ),
inference(resolution,[status(thm)],[c_431,c_6]) ).
tff(c_24436,plain,
! [A_568,B_569] :
( in('#skF_1'(A_568,B_569),'#skF_7')
| ~ subset(A_568,'#skF_6')
| subset(A_568,B_569) ),
inference(resolution,[status(thm)],[c_46,c_24378]) ).
tff(c_318,plain,
! [D_62,A_63,B_64] :
( in(D_62,set_intersection2(A_63,B_64))
| ~ in(D_62,B_64)
| ~ in(D_62,A_63) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_352,plain,
! [A_5,A_63,B_64] :
( subset(A_5,set_intersection2(A_63,B_64))
| ~ in('#skF_1'(A_5,set_intersection2(A_63,B_64)),B_64)
| ~ in('#skF_1'(A_5,set_intersection2(A_63,B_64)),A_63) ),
inference(resolution,[status(thm)],[c_318,c_8]) ).
tff(c_28078,plain,
! [A_610,A_611] :
( ~ in('#skF_1'(A_610,set_intersection2(A_611,'#skF_7')),A_611)
| ~ subset(A_610,'#skF_6')
| subset(A_610,set_intersection2(A_611,'#skF_7')) ),
inference(resolution,[status(thm)],[c_24436,c_352]) ).
tff(c_29926,plain,
! [A_633,B_634] :
( ~ subset(A_633,'#skF_6')
| ~ subset(A_633,B_634)
| subset(A_633,set_intersection2(B_634,'#skF_7')) ),
inference(resolution,[status(thm)],[c_277,c_28078]) ).
tff(c_44,plain,
~ subset(set_intersection2('#skF_6','#skF_8'),set_intersection2('#skF_7','#skF_8')),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_55,plain,
~ subset(set_intersection2('#skF_8','#skF_6'),set_intersection2('#skF_8','#skF_7')),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_44]) ).
tff(c_29964,plain,
( ~ subset(set_intersection2('#skF_8','#skF_6'),'#skF_6')
| ~ subset(set_intersection2('#skF_8','#skF_6'),'#skF_8') ),
inference(resolution,[status(thm)],[c_29926,c_55]) ).
tff(c_30063,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_877,c_856,c_29964]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU129+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/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.14/0.35 % Computer : n008.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 11:49:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 15.71/5.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.71/5.47
% 15.71/5.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.91/5.50
% 15.91/5.50 Inference rules
% 15.91/5.50 ----------------------
% 15.91/5.50 #Ref : 0
% 15.91/5.50 #Sup : 8597
% 15.91/5.50 #Fact : 0
% 15.91/5.50 #Define : 0
% 15.91/5.50 #Split : 2
% 15.91/5.50 #Chain : 0
% 15.91/5.50 #Close : 0
% 15.91/5.50
% 15.91/5.50 Ordering : KBO
% 15.91/5.50
% 15.91/5.50 Simplification rules
% 15.91/5.50 ----------------------
% 15.91/5.50 #Subsume : 4537
% 15.91/5.50 #Demod : 2531
% 15.91/5.50 #Tautology : 1157
% 15.91/5.50 #SimpNegUnit : 1
% 15.91/5.50 #BackRed : 3
% 15.91/5.50
% 15.91/5.50 #Partial instantiations: 0
% 15.91/5.50 #Strategies tried : 1
% 15.91/5.50
% 15.91/5.50 Timing (in seconds)
% 15.91/5.50 ----------------------
% 15.91/5.50 Preprocessing : 0.52
% 15.91/5.50 Parsing : 0.27
% 15.91/5.50 CNF conversion : 0.04
% 15.91/5.50 Main loop : 3.81
% 15.91/5.50 Inferencing : 0.92
% 15.91/5.50 Reduction : 1.14
% 15.91/5.50 Demodulation : 0.90
% 15.91/5.50 BG Simplification : 0.09
% 15.91/5.50 Subsumption : 1.43
% 15.91/5.50 Abstraction : 0.10
% 15.91/5.50 MUC search : 0.00
% 15.91/5.50 Cooper : 0.00
% 15.91/5.50 Total : 4.37
% 15.91/5.50 Index Insertion : 0.00
% 15.91/5.50 Index Deletion : 0.00
% 15.91/5.50 Index Matching : 0.00
% 15.91/5.50 BG Taut test : 0.00
%------------------------------------------------------------------------------