TSTP Solution File: SEU171+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU171+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/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 : n012.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:54 EDT 2023
% Result : Theorem 11.35s 3.77s
% Output : CNFRefutation 11.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 63
% Syntax : Number of formulae : 90 ( 18 unt; 57 typ; 0 def)
% Number of atoms : 60 ( 13 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 50 ( 23 ~; 13 |; 2 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 109 ( 51 >; 58 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 50 ( 50 usr; 6 con; 0-4 aty)
% Number of variables : 25 (; 24 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > element > disjoint > are_equipotent > empty > unordered_pair > subset_complement > set_union2 > set_intersection2 > set_difference > ordered_pair > cartesian_product2 > #nlpp > union > singleton > powerset > empty_set > #skF_13 > #skF_25 > #skF_24 > #skF_17 > #skF_6 > #skF_18 > #skF_20 > #skF_32 > #skF_36 > #skF_22 > #skF_12 > #skF_31 > #skF_37 > #skF_34 > #skF_15 > #skF_23 > #skF_19 > #skF_28 > #skF_33 > #skF_38 > #skF_11 > #skF_7 > #skF_9 > #skF_26 > #skF_3 > #skF_29 > #skF_2 > #skF_35 > #skF_27 > #skF_8 > #skF_14 > #skF_1 > #skF_16 > #skF_21 > #skF_5 > #skF_30 > #skF_4 > #skF_10 > #skF_39
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff(are_equipotent,type,
are_equipotent: ( $i * $i ) > $o ).
tff('#skF_25',type,
'#skF_25': $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(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff('#skF_32',type,
'#skF_32': ( $i * $i ) > $i ).
tff('#skF_36',type,
'#skF_36': $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_31',type,
'#skF_31': ( $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': $i ).
tff('#skF_34',type,
'#skF_34': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i * $i ) > $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('#skF_28',type,
'#skF_28': $i > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_33',type,
'#skF_33': ( $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_38',type,
'#skF_38': $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_26',type,
'#skF_26': $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_35',type,
'#skF_35': $i ).
tff('#skF_27',type,
'#skF_27': $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(subset_complement,type,
subset_complement: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $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_30',type,
'#skF_30': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff('#skF_39',type,
'#skF_39': ( $i * $i ) > $i ).
tff(f_267,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_505,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_483,negated_conjecture,
~ ! [A] :
( ( A != empty_set )
=> ! [B] :
( element(B,powerset(A))
=> ! [C] :
( element(C,A)
=> ( ~ in(C,B)
=> in(C,subset_complement(A,B)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_subset_1) ).
tff(f_81,axiom,
! [A,B] :
( ( ~ empty(A)
=> ( element(B,A)
<=> in(B,A) ) )
& ( empty(A)
=> ( element(B,A)
<=> empty(B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).
tff(f_147,axiom,
! [A,B,C] :
( ( C = set_difference(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& ~ in(D,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
tff(f_151,axiom,
! [A,B] :
( element(B,powerset(A))
=> ( subset_complement(A,B) = set_difference(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).
tff(c_270,plain,
empty('#skF_27'),
inference(cnfTransformation,[status(thm)],[f_267]) ).
tff(c_486,plain,
! [A_357] :
( ( empty_set = A_357 )
| ~ empty(A_357) ),
inference(cnfTransformation,[status(thm)],[f_505]) ).
tff(c_499,plain,
empty_set = '#skF_27',
inference(resolution,[status(thm)],[c_270,c_486]) ).
tff(c_398,plain,
empty_set != '#skF_35',
inference(cnfTransformation,[status(thm)],[f_483]) ).
tff(c_510,plain,
'#skF_35' != '#skF_27',
inference(demodulation,[status(thm),theory(equality)],[c_499,c_398]) ).
tff(c_394,plain,
element('#skF_37','#skF_35'),
inference(cnfTransformation,[status(thm)],[f_483]) ).
tff(c_2302,plain,
! [B_516,A_517] :
( empty(B_516)
| ~ element(B_516,A_517)
| ~ empty(A_517) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_2327,plain,
( empty('#skF_37')
| ~ empty('#skF_35') ),
inference(resolution,[status(thm)],[c_394,c_2302]) ).
tff(c_2328,plain,
~ empty('#skF_35'),
inference(splitLeft,[status(thm)],[c_2327]) ).
tff(c_48,plain,
! [B_28,A_27] :
( in(B_28,A_27)
| ~ element(B_28,A_27)
| empty(A_27) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_392,plain,
~ in('#skF_37','#skF_36'),
inference(cnfTransformation,[status(thm)],[f_483]) ).
tff(c_10544,plain,
! [D_858,A_859,B_860] :
( in(D_858,set_difference(A_859,B_860))
| in(D_858,B_860)
| ~ in(D_858,A_859) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_396,plain,
element('#skF_36',powerset('#skF_35')),
inference(cnfTransformation,[status(thm)],[f_483]) ).
tff(c_8278,plain,
! [A_813,B_814] :
( ( subset_complement(A_813,B_814) = set_difference(A_813,B_814) )
| ~ element(B_814,powerset(A_813)) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_8312,plain,
subset_complement('#skF_35','#skF_36') = set_difference('#skF_35','#skF_36'),
inference(resolution,[status(thm)],[c_396,c_8278]) ).
tff(c_390,plain,
~ in('#skF_37',subset_complement('#skF_35','#skF_36')),
inference(cnfTransformation,[status(thm)],[f_483]) ).
tff(c_8372,plain,
~ in('#skF_37',set_difference('#skF_35','#skF_36')),
inference(demodulation,[status(thm),theory(equality)],[c_8312,c_390]) ).
tff(c_10547,plain,
( in('#skF_37','#skF_36')
| ~ in('#skF_37','#skF_35') ),
inference(resolution,[status(thm)],[c_10544,c_8372]) ).
tff(c_10704,plain,
~ in('#skF_37','#skF_35'),
inference(negUnitSimplification,[status(thm)],[c_392,c_10547]) ).
tff(c_10751,plain,
( ~ element('#skF_37','#skF_35')
| empty('#skF_35') ),
inference(resolution,[status(thm)],[c_48,c_10704]) ).
tff(c_10755,plain,
empty('#skF_35'),
inference(demodulation,[status(thm),theory(equality)],[c_394,c_10751]) ).
tff(c_10757,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2328,c_10755]) ).
tff(c_10759,plain,
empty('#skF_35'),
inference(splitRight,[status(thm)],[c_2327]) ).
tff(c_410,plain,
! [A_283] :
( ( empty_set = A_283 )
| ~ empty(A_283) ),
inference(cnfTransformation,[status(thm)],[f_505]) ).
tff(c_500,plain,
! [A_283] :
( ( A_283 = '#skF_27' )
| ~ empty(A_283) ),
inference(demodulation,[status(thm),theory(equality)],[c_499,c_410]) ).
tff(c_10771,plain,
'#skF_35' = '#skF_27',
inference(resolution,[status(thm)],[c_10759,c_500]) ).
tff(c_10776,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_510,c_10771]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU171+2 : 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.36 % Computer : n012.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 11:33:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 11.35/3.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.35/3.78
% 11.35/3.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.59/3.81
% 11.59/3.81 Inference rules
% 11.59/3.81 ----------------------
% 11.59/3.81 #Ref : 4
% 11.59/3.81 #Sup : 2565
% 11.59/3.81 #Fact : 0
% 11.59/3.81 #Define : 0
% 11.59/3.81 #Split : 8
% 11.59/3.81 #Chain : 0
% 11.59/3.81 #Close : 0
% 11.59/3.81
% 11.59/3.81 Ordering : KBO
% 11.59/3.81
% 11.59/3.81 Simplification rules
% 11.59/3.81 ----------------------
% 11.59/3.81 #Subsume : 837
% 11.59/3.81 #Demod : 678
% 11.59/3.81 #Tautology : 870
% 11.59/3.81 #SimpNegUnit : 103
% 11.59/3.81 #BackRed : 50
% 11.59/3.81
% 11.59/3.81 #Partial instantiations: 0
% 11.59/3.81 #Strategies tried : 1
% 11.59/3.81
% 11.59/3.81 Timing (in seconds)
% 11.59/3.81 ----------------------
% 11.59/3.81 Preprocessing : 0.82
% 11.59/3.81 Parsing : 0.39
% 11.59/3.81 CNF conversion : 0.09
% 11.59/3.81 Main loop : 1.85
% 11.59/3.81 Inferencing : 0.51
% 11.59/3.81 Reduction : 0.71
% 11.59/3.81 Demodulation : 0.48
% 11.59/3.81 BG Simplification : 0.08
% 11.59/3.81 Subsumption : 0.39
% 11.59/3.81 Abstraction : 0.05
% 11.59/3.81 MUC search : 0.00
% 11.59/3.81 Cooper : 0.00
% 11.59/3.81 Total : 2.72
% 11.59/3.81 Index Insertion : 0.00
% 11.59/3.81 Index Deletion : 0.00
% 11.59/3.81 Index Matching : 0.00
% 11.59/3.81 BG Taut test : 0.00
%------------------------------------------------------------------------------