TSTP Solution File: SEU165+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU165+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 : n026.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:52 EDT 2023
% Result : Theorem 3.99s 2.03s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 55 ( 24 unt; 16 typ; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 27 ~; 17 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > unordered_pair > ordered_pair > cartesian_product2 > #nlpp > singleton > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_9 > #skF_8 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
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('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(f_51,negated_conjecture,
~ ! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(A,C)
& in(B,D) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t106_zfmisc_1) ).
tff(f_57,axiom,
! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(A,C)
& in(B,D) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l55_zfmisc_1) ).
tff(c_24,plain,
( in('#skF_4','#skF_6')
| ~ in('#skF_8','#skF_10')
| ~ in('#skF_7','#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_107,plain,
~ in('#skF_7','#skF_9'),
inference(splitLeft,[status(thm)],[c_24]) ).
tff(c_30,plain,
( in('#skF_4','#skF_6')
| in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_108,plain,
in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(splitLeft,[status(thm)],[c_30]) ).
tff(c_262,plain,
! [A_31,C_32,B_33,D_34] :
( in(A_31,C_32)
| ~ in(ordered_pair(A_31,B_33),cartesian_product2(C_32,D_34)) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_265,plain,
in('#skF_7','#skF_9'),
inference(resolution,[status(thm)],[c_108,c_262]) ).
tff(c_269,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_107,c_265]) ).
tff(c_271,plain,
~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_32,plain,
( in('#skF_3','#skF_5')
| in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_275,plain,
in('#skF_3','#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_271,c_32]) ).
tff(c_270,plain,
in('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_34,plain,
! [A_9,B_10,C_11,D_12] :
( in(ordered_pair(A_9,B_10),cartesian_product2(C_11,D_12))
| ~ in(B_10,D_12)
| ~ in(A_9,C_11) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_28,plain,
( ~ in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6'))
| in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_475,plain,
~ in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6')),
inference(negUnitSimplification,[status(thm)],[c_271,c_28]) ).
tff(c_478,plain,
( ~ in('#skF_4','#skF_6')
| ~ in('#skF_3','#skF_5') ),
inference(resolution,[status(thm)],[c_34,c_475]) ).
tff(c_482,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_275,c_270,c_478]) ).
tff(c_484,plain,
in('#skF_7','#skF_9'),
inference(splitRight,[status(thm)],[c_24]) ).
tff(c_483,plain,
( ~ in('#skF_8','#skF_10')
| in('#skF_4','#skF_6') ),
inference(splitRight,[status(thm)],[c_24]) ).
tff(c_488,plain,
~ in('#skF_8','#skF_10'),
inference(splitLeft,[status(thm)],[c_483]) ).
tff(c_577,plain,
in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(splitLeft,[status(thm)],[c_30]) ).
tff(c_648,plain,
! [B_69,D_70,A_71,C_72] :
( in(B_69,D_70)
| ~ in(ordered_pair(A_71,B_69),cartesian_product2(C_72,D_70)) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_651,plain,
in('#skF_8','#skF_10'),
inference(resolution,[status(thm)],[c_577,c_648]) ).
tff(c_655,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_488,c_651]) ).
tff(c_657,plain,
~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_663,plain,
in('#skF_3','#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_657,c_32]) ).
tff(c_656,plain,
in('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_817,plain,
~ in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6')),
inference(negUnitSimplification,[status(thm)],[c_657,c_28]) ).
tff(c_820,plain,
( ~ in('#skF_4','#skF_6')
| ~ in('#skF_3','#skF_5') ),
inference(resolution,[status(thm)],[c_34,c_817]) ).
tff(c_824,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_663,c_656,c_820]) ).
tff(c_826,plain,
in('#skF_8','#skF_10'),
inference(splitRight,[status(thm)],[c_483]) ).
tff(c_26,plain,
( in('#skF_3','#skF_5')
| ~ in('#skF_8','#skF_10')
| ~ in('#skF_7','#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_834,plain,
in('#skF_3','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_484,c_826,c_26]) ).
tff(c_825,plain,
in('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_483]) ).
tff(c_22,plain,
( ~ in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6'))
| ~ in('#skF_8','#skF_10')
| ~ in('#skF_7','#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_999,plain,
~ in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6')),
inference(demodulation,[status(thm),theory(equality)],[c_484,c_826,c_22]) ).
tff(c_1002,plain,
( ~ in('#skF_4','#skF_6')
| ~ in('#skF_3','#skF_5') ),
inference(resolution,[status(thm)],[c_34,c_999]) ).
tff(c_1006,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_834,c_825,c_1002]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU165+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/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.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 12:24:01 EDT 2023
% 0.18/0.34 % CPUTime :
% 3.99/2.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.99/2.03
% 3.99/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.99/2.06
% 3.99/2.06 Inference rules
% 3.99/2.06 ----------------------
% 3.99/2.06 #Ref : 0
% 3.99/2.06 #Sup : 243
% 3.99/2.06 #Fact : 0
% 3.99/2.06 #Define : 0
% 3.99/2.06 #Split : 4
% 3.99/2.06 #Chain : 0
% 3.99/2.06 #Close : 0
% 3.99/2.06
% 3.99/2.06 Ordering : KBO
% 3.99/2.06
% 3.99/2.06 Simplification rules
% 3.99/2.06 ----------------------
% 3.99/2.06 #Subsume : 7
% 3.99/2.06 #Demod : 83
% 3.99/2.06 #Tautology : 139
% 3.99/2.06 #SimpNegUnit : 6
% 3.99/2.06 #BackRed : 0
% 3.99/2.06
% 3.99/2.06 #Partial instantiations: 0
% 3.99/2.06 #Strategies tried : 1
% 3.99/2.06
% 3.99/2.06 Timing (in seconds)
% 3.99/2.06 ----------------------
% 3.99/2.07 Preprocessing : 0.46
% 3.99/2.07 Parsing : 0.25
% 3.99/2.07 CNF conversion : 0.03
% 3.99/2.07 Main loop : 0.54
% 3.99/2.07 Inferencing : 0.19
% 3.99/2.07 Reduction : 0.18
% 3.99/2.07 Demodulation : 0.13
% 3.99/2.07 BG Simplification : 0.02
% 3.99/2.07 Subsumption : 0.10
% 3.99/2.07 Abstraction : 0.02
% 3.99/2.07 MUC search : 0.00
% 3.99/2.07 Cooper : 0.00
% 3.99/2.07 Total : 1.05
% 3.99/2.07 Index Insertion : 0.00
% 3.99/2.07 Index Deletion : 0.00
% 3.99/2.07 Index Matching : 0.00
% 3.99/2.07 BG Taut test : 0.00
%------------------------------------------------------------------------------