TSTP Solution File: SET602+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET602+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 : n031.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 8.60s 3.09s
% Output : CNFRefutation 8.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 21
% Syntax : Number of formulae : 35 ( 8 unt; 16 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 12 ~; 9 |; 2 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 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 : 13 ( 13 usr; 2 con; 0-2 aty)
% Number of variables : 34 (; 34 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > equal_set > unordered_pair > union > intersection > difference > #nlpp > sum > singleton > product > power_set > empty_set > #skF_3 > #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(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
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_56,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
tff(f_88,axiom,
! [B,A,E] :
( member(B,difference(E,A))
<=> ( member(B,E)
& ~ member(B,A) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',difference) ).
tff(f_81,axiom,
! [X] : ~ member(X,empty_set),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',empty_set) ).
tff(f_62,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_117,negated_conjecture,
~ ! [E] : equal_set(difference(E,E),empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI29) ).
tff(c_100,plain,
! [A_68,B_69] :
( member('#skF_1'(A_68,B_69),A_68)
| subset(A_68,B_69) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_36,plain,
! [B_17,E_19,A_18] :
( member(B_17,E_19)
| ~ member(B_17,difference(E_19,A_18)) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_129,plain,
! [E_19,A_18,B_69] :
( member('#skF_1'(difference(E_19,A_18),B_69),E_19)
| subset(difference(E_19,A_18),B_69) ),
inference(resolution,[status(thm)],[c_100,c_36]) ).
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_56]) ).
tff(c_138,plain,
! [B_72,A_73,E_74] :
( ~ member(B_72,A_73)
| ~ member(B_72,difference(E_74,A_73)) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_7309,plain,
! [E_412,A_413,B_414] :
( ~ member('#skF_1'(difference(E_412,A_413),B_414),A_413)
| subset(difference(E_412,A_413),B_414) ),
inference(resolution,[status(thm)],[c_6,c_138]) ).
tff(c_7510,plain,
! [E_415,B_416] : subset(difference(E_415,E_415),B_416),
inference(resolution,[status(thm)],[c_129,c_7309]) ).
tff(c_30,plain,
! [X_16] : ~ member(X_16,empty_set),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_135,plain,
! [B_69] : subset(empty_set,B_69),
inference(resolution,[status(thm)],[c_100,c_30]) ).
tff(c_268,plain,
! [A_92,B_93] :
( equal_set(A_92,B_93)
| ~ subset(B_93,A_92)
| ~ subset(A_92,B_93) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_280,plain,
! [B_69] :
( equal_set(B_69,empty_set)
| ~ subset(B_69,empty_set) ),
inference(resolution,[status(thm)],[c_135,c_268]) ).
tff(c_7532,plain,
! [E_415] : equal_set(difference(E_415,E_415),empty_set),
inference(resolution,[status(thm)],[c_7510,c_280]) ).
tff(c_60,plain,
~ equal_set(difference('#skF_4','#skF_4'),empty_set),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_7536,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_7532,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET602+4 : TPTP v8.1.2. Released v2.2.0.
% 0.12/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.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 16:33:44 EDT 2023
% 0.14/0.36 % CPUTime :
% 8.60/3.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.60/3.10
% 8.60/3.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.60/3.12
% 8.60/3.12 Inference rules
% 8.60/3.12 ----------------------
% 8.60/3.12 #Ref : 0
% 8.60/3.12 #Sup : 1634
% 8.60/3.12 #Fact : 0
% 8.60/3.12 #Define : 0
% 8.60/3.12 #Split : 1
% 8.60/3.12 #Chain : 0
% 8.60/3.12 #Close : 0
% 8.60/3.12
% 8.60/3.12 Ordering : KBO
% 8.60/3.12
% 8.60/3.12 Simplification rules
% 8.60/3.12 ----------------------
% 8.60/3.12 #Subsume : 60
% 8.60/3.12 #Demod : 445
% 8.60/3.12 #Tautology : 462
% 8.60/3.12 #SimpNegUnit : 6
% 8.60/3.12 #BackRed : 3
% 8.60/3.12
% 8.60/3.12 #Partial instantiations: 0
% 8.60/3.12 #Strategies tried : 1
% 8.60/3.12
% 8.60/3.12 Timing (in seconds)
% 8.60/3.12 ----------------------
% 8.60/3.13 Preprocessing : 0.50
% 8.60/3.13 Parsing : 0.26
% 8.60/3.13 CNF conversion : 0.04
% 8.60/3.13 Main loop : 1.56
% 8.60/3.13 Inferencing : 0.52
% 8.60/3.13 Reduction : 0.54
% 8.60/3.13 Demodulation : 0.39
% 8.60/3.13 BG Simplification : 0.04
% 8.60/3.13 Subsumption : 0.35
% 8.60/3.13 Abstraction : 0.04
% 8.60/3.13 MUC search : 0.00
% 8.60/3.13 Cooper : 0.00
% 8.60/3.13 Total : 2.10
% 8.60/3.13 Index Insertion : 0.00
% 8.60/3.13 Index Deletion : 0.00
% 8.60/3.13 Index Matching : 0.00
% 8.60/3.13 BG Taut test : 0.00
%------------------------------------------------------------------------------