TSTP Solution File: SET688+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET688+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n011.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 36.60s 25.73s
% Output : CNFRefutation 36.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 49 ( 12 unt; 18 typ; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 62 ( 29 ~; 25 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 40 (; 40 !; 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_129,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& ~ equal_set(A,B)
& subset(B,C)
& ~ equal_set(B,C) )
=> ~ equal_set(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI04) ).
tff(f_63,axiom,
! [A,B] :
( equal_set(A,B)
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
tff(c_62,plain,
~ equal_set('#skF_5','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_64,plain,
subset('#skF_5','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_60,plain,
equal_set('#skF_4','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_10,plain,
! [B_7,A_6] :
( subset(B_7,A_6)
| ~ equal_set(A_6,B_7) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_12,plain,
! [A_6,B_7] :
( subset(A_6,B_7)
| ~ equal_set(A_6,B_7) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_298,plain,
! [A_97,B_98] :
( equal_set(A_97,B_98)
| ~ subset(B_98,A_97)
| ~ subset(A_97,B_98) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_1807,plain,
! [B_207,A_208] :
( equal_set(B_207,A_208)
| ~ subset(B_207,A_208)
| ~ equal_set(A_208,B_207) ),
inference(resolution,[status(thm)],[c_12,c_298]) ).
tff(c_1938,plain,
! [B_210,A_211] :
( equal_set(B_210,A_211)
| ~ equal_set(A_211,B_210) ),
inference(resolution,[status(thm)],[c_10,c_1807]) ).
tff(c_1967,plain,
equal_set('#skF_6','#skF_4'),
inference(resolution,[status(thm)],[c_60,c_1938]) ).
tff(c_68,plain,
subset('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_129]) ).
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_225,plain,
! [X_85,B_86,A_87] :
( member(X_85,B_86)
| ~ member(X_85,A_87)
| ~ subset(A_87,B_86) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_4601,plain,
! [A_299,B_300,B_301] :
( member('#skF_1'(A_299,B_300),B_301)
| ~ subset(A_299,B_301)
| subset(A_299,B_300) ),
inference(resolution,[status(thm)],[c_6,c_225]) ).
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_82934,plain,
! [A_1751,B_1752,B_1753,B_1754] :
( member('#skF_1'(A_1751,B_1752),B_1753)
| ~ subset(B_1754,B_1753)
| ~ subset(A_1751,B_1754)
| subset(A_1751,B_1752) ),
inference(resolution,[status(thm)],[c_4601,c_2]) ).
tff(c_84147,plain,
! [A_1761,B_1762] :
( member('#skF_1'(A_1761,B_1762),'#skF_5')
| ~ subset(A_1761,'#skF_4')
| subset(A_1761,B_1762) ),
inference(resolution,[status(thm)],[c_68,c_82934]) ).
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_84220,plain,
! [A_1763] :
( ~ subset(A_1763,'#skF_4')
| subset(A_1763,'#skF_5') ),
inference(resolution,[status(thm)],[c_84147,c_4]) ).
tff(c_320,plain,
( equal_set('#skF_6','#skF_5')
| ~ subset('#skF_6','#skF_5') ),
inference(resolution,[status(thm)],[c_64,c_298]) ).
tff(c_335,plain,
~ subset('#skF_6','#skF_5'),
inference(splitLeft,[status(thm)],[c_320]) ).
tff(c_84358,plain,
~ subset('#skF_6','#skF_4'),
inference(resolution,[status(thm)],[c_84220,c_335]) ).
tff(c_84370,plain,
~ equal_set('#skF_6','#skF_4'),
inference(resolution,[status(thm)],[c_12,c_84358]) ).
tff(c_84379,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1967,c_84370]) ).
tff(c_84381,plain,
subset('#skF_6','#skF_5'),
inference(splitRight,[status(thm)],[c_320]) ).
tff(c_8,plain,
! [A_6,B_7] :
( equal_set(A_6,B_7)
| ~ subset(B_7,A_6)
| ~ subset(A_6,B_7) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_84383,plain,
( equal_set('#skF_5','#skF_6')
| ~ subset('#skF_5','#skF_6') ),
inference(resolution,[status(thm)],[c_84381,c_8]) ).
tff(c_84386,plain,
equal_set('#skF_5','#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_84383]) ).
tff(c_84388,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_62,c_84386]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET688+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 16:46:35 EDT 2023
% 0.15/0.37 % CPUTime :
% 36.60/25.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 36.60/25.74
% 36.60/25.74 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 36.80/25.77
% 36.80/25.77 Inference rules
% 36.80/25.77 ----------------------
% 36.80/25.77 #Ref : 0
% 36.80/25.77 #Sup : 19559
% 36.80/25.77 #Fact : 6
% 36.80/25.77 #Define : 0
% 36.80/25.77 #Split : 3
% 36.80/25.77 #Chain : 0
% 36.80/25.77 #Close : 0
% 36.80/25.77
% 36.80/25.77 Ordering : KBO
% 36.80/25.77
% 36.80/25.77 Simplification rules
% 36.80/25.77 ----------------------
% 36.80/25.77 #Subsume : 1384
% 36.80/25.77 #Demod : 3436
% 36.80/25.77 #Tautology : 3475
% 36.80/25.77 #SimpNegUnit : 116
% 36.80/25.77 #BackRed : 4
% 36.80/25.77
% 36.80/25.77 #Partial instantiations: 0
% 36.80/25.77 #Strategies tried : 1
% 36.80/25.77
% 36.80/25.77 Timing (in seconds)
% 36.80/25.77 ----------------------
% 36.80/25.77 Preprocessing : 0.51
% 36.80/25.77 Parsing : 0.27
% 36.80/25.77 CNF conversion : 0.04
% 36.80/25.77 Main loop : 24.18
% 36.80/25.77 Inferencing : 2.82
% 36.80/25.77 Reduction : 12.53
% 36.80/25.77 Demodulation : 9.99
% 36.80/25.77 BG Simplification : 0.13
% 36.80/25.77 Subsumption : 7.24
% 36.80/25.77 Abstraction : 0.17
% 36.80/25.77 MUC search : 0.00
% 36.80/25.77 Cooper : 0.00
% 36.80/25.77 Total : 24.74
% 36.80/25.77 Index Insertion : 0.00
% 36.80/25.77 Index Deletion : 0.00
% 36.80/25.77 Index Matching : 0.00
% 36.80/25.77 BG Taut test : 0.00
%------------------------------------------------------------------------------