TSTP Solution File: SEU163+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU163+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 : n014.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:51 EDT 2023
% Result : Theorem 5.35s 2.36s
% Output : CNFRefutation 5.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 49
% Syntax : Number of formulae : 54 ( 4 unt; 47 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 96 ( 42 >; 54 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 5 con; 0-4 aty)
% Number of variables : 6 (; 6 !; 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_30 > #skF_31 > #skF_25 > #skF_18 > #skF_20 > #skF_22 > #skF_12 > #skF_15 > #skF_26 > #skF_23 > #skF_19 > #skF_11 > #skF_32 > #skF_7 > #skF_9 > #skF_28 > #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_30',type,
'#skF_30': ( $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(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_32',type,
'#skF_32': $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_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_424,negated_conjecture,
~ ! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t92_zfmisc_1) ).
tff(f_212,lemma,
! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).
tff(c_366,plain,
in('#skF_31','#skF_32'),
inference(cnfTransformation,[status(thm)],[f_424]) ).
tff(c_1247,plain,
! [A_344,B_345] :
( subset(A_344,union(B_345))
| ~ in(A_344,B_345) ),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_364,plain,
~ subset('#skF_31',union('#skF_32')),
inference(cnfTransformation,[status(thm)],[f_424]) ).
tff(c_1253,plain,
~ in('#skF_31','#skF_32'),
inference(resolution,[status(thm)],[c_1247,c_364]) ).
tff(c_1258,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_366,c_1253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU163+2 : 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.13/0.34 % Computer : n014.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:08:18 EDT 2023
% 0.20/0.34 % CPUTime :
% 5.35/2.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.35/2.36
% 5.35/2.36 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.35/2.39
% 5.35/2.39 Inference rules
% 5.35/2.39 ----------------------
% 5.35/2.39 #Ref : 0
% 5.35/2.39 #Sup : 209
% 5.35/2.39 #Fact : 0
% 5.35/2.39 #Define : 0
% 5.35/2.39 #Split : 0
% 5.35/2.39 #Chain : 0
% 5.35/2.39 #Close : 0
% 5.35/2.39
% 5.35/2.39 Ordering : KBO
% 5.35/2.39
% 5.35/2.39 Simplification rules
% 5.35/2.39 ----------------------
% 5.35/2.39 #Subsume : 56
% 5.35/2.39 #Demod : 76
% 5.35/2.39 #Tautology : 143
% 5.35/2.39 #SimpNegUnit : 7
% 5.35/2.39 #BackRed : 6
% 5.35/2.39
% 5.35/2.39 #Partial instantiations: 0
% 5.35/2.39 #Strategies tried : 1
% 5.35/2.39
% 5.35/2.39 Timing (in seconds)
% 5.35/2.39 ----------------------
% 5.35/2.39 Preprocessing : 0.77
% 5.35/2.39 Parsing : 0.37
% 5.35/2.39 CNF conversion : 0.08
% 5.35/2.39 Main loop : 0.57
% 5.35/2.39 Inferencing : 0.14
% 5.35/2.39 Reduction : 0.22
% 5.35/2.39 Demodulation : 0.15
% 5.35/2.39 BG Simplification : 0.05
% 5.35/2.39 Subsumption : 0.12
% 5.35/2.39 Abstraction : 0.03
% 5.35/2.39 MUC search : 0.00
% 5.35/2.39 Cooper : 0.00
% 5.35/2.39 Total : 1.38
% 5.35/2.39 Index Insertion : 0.00
% 5.35/2.39 Index Deletion : 0.00
% 5.35/2.39 Index Matching : 0.00
% 5.35/2.39 BG Taut test : 0.00
%------------------------------------------------------------------------------