TSTP Solution File: SET689+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET689+4 : 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 : n017.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:53 EDT 2023
% Result : Theorem 57.92s 45.61s
% Output : CNFRefutation 57.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 38 ( 7 unt; 18 typ; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 40 ( 16 ~; 17 |; 3 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 14 >; 10 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 4 con; 0-2 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > equal_set > unordered_pair > union > intersection > difference > #nlpp > sum > singleton > product > power_set > empty_set > #skF_3 > #skF_5 > #skF_6 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(equal_set,type,
equal_set: ( $i * $i ) > $o ).
tff(power_set,type,
power_set: $i > $i ).
tff(product,type,
product: $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(sum,type,
sum: $i > $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(union,type,
union: ( $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_6',type,
'#skF_6': $i ).
tff(empty_set,type,
empty_set: $i ).
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_124,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(B,C)
& subset(C,A) )
=> equal_set(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI05) ).
tff(f_63,axiom,
! [A,B] :
( equal_set(A,B)
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
tff(f_57,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
tff(c_60,plain,
~ equal_set('#skF_4','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_62,plain,
subset('#skF_6','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_235,plain,
! [A_106,B_107] :
( equal_set(A_106,B_107)
| ~ subset(B_107,A_106)
| ~ subset(A_106,B_107) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_245,plain,
( equal_set('#skF_4','#skF_6')
| ~ subset('#skF_4','#skF_6') ),
inference(resolution,[status(thm)],[c_62,c_235]) ).
tff(c_258,plain,
~ subset('#skF_4','#skF_6'),
inference(negUnitSimplification,[status(thm)],[c_60,c_245]) ).
tff(c_66,plain,
subset('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_64,plain,
subset('#skF_5','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_6,plain,
! [A_1,B_2] :
( member('#skF_1'(A_1,B_2),A_1)
| subset(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_150,plain,
! [X_75,B_76,A_77] :
( member(X_75,B_76)
| ~ member(X_75,A_77)
| ~ subset(A_77,B_76) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_92644,plain,
! [A_1989,B_1990,B_1991] :
( member('#skF_1'(A_1989,B_1990),B_1991)
| ~ subset(A_1989,B_1991)
| subset(A_1989,B_1990) ),
inference(resolution,[status(thm)],[c_6,c_150]) ).
tff(c_2,plain,
! [X_5,B_2,A_1] :
( member(X_5,B_2)
| ~ member(X_5,A_1)
| ~ subset(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_163652,plain,
! [A_3252,B_3253,B_3254,B_3255] :
( member('#skF_1'(A_3252,B_3253),B_3254)
| ~ subset(B_3255,B_3254)
| ~ subset(A_3252,B_3255)
| subset(A_3252,B_3253) ),
inference(resolution,[status(thm)],[c_92644,c_2]) ).
tff(c_165624,plain,
! [A_3268,B_3269] :
( member('#skF_1'(A_3268,B_3269),'#skF_6')
| ~ subset(A_3268,'#skF_5')
| subset(A_3268,B_3269) ),
inference(resolution,[status(thm)],[c_64,c_163652]) ).
tff(c_4,plain,
! [A_1,B_2] :
( ~ member('#skF_1'(A_1,B_2),B_2)
| subset(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_165820,plain,
! [A_3271] :
( ~ subset(A_3271,'#skF_5')
| subset(A_3271,'#skF_6') ),
inference(resolution,[status(thm)],[c_165624,c_4]) ).
tff(c_166199,plain,
subset('#skF_4','#skF_6'),
inference(resolution,[status(thm)],[c_66,c_165820]) ).
tff(c_166360,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_258,c_166199]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET689+4 : 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.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 15:42:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 57.92/45.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 57.92/45.61
% 57.92/45.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 57.92/45.64
% 57.92/45.64 Inference rules
% 57.92/45.64 ----------------------
% 57.92/45.64 #Ref : 0
% 57.92/45.64 #Sup : 38478
% 57.92/45.64 #Fact : 12
% 57.92/45.64 #Define : 0
% 57.92/45.64 #Split : 6
% 57.92/45.64 #Chain : 0
% 57.92/45.64 #Close : 0
% 57.92/45.64
% 57.92/45.64 Ordering : KBO
% 57.92/45.64
% 57.92/45.64 Simplification rules
% 57.92/45.64 ----------------------
% 57.92/45.64 #Subsume : 2506
% 57.92/45.64 #Demod : 7179
% 57.92/45.64 #Tautology : 7246
% 57.92/45.64 #SimpNegUnit : 236
% 57.92/45.64 #BackRed : 8
% 57.92/45.64
% 57.92/45.64 #Partial instantiations: 0
% 57.92/45.64 #Strategies tried : 1
% 57.92/45.64
% 57.92/45.64 Timing (in seconds)
% 57.92/45.64 ----------------------
% 57.92/45.64 Preprocessing : 0.51
% 57.92/45.64 Parsing : 0.27
% 57.92/45.64 CNF conversion : 0.04
% 57.92/45.64 Main loop : 44.06
% 57.92/45.64 Inferencing : 4.74
% 57.92/45.64 Reduction : 23.20
% 57.92/45.64 Demodulation : 18.62
% 57.92/45.64 BG Simplification : 0.20
% 57.92/45.64 Subsumption : 13.44
% 57.92/45.64 Abstraction : 0.28
% 57.92/45.64 MUC search : 0.00
% 57.92/45.64 Cooper : 0.00
% 57.92/45.64 Total : 44.62
% 57.92/45.64 Index Insertion : 0.00
% 57.92/45.64 Index Deletion : 0.00
% 57.92/45.64 Index Matching : 0.00
% 57.92/45.64 BG Taut test : 0.00
%------------------------------------------------------------------------------