TSTP Solution File: SEU124+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU124+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 : n022.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.12s 3.03s
% Output : CNFRefutation 8.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% 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 : 15 ( 6 ~; 5 |; 0 &)
% ( 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 : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_union2 > set_intersection2 > #nlpp > empty_set > #skF_11 > #skF_6 > #skF_1 > #skF_7 > #skF_5 > #skF_10 > #skF_2 > #skF_8 > #skF_3 > #skF_9 > #skF_12 > #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(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_10',type,
'#skF_10': ( $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(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_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
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_56,axiom,
! [A,B,C] :
( ( C = set_union2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
tff(f_33,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(f_163,negated_conjecture,
~ ! [A,B] : subset(A,set_union2(A,B)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
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_20,plain,
! [D_18,B_14,A_13] :
( ~ in(D_18,B_14)
| in(D_18,set_union2(A_13,B_14)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_685,plain,
! [A_136,B_137] :
( ~ in('#skF_4'(A_136,B_137),B_137)
| subset(A_136,B_137) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_6605,plain,
! [A_469,A_470,B_471] :
( subset(A_469,set_union2(A_470,B_471))
| ~ in('#skF_4'(A_469,set_union2(A_470,B_471)),B_471) ),
inference(resolution,[status(thm)],[c_20,c_685]) ).
tff(c_6644,plain,
! [A_19,A_470] : subset(A_19,set_union2(A_470,A_19)),
inference(resolution,[status(thm)],[c_40,c_6605]) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_union2(B_4,A_3) = set_union2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_110,plain,
~ subset('#skF_11',set_union2('#skF_11','#skF_12')),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_115,plain,
~ subset('#skF_11',set_union2('#skF_12','#skF_11')),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_110]) ).
tff(c_6651,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6644,c_115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU124+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/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.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 12:07:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 8.12/3.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.12/3.04
% 8.12/3.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.12/3.07
% 8.12/3.07 Inference rules
% 8.12/3.07 ----------------------
% 8.12/3.07 #Ref : 3
% 8.12/3.07 #Sup : 1581
% 8.12/3.07 #Fact : 6
% 8.12/3.07 #Define : 0
% 8.12/3.07 #Split : 0
% 8.12/3.07 #Chain : 0
% 8.12/3.07 #Close : 0
% 8.12/3.07
% 8.12/3.07 Ordering : KBO
% 8.12/3.07
% 8.12/3.07 Simplification rules
% 8.12/3.07 ----------------------
% 8.12/3.07 #Subsume : 685
% 8.12/3.07 #Demod : 229
% 8.12/3.07 #Tautology : 268
% 8.12/3.07 #SimpNegUnit : 24
% 8.12/3.07 #BackRed : 6
% 8.12/3.07
% 8.12/3.07 #Partial instantiations: 0
% 8.12/3.07 #Strategies tried : 1
% 8.12/3.07
% 8.12/3.07 Timing (in seconds)
% 8.12/3.07 ----------------------
% 8.35/3.07 Preprocessing : 0.56
% 8.35/3.07 Parsing : 0.29
% 8.35/3.07 CNF conversion : 0.05
% 8.35/3.07 Main loop : 1.42
% 8.35/3.07 Inferencing : 0.47
% 8.35/3.07 Reduction : 0.43
% 8.35/3.07 Demodulation : 0.32
% 8.35/3.07 BG Simplification : 0.05
% 8.35/3.07 Subsumption : 0.39
% 8.35/3.07 Abstraction : 0.05
% 8.35/3.07 MUC search : 0.00
% 8.35/3.07 Cooper : 0.00
% 8.35/3.07 Total : 2.04
% 8.35/3.07 Index Insertion : 0.00
% 8.35/3.07 Index Deletion : 0.00
% 8.35/3.07 Index Matching : 0.00
% 8.35/3.07 BG Taut test : 0.00
%------------------------------------------------------------------------------