TSTP Solution File: SEU165+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU165+3 : TPTP v8.1.2. Released v3.2.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 : n015.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.65s 1.91s
% Output : CNFRefutation 3.90s
% 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_50,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',t106_zfmisc_1) ).
tff(f_56,axiom,
! [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(c_16,plain,
( in('#skF_4','#skF_6')
| ~ in('#skF_8','#skF_10')
| ~ in('#skF_7','#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_99,plain,
~ in('#skF_7','#skF_9'),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_22,plain,
( in('#skF_4','#skF_6')
| in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_100,plain,
in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_254,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_56]) ).
tff(c_257,plain,
in('#skF_7','#skF_9'),
inference(resolution,[status(thm)],[c_100,c_254]) ).
tff(c_261,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_99,c_257]) ).
tff(c_263,plain,
~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_24,plain,
( in('#skF_3','#skF_5')
| in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_267,plain,
in('#skF_3','#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_263,c_24]) ).
tff(c_262,plain,
in('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_26,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_56]) ).
tff(c_20,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_50]) ).
tff(c_467,plain,
~ in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6')),
inference(negUnitSimplification,[status(thm)],[c_263,c_20]) ).
tff(c_470,plain,
( ~ in('#skF_4','#skF_6')
| ~ in('#skF_3','#skF_5') ),
inference(resolution,[status(thm)],[c_26,c_467]) ).
tff(c_474,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_267,c_262,c_470]) ).
tff(c_476,plain,
in('#skF_7','#skF_9'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_475,plain,
( ~ in('#skF_8','#skF_10')
| in('#skF_4','#skF_6') ),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_480,plain,
~ in('#skF_8','#skF_10'),
inference(splitLeft,[status(thm)],[c_475]) ).
tff(c_569,plain,
in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_640,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_56]) ).
tff(c_643,plain,
in('#skF_8','#skF_10'),
inference(resolution,[status(thm)],[c_569,c_640]) ).
tff(c_647,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_480,c_643]) ).
tff(c_649,plain,
~ in(ordered_pair('#skF_7','#skF_8'),cartesian_product2('#skF_9','#skF_10')),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_655,plain,
in('#skF_3','#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_649,c_24]) ).
tff(c_648,plain,
in('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_809,plain,
~ in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6')),
inference(negUnitSimplification,[status(thm)],[c_649,c_20]) ).
tff(c_812,plain,
( ~ in('#skF_4','#skF_6')
| ~ in('#skF_3','#skF_5') ),
inference(resolution,[status(thm)],[c_26,c_809]) ).
tff(c_816,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_655,c_648,c_812]) ).
tff(c_818,plain,
in('#skF_8','#skF_10'),
inference(splitRight,[status(thm)],[c_475]) ).
tff(c_18,plain,
( in('#skF_3','#skF_5')
| ~ in('#skF_8','#skF_10')
| ~ in('#skF_7','#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_826,plain,
in('#skF_3','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_476,c_818,c_18]) ).
tff(c_817,plain,
in('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_475]) ).
tff(c_14,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_50]) ).
tff(c_991,plain,
~ in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6')),
inference(demodulation,[status(thm),theory(equality)],[c_476,c_818,c_14]) ).
tff(c_994,plain,
( ~ in('#skF_4','#skF_6')
| ~ in('#skF_3','#skF_5') ),
inference(resolution,[status(thm)],[c_26,c_991]) ).
tff(c_998,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_826,c_817,c_994]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU165+3 : TPTP v8.1.2. Released v3.2.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.13/0.36 % Computer : n015.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 12:22:43 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.65/1.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.65/1.91
% 3.65/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.90/1.94
% 3.90/1.94 Inference rules
% 3.90/1.94 ----------------------
% 3.90/1.94 #Ref : 0
% 3.90/1.94 #Sup : 243
% 3.90/1.94 #Fact : 0
% 3.90/1.94 #Define : 0
% 3.90/1.94 #Split : 4
% 3.90/1.94 #Chain : 0
% 3.90/1.94 #Close : 0
% 3.90/1.94
% 3.90/1.94 Ordering : KBO
% 3.90/1.94
% 3.90/1.94 Simplification rules
% 3.90/1.94 ----------------------
% 3.90/1.94 #Subsume : 7
% 3.90/1.95 #Demod : 83
% 3.90/1.95 #Tautology : 135
% 3.90/1.95 #SimpNegUnit : 6
% 3.90/1.95 #BackRed : 0
% 3.90/1.95
% 3.90/1.95 #Partial instantiations: 0
% 3.90/1.95 #Strategies tried : 1
% 3.90/1.95
% 3.90/1.95 Timing (in seconds)
% 3.90/1.95 ----------------------
% 3.90/1.95 Preprocessing : 0.44
% 3.90/1.95 Parsing : 0.24
% 3.90/1.95 CNF conversion : 0.03
% 3.90/1.95 Main loop : 0.50
% 3.90/1.95 Inferencing : 0.18
% 3.90/1.95 Reduction : 0.16
% 3.90/1.95 Demodulation : 0.12
% 3.90/1.95 BG Simplification : 0.02
% 3.90/1.95 Subsumption : 0.10
% 3.90/1.95 Abstraction : 0.02
% 3.90/1.95 MUC search : 0.00
% 3.90/1.95 Cooper : 0.00
% 3.90/1.95 Total : 0.99
% 3.90/1.95 Index Insertion : 0.00
% 3.90/1.95 Index Deletion : 0.00
% 3.90/1.95 Index Matching : 0.00
% 3.90/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------