TSTP Solution File: SEU128+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU128+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 : n019.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:41 EDT 2023
% Result : Theorem 129.20s 112.42s
% Output : CNFRefutation 129.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 24
% Syntax : Number of formulae : 42 ( 6 unt; 20 typ; 0 def)
% Number of atoms : 53 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 22 ~; 24 |; 2 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 14 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 46 (; 46 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_union2 > set_intersection2 > #nlpp > empty_set > #skF_11 > #skF_6 > #skF_1 > #skF_7 > #skF_13 > #skF_10 > #skF_12 > #skF_5 > #skF_2 > #skF_9 > #skF_8 > #skF_3 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_101,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_118,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(A,C) )
=> subset(A,set_intersection2(B,C)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_xboole_1) ).
tff(f_63,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_72,axiom,
! [A,B,C] :
( ( C = set_intersection2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
tff(c_84,plain,
! [A_40] : subset(A_40,A_40),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_94,plain,
subset('#skF_9','#skF_11'),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_96,plain,
subset('#skF_9','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_40,plain,
! [A_19,B_20] :
( in('#skF_4'(A_19,B_20),A_19)
| subset(A_19,B_20) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_1968,plain,
! [C_226,B_227,A_228] :
( in(C_226,B_227)
| ~ in(C_226,A_228)
| ~ subset(A_228,B_227) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_16930,plain,
! [A_596,B_597,B_598] :
( in('#skF_4'(A_596,B_597),B_598)
| ~ subset(A_596,B_598)
| subset(A_596,B_597) ),
inference(resolution,[status(thm)],[c_40,c_1968]) ).
tff(c_36,plain,
! [C_23,B_20,A_19] :
( in(C_23,B_20)
| ~ in(C_23,A_19)
| ~ subset(A_19,B_20) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_420982,plain,
! [A_3375,B_3376,B_3377,B_3378] :
( in('#skF_4'(A_3375,B_3376),B_3377)
| ~ subset(B_3378,B_3377)
| ~ subset(A_3375,B_3378)
| subset(A_3375,B_3376) ),
inference(resolution,[status(thm)],[c_16930,c_36]) ).
tff(c_421413,plain,
! [A_3375,B_3376] :
( in('#skF_4'(A_3375,B_3376),'#skF_10')
| ~ subset(A_3375,'#skF_9')
| subset(A_3375,B_3376) ),
inference(resolution,[status(thm)],[c_96,c_420982]) ).
tff(c_1987,plain,
! [A_19,B_20,B_227] :
( in('#skF_4'(A_19,B_20),B_227)
| ~ subset(A_19,B_227)
| subset(A_19,B_20) ),
inference(resolution,[status(thm)],[c_40,c_1968]) ).
tff(c_3471,plain,
! [D_268,A_269,B_270] :
( in(D_268,set_intersection2(A_269,B_270))
| ~ in(D_268,B_270)
| ~ in(D_268,A_269) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_38,plain,
! [A_19,B_20] :
( ~ in('#skF_4'(A_19,B_20),B_20)
| subset(A_19,B_20) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_62786,plain,
! [A_1120,A_1121,B_1122] :
( subset(A_1120,set_intersection2(A_1121,B_1122))
| ~ in('#skF_4'(A_1120,set_intersection2(A_1121,B_1122)),B_1122)
| ~ in('#skF_4'(A_1120,set_intersection2(A_1121,B_1122)),A_1121) ),
inference(resolution,[status(thm)],[c_3471,c_38]) ).
tff(c_457627,plain,
! [A_3582,A_3583,B_3584] :
( ~ in('#skF_4'(A_3582,set_intersection2(A_3583,B_3584)),A_3583)
| ~ subset(A_3582,B_3584)
| subset(A_3582,set_intersection2(A_3583,B_3584)) ),
inference(resolution,[status(thm)],[c_1987,c_62786]) ).
tff(c_477280,plain,
! [A_3713,B_3714] :
( ~ subset(A_3713,B_3714)
| ~ subset(A_3713,'#skF_9')
| subset(A_3713,set_intersection2('#skF_10',B_3714)) ),
inference(resolution,[status(thm)],[c_421413,c_457627]) ).
tff(c_92,plain,
~ subset('#skF_9',set_intersection2('#skF_10','#skF_11')),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_477798,plain,
( ~ subset('#skF_9','#skF_11')
| ~ subset('#skF_9','#skF_9') ),
inference(resolution,[status(thm)],[c_477280,c_92]) ).
tff(c_478063,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_84,c_94,c_477798]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 11:57:46 EDT 2023
% 0.15/0.36 % CPUTime :
% 129.20/112.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 129.20/112.43
% 129.20/112.43 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 129.32/112.46
% 129.32/112.46 Inference rules
% 129.32/112.46 ----------------------
% 129.32/112.46 #Ref : 6
% 129.32/112.46 #Sup : 134105
% 129.32/112.46 #Fact : 82
% 129.32/112.46 #Define : 0
% 129.32/112.46 #Split : 28
% 129.32/112.46 #Chain : 0
% 129.32/112.46 #Close : 0
% 129.32/112.46
% 129.32/112.46 Ordering : KBO
% 129.32/112.46
% 129.32/112.46 Simplification rules
% 129.32/112.46 ----------------------
% 129.32/112.46 #Subsume : 71252
% 129.32/112.46 #Demod : 57548
% 129.32/112.46 #Tautology : 22252
% 129.32/112.46 #SimpNegUnit : 3175
% 129.32/112.46 #BackRed : 180
% 129.32/112.46
% 129.32/112.46 #Partial instantiations: 0
% 129.32/112.46 #Strategies tried : 1
% 129.32/112.46
% 129.32/112.46 Timing (in seconds)
% 129.32/112.46 ----------------------
% 129.32/112.46 Preprocessing : 0.57
% 129.32/112.46 Parsing : 0.29
% 129.32/112.46 CNF conversion : 0.05
% 129.32/112.46 Main loop : 110.81
% 129.32/112.46 Inferencing : 7.79
% 129.32/112.46 Reduction : 51.76
% 129.32/112.46 Demodulation : 42.51
% 129.32/112.46 BG Simplification : 0.47
% 129.32/112.46 Subsumption : 41.91
% 129.32/112.46 Abstraction : 0.80
% 129.32/112.46 MUC search : 0.00
% 129.32/112.46 Cooper : 0.00
% 129.32/112.46 Total : 111.43
% 129.32/112.46 Index Insertion : 0.00
% 129.32/112.46 Index Deletion : 0.00
% 129.32/112.46 Index Matching : 0.00
% 129.32/112.46 BG Taut test : 0.00
%------------------------------------------------------------------------------