TSTP Solution File: SET599+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET599+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 : n006.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:40 EDT 2023
% Result : Theorem 3.04s 1.84s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of formulae : 18 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 8 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 8 >; 8 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > union > symmetric_difference > difference > #nlpp > #skF_3 > #skF_5 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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('#skF_4',type,
'#skF_4': $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_30,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_33,axiom,
! [B,C] : subset(B,union(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_union) ).
tff(f_70,negated_conjecture,
~ ! [B,C] : subset(difference(B,C),symmetric_difference(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th58) ).
tff(c_145,plain,
! [B_45,C_46] : ( union(difference(B_45,C_46),difference(C_46,B_45)) = symmetric_difference(B_45,C_46) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_4,plain,
! [B_3,C_4] : subset(B_3,union(B_3,C_4)),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_160,plain,
! [B_45,C_46] : subset(difference(B_45,C_46),symmetric_difference(B_45,C_46)),
inference(superposition,[status(thm),theory(equality)],[c_145,c_4]) ).
tff(c_36,plain,
~ subset(difference('#skF_4','#skF_5'),symmetric_difference('#skF_4','#skF_5')),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_174,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_160,c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET599+3 : TPTP v8.1.2. Released v2.2.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 : n006.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 16:42:29 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.04/1.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.04/1.85
% 3.04/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.16/1.87
% 3.16/1.87 Inference rules
% 3.16/1.87 ----------------------
% 3.16/1.87 #Ref : 0
% 3.16/1.87 #Sup : 32
% 3.16/1.87 #Fact : 0
% 3.16/1.87 #Define : 0
% 3.16/1.87 #Split : 0
% 3.16/1.87 #Chain : 0
% 3.16/1.87 #Close : 0
% 3.16/1.87
% 3.16/1.87 Ordering : KBO
% 3.16/1.87
% 3.16/1.87 Simplification rules
% 3.16/1.87 ----------------------
% 3.16/1.87 #Subsume : 0
% 3.16/1.87 #Demod : 5
% 3.16/1.87 #Tautology : 24
% 3.16/1.87 #SimpNegUnit : 0
% 3.16/1.87 #BackRed : 1
% 3.16/1.87
% 3.16/1.87 #Partial instantiations: 0
% 3.16/1.87 #Strategies tried : 1
% 3.16/1.87
% 3.16/1.87 Timing (in seconds)
% 3.16/1.87 ----------------------
% 3.16/1.87 Preprocessing : 0.47
% 3.16/1.87 Parsing : 0.25
% 3.16/1.87 CNF conversion : 0.03
% 3.16/1.87 Main loop : 0.22
% 3.16/1.87 Inferencing : 0.08
% 3.16/1.87 Reduction : 0.08
% 3.16/1.87 Demodulation : 0.06
% 3.16/1.87 BG Simplification : 0.01
% 3.16/1.87 Subsumption : 0.05
% 3.16/1.87 Abstraction : 0.01
% 3.16/1.87 MUC search : 0.00
% 3.16/1.87 Cooper : 0.00
% 3.16/1.87 Total : 0.73
% 3.16/1.87 Index Insertion : 0.00
% 3.16/1.87 Index Deletion : 0.00
% 3.16/1.87 Index Matching : 0.00
% 3.16/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------