TSTP Solution File: SEU121+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU121+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 : n027.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:39 EDT 2023
% Result : Theorem 28.50s 16.56s
% Output : CNFRefutation 28.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of formulae : 32 ( 5 unt; 17 typ; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 31 ( 13 ~; 14 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 11 >; 11 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_intersection2 > #nlpp > empty_set > #skF_11 > #skF_1 > #skF_4 > #skF_7 > #skF_5 > #skF_6 > #skF_10 > #skF_9 > #skF_8 > #skF_3 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $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('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(f_81,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
tff(f_46,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(c_58,plain,
subset('#skF_7','#skF_8'),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_56,plain,
subset('#skF_8','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_14,plain,
! [A_9,B_10] :
( in('#skF_2'(A_9,B_10),A_9)
| subset(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_667,plain,
! [C_116,B_117,A_118] :
( in(C_116,B_117)
| ~ in(C_116,A_118)
| ~ subset(A_118,B_117) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_2779,plain,
! [A_234,B_235,B_236] :
( in('#skF_2'(A_234,B_235),B_236)
| ~ subset(A_234,B_236)
| subset(A_234,B_235) ),
inference(resolution,[status(thm)],[c_14,c_667]) ).
tff(c_10,plain,
! [C_13,B_10,A_9] :
( in(C_13,B_10)
| ~ in(C_13,A_9)
| ~ subset(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_143004,plain,
! [A_1690,B_1691,B_1692,B_1693] :
( in('#skF_2'(A_1690,B_1691),B_1692)
| ~ subset(B_1693,B_1692)
| ~ subset(A_1690,B_1693)
| subset(A_1690,B_1691) ),
inference(resolution,[status(thm)],[c_2779,c_10]) ).
tff(c_144097,plain,
! [A_1697,B_1698] :
( in('#skF_2'(A_1697,B_1698),'#skF_9')
| ~ subset(A_1697,'#skF_8')
| subset(A_1697,B_1698) ),
inference(resolution,[status(thm)],[c_56,c_143004]) ).
tff(c_12,plain,
! [A_9,B_10] :
( ~ in('#skF_2'(A_9,B_10),B_10)
| subset(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_144132,plain,
! [A_1699] :
( ~ subset(A_1699,'#skF_8')
| subset(A_1699,'#skF_9') ),
inference(resolution,[status(thm)],[c_144097,c_12]) ).
tff(c_54,plain,
~ subset('#skF_7','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_144224,plain,
~ subset('#skF_7','#skF_8'),
inference(resolution,[status(thm)],[c_144132,c_54]) ).
tff(c_144265,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_144224]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU121+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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 12:07:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 28.50/16.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.50/16.57
% 28.50/16.57 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 28.50/16.59
% 28.50/16.59 Inference rules
% 28.50/16.59 ----------------------
% 28.50/16.59 #Ref : 7
% 28.50/16.59 #Sup : 38424
% 28.50/16.59 #Fact : 0
% 28.50/16.59 #Define : 0
% 28.50/16.59 #Split : 3
% 28.50/16.59 #Chain : 0
% 28.50/16.59 #Close : 0
% 28.50/16.59
% 28.50/16.59 Ordering : KBO
% 28.50/16.59
% 28.50/16.59 Simplification rules
% 28.50/16.59 ----------------------
% 28.50/16.59 #Subsume : 20142
% 28.50/16.59 #Demod : 13686
% 28.50/16.59 #Tautology : 8715
% 28.50/16.59 #SimpNegUnit : 148
% 28.50/16.59 #BackRed : 3
% 28.50/16.59
% 28.50/16.59 #Partial instantiations: 0
% 28.50/16.59 #Strategies tried : 1
% 28.50/16.59
% 28.50/16.59 Timing (in seconds)
% 28.50/16.59 ----------------------
% 28.50/16.60 Preprocessing : 0.49
% 28.50/16.60 Parsing : 0.26
% 28.50/16.60 CNF conversion : 0.04
% 28.50/16.60 Main loop : 15.06
% 28.50/16.60 Inferencing : 1.93
% 28.50/16.60 Reduction : 5.56
% 28.50/16.60 Demodulation : 4.44
% 28.50/16.60 BG Simplification : 0.16
% 28.50/16.60 Subsumption : 6.66
% 28.50/16.60 Abstraction : 0.22
% 28.50/16.60 MUC search : 0.00
% 28.50/16.60 Cooper : 0.00
% 28.50/16.60 Total : 15.60
% 28.50/16.60 Index Insertion : 0.00
% 28.50/16.60 Index Deletion : 0.00
% 28.50/16.60 Index Matching : 0.00
% 28.50/16.60 BG Taut test : 0.00
%------------------------------------------------------------------------------