TSTP Solution File: SET618+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET618+3 : TPTP v8.1.2. Released v2.2.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 : n029.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:56:43 EDT 2023
% Result : Theorem 3.00s 1.85s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of formulae : 23 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 10 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > empty > union > symmetric_difference > difference > #nlpp > empty_set > #skF_4 > #skF_3 > #skF_5 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff(symmetric_difference,type,
symmetric_difference: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_35,axiom,
! [B] : ( difference(B,B) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',self_difference_is_empty_set) ).
tff(f_29,axiom,
! [B,C] : ( symmetric_difference(B,C) = union(difference(B,C),difference(C,B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetric_difference_defn) ).
tff(f_32,axiom,
! [B] : ( union(B,B) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotency_of_union) ).
tff(f_82,negated_conjecture,
~ ! [B] : ( symmetric_difference(B,B) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th93) ).
tff(c_6,plain,
! [B_4] : ( difference(B_4,B_4) = empty_set ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_219,plain,
! [B_54,C_55] : ( union(difference(B_54,C_55),difference(C_55,B_54)) = symmetric_difference(B_54,C_55) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_4,plain,
! [B_3] : ( union(B_3,B_3) = B_3 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_232,plain,
! [C_55] : ( symmetric_difference(C_55,C_55) = difference(C_55,C_55) ),
inference(superposition,[status(thm),theory(equality)],[c_219,c_4]) ).
tff(c_253,plain,
! [C_55] : ( symmetric_difference(C_55,C_55) = empty_set ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_232]) ).
tff(c_44,plain,
symmetric_difference('#skF_5','#skF_5') != empty_set,
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_260,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_253,c_44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET618+3 : TPTP v8.1.2. Released v2.2.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.14/0.34 % Computer : n029.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 16:42:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 3.00/1.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/1.85
% 3.26/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.26/1.87
% 3.26/1.87 Inference rules
% 3.26/1.87 ----------------------
% 3.26/1.87 #Ref : 0
% 3.26/1.87 #Sup : 47
% 3.26/1.87 #Fact : 0
% 3.26/1.87 #Define : 0
% 3.26/1.87 #Split : 0
% 3.26/1.87 #Chain : 0
% 3.26/1.87 #Close : 0
% 3.26/1.87
% 3.26/1.87 Ordering : KBO
% 3.26/1.87
% 3.26/1.87 Simplification rules
% 3.26/1.87 ----------------------
% 3.26/1.87 #Subsume : 1
% 3.26/1.87 #Demod : 11
% 3.26/1.87 #Tautology : 33
% 3.26/1.87 #SimpNegUnit : 0
% 3.26/1.87 #BackRed : 1
% 3.26/1.87
% 3.26/1.87 #Partial instantiations: 0
% 3.26/1.87 #Strategies tried : 1
% 3.26/1.87
% 3.26/1.87 Timing (in seconds)
% 3.26/1.87 ----------------------
% 3.26/1.88 Preprocessing : 0.50
% 3.26/1.88 Parsing : 0.26
% 3.26/1.88 CNF conversion : 0.03
% 3.26/1.88 Main loop : 0.26
% 3.26/1.88 Inferencing : 0.10
% 3.26/1.88 Reduction : 0.07
% 3.26/1.88 Demodulation : 0.06
% 3.26/1.88 BG Simplification : 0.02
% 3.26/1.88 Subsumption : 0.05
% 3.26/1.88 Abstraction : 0.01
% 3.26/1.88 MUC search : 0.00
% 3.26/1.88 Cooper : 0.00
% 3.26/1.88 Total : 0.79
% 3.26/1.88 Index Insertion : 0.00
% 3.26/1.88 Index Deletion : 0.00
% 3.26/1.88 Index Matching : 0.00
% 3.26/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------