TSTP Solution File: SEU161+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU161+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/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 : n003.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:50 EDT 2023
% Result : Theorem 21.49s 7.67s
% Output : CNFRefutation 21.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 50
% Syntax : Number of formulae : 58 ( 7 unt; 47 typ; 0 def)
% Number of atoms : 15 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 96 ( 42 >; 54 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 5 con; 0-4 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > disjoint > empty > unordered_pair > set_union2 > set_intersection2 > set_difference > ordered_pair > cartesian_product2 > #nlpp > union > singleton > powerset > empty_set > #skF_13 > #skF_24 > #skF_17 > #skF_6 > #skF_31 > #skF_25 > #skF_18 > #skF_20 > #skF_32 > #skF_22 > #skF_12 > #skF_15 > #skF_26 > #skF_23 > #skF_19 > #skF_11 > #skF_7 > #skF_9 > #skF_28 > #skF_30 > #skF_3 > #skF_2 > #skF_8 > #skF_29 > #skF_27 > #skF_14 > #skF_1 > #skF_16 > #skF_21 > #skF_5 > #skF_4 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i * $i ) > $i ).
tff(union,type,
union: $i > $i ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_31',type,
'#skF_31': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i * $i ) > $i ).
tff('#skF_26',type,
'#skF_26': $i ).
tff(proper_subset,type,
proper_subset: ( $i * $i ) > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i ) > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_28',type,
'#skF_28': ( $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff('#skF_29',type,
'#skF_29': ( $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_347,negated_conjecture,
~ ! [A,B] :
( in(A,B)
=> ( set_union2(singleton(A),B) = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t46_zfmisc_1) ).
tff(f_178,lemma,
! [A,B] :
( in(A,B)
=> ( set_union2(singleton(A),B) = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l23_zfmisc_1) ).
tff(f_40,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(c_328,plain,
in('#skF_30','#skF_31'),
inference(cnfTransformation,[status(thm)],[f_347]) ).
tff(c_4476,plain,
! [A_536,B_537] :
( ( set_union2(singleton(A_536),B_537) = B_537 )
| ~ in(A_536,B_537) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_8,plain,
! [B_8,A_7] : ( set_union2(B_8,A_7) = set_union2(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_41274,plain,
! [B_101422,A_101423] :
( ( set_union2(B_101422,singleton(A_101423)) = B_101422 )
| ~ in(A_101423,B_101422) ),
inference(superposition,[status(thm),theory(equality)],[c_4476,c_8]) ).
tff(c_326,plain,
set_union2(singleton('#skF_30'),'#skF_31') != '#skF_31',
inference(cnfTransformation,[status(thm)],[f_347]) ).
tff(c_370,plain,
set_union2('#skF_31',singleton('#skF_30')) != '#skF_31',
inference(demodulation,[status(thm),theory(equality)],[c_8,c_326]) ).
tff(c_41628,plain,
~ in('#skF_30','#skF_31'),
inference(superposition,[status(thm),theory(equality)],[c_41274,c_370]) ).
tff(c_41717,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_328,c_41628]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SEU161+2 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % 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.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 12:03:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 21.49/7.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.49/7.67
% 21.49/7.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 21.49/7.70
% 21.49/7.70 Inference rules
% 21.49/7.70 ----------------------
% 21.49/7.70 #Ref : 5
% 21.49/7.70 #Sup : 9138
% 21.49/7.70 #Fact : 6
% 21.49/7.70 #Define : 0
% 21.49/7.70 #Split : 9
% 21.49/7.70 #Chain : 0
% 21.49/7.70 #Close : 0
% 21.49/7.70
% 21.49/7.70 Ordering : KBO
% 21.49/7.70
% 21.49/7.70 Simplification rules
% 21.49/7.70 ----------------------
% 21.49/7.70 #Subsume : 4097
% 21.49/7.70 #Demod : 1848
% 21.49/7.70 #Tautology : 1900
% 21.49/7.70 #SimpNegUnit : 225
% 21.49/7.70 #BackRed : 103
% 21.49/7.70
% 21.49/7.70 #Partial instantiations: 48300
% 21.49/7.70 #Strategies tried : 1
% 21.49/7.70
% 21.49/7.70 Timing (in seconds)
% 21.49/7.70 ----------------------
% 21.49/7.70 Preprocessing : 0.73
% 21.49/7.70 Parsing : 0.35
% 21.49/7.70 CNF conversion : 0.07
% 21.49/7.70 Main loop : 5.92
% 21.49/7.70 Inferencing : 1.63
% 21.49/7.70 Reduction : 2.24
% 21.49/7.70 Demodulation : 1.49
% 21.49/7.70 BG Simplification : 0.10
% 21.49/7.70 Subsumption : 1.53
% 21.49/7.70 Abstraction : 0.10
% 21.49/7.70 MUC search : 0.00
% 21.49/7.70 Cooper : 0.00
% 21.49/7.70 Total : 6.69
% 21.49/7.70 Index Insertion : 0.00
% 21.49/7.70 Index Deletion : 0.00
% 21.49/7.70 Index Matching : 0.00
% 21.49/7.70 BG Taut test : 0.00
%------------------------------------------------------------------------------