TSTP Solution File: SEU157+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU157+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 : n027.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:49 EDT 2023
% Result : Theorem 7.33s 2.82s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 25
% Syntax : Number of formulae : 84 ( 31 unt; 22 typ; 0 def)
% Number of atoms : 106 ( 25 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 91 ( 47 ~; 36 |; 4 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 12 >; 18 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 10 con; 0-4 aty)
% Number of variables : 69 (; 67 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > unordered_pair > ordered_pair > cartesian_product2 > #nlpp > singleton > #skF_1 > #skF_11 > #skF_15 > #skF_4 > #skF_7 > #skF_10 > #skF_16 > #skF_14 > #skF_13 > #skF_2 > #skF_6 > #skF_9 > #skF_8 > #skF_5 > #skF_3 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_58,negated_conjecture,
~ ! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(A,C)
& in(B,D) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1) ).
tff(f_45,axiom,
! [A,B,C] :
( ( C = cartesian_product2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ? [E,F] :
( in(E,A)
& in(F,B)
& ( D = ordered_pair(E,F) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).
tff(f_69,axiom,
! [A,B,C,D] :
( ( ordered_pair(A,B) = ordered_pair(C,D) )
=> ( ( A = C )
& ( B = D ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).
tff(c_44,plain,
( in('#skF_8','#skF_10')
| ~ in('#skF_12','#skF_14')
| ~ in('#skF_11','#skF_13') ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_139,plain,
~ in('#skF_11','#skF_13'),
inference(splitLeft,[status(thm)],[c_44]) ).
tff(c_50,plain,
( in('#skF_8','#skF_10')
| in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_226,plain,
in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')),
inference(splitLeft,[status(thm)],[c_50]) ).
tff(c_822,plain,
! [A_118,B_119,D_120] :
( ( ordered_pair('#skF_5'(A_118,B_119,cartesian_product2(A_118,B_119),D_120),'#skF_6'(A_118,B_119,cartesian_product2(A_118,B_119),D_120)) = D_120 )
| ~ in(D_120,cartesian_product2(A_118,B_119)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_60,plain,
! [C_45,A_43,D_46,B_44] :
( ( C_45 = A_43 )
| ( ordered_pair(C_45,D_46) != ordered_pair(A_43,B_44) ) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_855,plain,
! [B_119,D_120,A_118,A_43,B_44] :
( ( A_43 = '#skF_5'(A_118,B_119,cartesian_product2(A_118,B_119),D_120) )
| ( ordered_pair(A_43,B_44) != D_120 )
| ~ in(D_120,cartesian_product2(A_118,B_119)) ),
inference(superposition,[status(thm),theory(equality)],[c_822,c_60]) ).
tff(c_2574,plain,
! [A_199,B_200,A_201,B_202] :
( ( '#skF_5'(A_199,B_200,cartesian_product2(A_199,B_200),ordered_pair(A_201,B_202)) = A_201 )
| ~ in(ordered_pair(A_201,B_202),cartesian_product2(A_199,B_200)) ),
inference(reflexivity,[status(thm),theory(equality)],[c_855]) ).
tff(c_2592,plain,
'#skF_5'('#skF_13','#skF_14',cartesian_product2('#skF_13','#skF_14'),ordered_pair('#skF_11','#skF_12')) = '#skF_11',
inference(resolution,[status(thm)],[c_226,c_2574]) ).
tff(c_12,plain,
! [A_5,B_6,D_32] :
( in('#skF_5'(A_5,B_6,cartesian_product2(A_5,B_6),D_32),A_5)
| ~ in(D_32,cartesian_product2(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_2602,plain,
( in('#skF_11','#skF_13')
| ~ in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')) ),
inference(superposition,[status(thm),theory(equality)],[c_2592,c_12]) ).
tff(c_2610,plain,
in('#skF_11','#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_226,c_2602]) ).
tff(c_2612,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_139,c_2610]) ).
tff(c_2614,plain,
~ in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')),
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_52,plain,
( in('#skF_7','#skF_9')
| in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_2620,plain,
in('#skF_7','#skF_9'),
inference(negUnitSimplification,[status(thm)],[c_2614,c_52]) ).
tff(c_2613,plain,
in('#skF_8','#skF_10'),
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_2682,plain,
! [E_205,F_206,A_207,B_208] :
( in(ordered_pair(E_205,F_206),cartesian_product2(A_207,B_208))
| ~ in(F_206,B_208)
| ~ in(E_205,A_207) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_48,plain,
( ~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10'))
| in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_2681,plain,
~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(negUnitSimplification,[status(thm)],[c_2614,c_48]) ).
tff(c_2685,plain,
( ~ in('#skF_8','#skF_10')
| ~ in('#skF_7','#skF_9') ),
inference(resolution,[status(thm)],[c_2682,c_2681]) ).
tff(c_2694,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2620,c_2613,c_2685]) ).
tff(c_2696,plain,
in('#skF_11','#skF_13'),
inference(splitRight,[status(thm)],[c_44]) ).
tff(c_2695,plain,
( ~ in('#skF_12','#skF_14')
| in('#skF_8','#skF_10') ),
inference(splitRight,[status(thm)],[c_44]) ).
tff(c_2700,plain,
~ in('#skF_12','#skF_14'),
inference(splitLeft,[status(thm)],[c_2695]) ).
tff(c_2788,plain,
in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')),
inference(splitLeft,[status(thm)],[c_52]) ).
tff(c_3304,plain,
! [A_256,B_257,D_258] :
( ( ordered_pair('#skF_5'(A_256,B_257,cartesian_product2(A_256,B_257),D_258),'#skF_6'(A_256,B_257,cartesian_product2(A_256,B_257),D_258)) = D_258 )
| ~ in(D_258,cartesian_product2(A_256,B_257)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_3334,plain,
! [A_256,A_43,D_258,B_257,B_44] :
( ( A_43 = '#skF_5'(A_256,B_257,cartesian_product2(A_256,B_257),D_258) )
| ( ordered_pair(A_43,B_44) != D_258 )
| ~ in(D_258,cartesian_product2(A_256,B_257)) ),
inference(superposition,[status(thm),theory(equality)],[c_3304,c_60]) ).
tff(c_5140,plain,
! [A_345,B_346,A_347,B_348] :
( ( '#skF_5'(A_345,B_346,cartesian_product2(A_345,B_346),ordered_pair(A_347,B_348)) = A_347 )
| ~ in(ordered_pair(A_347,B_348),cartesian_product2(A_345,B_346)) ),
inference(reflexivity,[status(thm),theory(equality)],[c_3334]) ).
tff(c_5158,plain,
'#skF_5'('#skF_13','#skF_14',cartesian_product2('#skF_13','#skF_14'),ordered_pair('#skF_11','#skF_12')) = '#skF_11',
inference(resolution,[status(thm)],[c_2788,c_5140]) ).
tff(c_8,plain,
! [A_5,B_6,D_32] :
( ( ordered_pair('#skF_5'(A_5,B_6,cartesian_product2(A_5,B_6),D_32),'#skF_6'(A_5,B_6,cartesian_product2(A_5,B_6),D_32)) = D_32 )
| ~ in(D_32,cartesian_product2(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_5165,plain,
( ( ordered_pair('#skF_11','#skF_6'('#skF_13','#skF_14',cartesian_product2('#skF_13','#skF_14'),ordered_pair('#skF_11','#skF_12'))) = ordered_pair('#skF_11','#skF_12') )
| ~ in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')) ),
inference(superposition,[status(thm),theory(equality)],[c_5158,c_8]) ).
tff(c_5174,plain,
ordered_pair('#skF_11','#skF_6'('#skF_13','#skF_14',cartesian_product2('#skF_13','#skF_14'),ordered_pair('#skF_11','#skF_12'))) = ordered_pair('#skF_11','#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_2788,c_5165]) ).
tff(c_58,plain,
! [D_46,B_44,C_45,A_43] :
( ( D_46 = B_44 )
| ( ordered_pair(C_45,D_46) != ordered_pair(A_43,B_44) ) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_5256,plain,
! [D_46,C_45] :
( ( D_46 = '#skF_6'('#skF_13','#skF_14',cartesian_product2('#skF_13','#skF_14'),ordered_pair('#skF_11','#skF_12')) )
| ( ordered_pair(C_45,D_46) != ordered_pair('#skF_11','#skF_12') ) ),
inference(superposition,[status(thm),theory(equality)],[c_5174,c_58]) ).
tff(c_5339,plain,
'#skF_6'('#skF_13','#skF_14',cartesian_product2('#skF_13','#skF_14'),ordered_pair('#skF_11','#skF_12')) = '#skF_12',
inference(reflexivity,[status(thm),theory(equality)],[c_5256]) ).
tff(c_10,plain,
! [A_5,B_6,D_32] :
( in('#skF_6'(A_5,B_6,cartesian_product2(A_5,B_6),D_32),B_6)
| ~ in(D_32,cartesian_product2(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_5368,plain,
( in('#skF_12','#skF_14')
| ~ in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')) ),
inference(superposition,[status(thm),theory(equality)],[c_5339,c_10]) ).
tff(c_5376,plain,
in('#skF_12','#skF_14'),
inference(demodulation,[status(thm),theory(equality)],[c_2788,c_5368]) ).
tff(c_5378,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2700,c_5376]) ).
tff(c_5379,plain,
in('#skF_7','#skF_9'),
inference(splitRight,[status(thm)],[c_52]) ).
tff(c_5380,plain,
~ in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')),
inference(splitRight,[status(thm)],[c_52]) ).
tff(c_5381,plain,
in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')),
inference(splitLeft,[status(thm)],[c_50]) ).
tff(c_5385,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_5380,c_5381]) ).
tff(c_5386,plain,
in('#skF_8','#skF_10'),
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_6,plain,
! [E_37,F_38,A_5,B_6] :
( in(ordered_pair(E_37,F_38),cartesian_product2(A_5,B_6))
| ~ in(F_38,B_6)
| ~ in(E_37,A_5) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_5387,plain,
~ in(ordered_pair('#skF_11','#skF_12'),cartesian_product2('#skF_13','#skF_14')),
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_5463,plain,
~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(negUnitSimplification,[status(thm)],[c_5387,c_48]) ).
tff(c_5466,plain,
( ~ in('#skF_8','#skF_10')
| ~ in('#skF_7','#skF_9') ),
inference(resolution,[status(thm)],[c_6,c_5463]) ).
tff(c_5470,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_5379,c_5386,c_5466]) ).
tff(c_5472,plain,
in('#skF_12','#skF_14'),
inference(splitRight,[status(thm)],[c_2695]) ).
tff(c_46,plain,
( in('#skF_7','#skF_9')
| ~ in('#skF_12','#skF_14')
| ~ in('#skF_11','#skF_13') ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_5480,plain,
in('#skF_7','#skF_9'),
inference(demodulation,[status(thm),theory(equality)],[c_2696,c_5472,c_46]) ).
tff(c_5471,plain,
in('#skF_8','#skF_10'),
inference(splitRight,[status(thm)],[c_2695]) ).
tff(c_5632,plain,
! [E_372,F_373,A_374,B_375] :
( in(ordered_pair(E_372,F_373),cartesian_product2(A_374,B_375))
| ~ in(F_373,B_375)
| ~ in(E_372,A_374) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_42,plain,
( ~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10'))
| ~ in('#skF_12','#skF_14')
| ~ in('#skF_11','#skF_13') ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_5626,plain,
~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(demodulation,[status(thm),theory(equality)],[c_2696,c_5472,c_42]) ).
tff(c_5635,plain,
( ~ in('#skF_8','#skF_10')
| ~ in('#skF_7','#skF_9') ),
inference(resolution,[status(thm)],[c_5632,c_5626]) ).
tff(c_5641,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_5480,c_5471,c_5635]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU157+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % 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.18/0.34 % Computer : n027.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Thu Aug 3 12:08:08 EDT 2023
% 0.18/0.35 % CPUTime :
% 7.33/2.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.50/2.83
% 7.50/2.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.50/2.86
% 7.50/2.86 Inference rules
% 7.50/2.86 ----------------------
% 7.50/2.86 #Ref : 15
% 7.50/2.86 #Sup : 1479
% 7.50/2.86 #Fact : 0
% 7.50/2.86 #Define : 0
% 7.50/2.86 #Split : 6
% 7.50/2.86 #Chain : 0
% 7.50/2.86 #Close : 0
% 7.50/2.86
% 7.50/2.86 Ordering : KBO
% 7.50/2.86
% 7.50/2.86 Simplification rules
% 7.50/2.86 ----------------------
% 7.50/2.86 #Subsume : 241
% 7.50/2.86 #Demod : 1187
% 7.50/2.86 #Tautology : 392
% 7.50/2.86 #SimpNegUnit : 6
% 7.50/2.86 #BackRed : 1
% 7.50/2.86
% 7.50/2.86 #Partial instantiations: 0
% 7.50/2.86 #Strategies tried : 1
% 7.50/2.86
% 7.50/2.86 Timing (in seconds)
% 7.50/2.86 ----------------------
% 7.50/2.86 Preprocessing : 0.49
% 7.50/2.86 Parsing : 0.25
% 7.50/2.86 CNF conversion : 0.04
% 7.50/2.86 Main loop : 1.30
% 7.50/2.86 Inferencing : 0.39
% 7.50/2.86 Reduction : 0.55
% 7.50/2.86 Demodulation : 0.45
% 7.50/2.86 BG Simplification : 0.06
% 7.50/2.86 Subsumption : 0.23
% 7.50/2.86 Abstraction : 0.08
% 7.50/2.86 MUC search : 0.00
% 7.50/2.86 Cooper : 0.00
% 7.50/2.86 Total : 1.85
% 7.50/2.86 Index Insertion : 0.00
% 7.50/2.86 Index Deletion : 0.00
% 7.50/2.86 Index Matching : 0.00
% 7.50/2.86 BG Taut test : 0.00
%------------------------------------------------------------------------------