TSTP Solution File: SEU127+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU127+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 : n026.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:40 EDT 2023
% Result : Theorem 8.65s 3.22s
% Output : CNFRefutation 8.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 23
% Syntax : Number of formulae : 32 ( 7 unt; 19 typ; 0 def)
% Number of atoms : 22 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 4 ~; 4 |; 1 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_union2 > set_intersection2 > #nlpp > empty_set > #skF_11 > #skF_6 > #skF_1 > #skF_7 > #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 * $i ) > $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_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_35,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
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(f_112,negated_conjecture,
~ ! [A,B] : subset(set_intersection2(A,B),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
tff(c_6,plain,
! [B_6,A_5] : ( set_intersection2(B_6,A_5) = set_intersection2(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_750,plain,
! [A_148,B_149] :
( in('#skF_4'(A_148,B_149),A_148)
| subset(A_148,B_149) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_44,plain,
! [D_29,B_25,A_24] :
( in(D_29,B_25)
| ~ in(D_29,set_intersection2(A_24,B_25)) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_9277,plain,
! [A_546,B_547,B_548] :
( in('#skF_4'(set_intersection2(A_546,B_547),B_548),B_547)
| subset(set_intersection2(A_546,B_547),B_548) ),
inference(resolution,[status(thm)],[c_750,c_44]) ).
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_9369,plain,
! [A_549,B_550] : subset(set_intersection2(A_549,B_550),B_550),
inference(resolution,[status(thm)],[c_9277,c_38]) ).
tff(c_9425,plain,
! [B_6,A_5] : subset(set_intersection2(B_6,A_5),B_6),
inference(superposition,[status(thm),theory(equality)],[c_6,c_9369]) ).
tff(c_90,plain,
~ subset(set_intersection2('#skF_9','#skF_10'),'#skF_9'),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_9459,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9425,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU127+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/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.13/0.34 % Computer : n026.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:03:16 EDT 2023
% 0.13/0.34 % CPUTime :
% 8.65/3.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.65/3.23
% 8.65/3.23 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.65/3.25
% 8.65/3.25 Inference rules
% 8.65/3.25 ----------------------
% 8.65/3.25 #Ref : 1
% 8.65/3.25 #Sup : 2491
% 8.65/3.25 #Fact : 6
% 8.65/3.25 #Define : 0
% 8.65/3.25 #Split : 1
% 8.65/3.25 #Chain : 0
% 8.65/3.25 #Close : 0
% 8.65/3.25
% 8.65/3.25 Ordering : KBO
% 8.65/3.25
% 8.65/3.25 Simplification rules
% 8.65/3.25 ----------------------
% 8.65/3.25 #Subsume : 1107
% 8.65/3.25 #Demod : 690
% 8.65/3.25 #Tautology : 542
% 8.65/3.25 #SimpNegUnit : 13
% 8.65/3.25 #BackRed : 8
% 8.65/3.25
% 8.65/3.25 #Partial instantiations: 0
% 8.65/3.25 #Strategies tried : 1
% 8.65/3.25
% 8.65/3.25 Timing (in seconds)
% 8.65/3.25 ----------------------
% 8.65/3.26 Preprocessing : 0.58
% 8.65/3.26 Parsing : 0.30
% 8.65/3.26 CNF conversion : 0.05
% 8.65/3.26 Main loop : 1.47
% 8.65/3.26 Inferencing : 0.47
% 8.65/3.26 Reduction : 0.50
% 8.65/3.26 Demodulation : 0.38
% 8.65/3.26 BG Simplification : 0.05
% 8.65/3.26 Subsumption : 0.36
% 8.65/3.26 Abstraction : 0.05
% 8.65/3.26 MUC search : 0.00
% 8.65/3.26 Cooper : 0.00
% 8.65/3.26 Total : 2.10
% 8.65/3.26 Index Insertion : 0.00
% 8.65/3.26 Index Deletion : 0.00
% 8.65/3.26 Index Matching : 0.00
% 8.65/3.26 BG Taut test : 0.00
%------------------------------------------------------------------------------