TSTP Solution File: SET148+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET148+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 : n012.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:05 EDT 2023
% Result : Theorem 21.89s 10.96s
% Output : CNFRefutation 21.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of formulae : 35 ( 6 unt; 16 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 31 ( 12 ~; 13 |; 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 : 36 (; 36 !; 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_72,axiom,
! [X,A,B] :
( member(X,intersection(A,B))
<=> ( member(X,A)
& member(X,B) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',intersection) ).
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,
~ ! [A] : equal_set(intersection(A,A),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI13) ).
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_22,plain,
! [X_10,A_11,B_12] :
( member(X_10,A_11)
| ~ member(X_10,intersection(A_11,B_12)) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_6219,plain,
! [A_363,B_364,B_365] :
( member('#skF_1'(intersection(A_363,B_364),B_365),A_363)
| subset(intersection(A_363,B_364),B_365) ),
inference(resolution,[status(thm)],[c_100,c_22]) ).
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_56]) ).
tff(c_6336,plain,
! [A_363,B_364] : subset(intersection(A_363,B_364),A_363),
inference(resolution,[status(thm)],[c_6219,c_4]) ).
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_638,plain,
! [X_126,A_127,B_128] :
( member(X_126,intersection(A_127,B_128))
| ~ member(X_126,B_128)
| ~ member(X_126,A_127) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_19971,plain,
! [A_842,A_843,B_844] :
( subset(A_842,intersection(A_843,B_844))
| ~ member('#skF_1'(A_842,intersection(A_843,B_844)),B_844)
| ~ member('#skF_1'(A_842,intersection(A_843,B_844)),A_843) ),
inference(resolution,[status(thm)],[c_638,c_4]) ).
tff(c_41782,plain,
! [A_1287,A_1288] :
( ~ member('#skF_1'(A_1287,intersection(A_1288,A_1287)),A_1288)
| subset(A_1287,intersection(A_1288,A_1287)) ),
inference(resolution,[status(thm)],[c_6,c_19971]) ).
tff(c_42347,plain,
! [A_1289] : subset(A_1289,intersection(A_1289,A_1289)),
inference(resolution,[status(thm)],[c_6,c_41782]) ).
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_62]) ).
tff(c_42403,plain,
! [A_1289] :
( equal_set(intersection(A_1289,A_1289),A_1289)
| ~ subset(intersection(A_1289,A_1289),A_1289) ),
inference(resolution,[status(thm)],[c_42347,c_8]) ).
tff(c_42430,plain,
! [A_1289] : equal_set(intersection(A_1289,A_1289),A_1289),
inference(demodulation,[status(thm),theory(equality)],[c_6336,c_42403]) ).
tff(c_60,plain,
~ equal_set(intersection('#skF_4','#skF_4'),'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_42435,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_42430,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET148+4 : 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 : n012.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:17:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 21.89/10.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.89/10.96
% 21.89/10.96 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 21.93/10.98
% 21.93/10.98 Inference rules
% 21.93/10.98 ----------------------
% 21.93/10.98 #Ref : 0
% 21.93/10.98 #Sup : 9724
% 21.93/10.98 #Fact : 6
% 21.93/10.98 #Define : 0
% 21.93/10.98 #Split : 1
% 21.93/10.98 #Chain : 0
% 21.93/10.98 #Close : 0
% 21.93/10.98
% 21.93/10.98 Ordering : KBO
% 21.93/10.98
% 21.93/10.98 Simplification rules
% 21.93/10.98 ----------------------
% 21.93/10.98 #Subsume : 712
% 21.93/10.99 #Demod : 1669
% 21.93/10.99 #Tautology : 1687
% 21.93/10.99 #SimpNegUnit : 54
% 21.93/10.99 #BackRed : 4
% 21.93/10.99
% 21.93/10.99 #Partial instantiations: 0
% 21.93/10.99 #Strategies tried : 1
% 21.93/10.99
% 21.93/10.99 Timing (in seconds)
% 21.93/10.99 ----------------------
% 21.93/10.99 Preprocessing : 0.51
% 21.93/10.99 Parsing : 0.27
% 21.93/10.99 CNF conversion : 0.04
% 21.93/10.99 Main loop : 9.43
% 21.93/10.99 Inferencing : 1.61
% 21.93/10.99 Reduction : 4.52
% 21.93/10.99 Demodulation : 3.52
% 21.93/10.99 BG Simplification : 0.09
% 21.93/10.99 Subsumption : 2.58
% 21.93/10.99 Abstraction : 0.11
% 21.93/10.99 MUC search : 0.00
% 21.93/10.99 Cooper : 0.00
% 21.93/10.99 Total : 9.98
% 21.93/10.99 Index Insertion : 0.00
% 21.93/10.99 Index Deletion : 0.00
% 21.93/10.99 Index Matching : 0.00
% 21.93/10.99 BG Taut test : 0.00
%------------------------------------------------------------------------------