TSTP Solution File: SET027+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET027+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 : n018.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:55:37 EDT 2023
% Result : Theorem 46.08s 34.00s
% Output : CNFRefutation 46.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of formulae : 33 ( 5 unt; 18 typ; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 30 ( 12 ~; 14 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 26 (; 26 !; 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_121,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI03) ).
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(c_60,plain,
~ subset('#skF_4','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_64,plain,
subset('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_62,plain,
subset('#skF_5','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_121]) ).
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_311,plain,
! [X_90,B_91,A_92] :
( member(X_90,B_91)
| ~ member(X_90,A_92)
| ~ subset(A_92,B_91) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_5219,plain,
! [A_319,B_320,B_321] :
( member('#skF_1'(A_319,B_320),B_321)
| ~ subset(A_319,B_321)
| subset(A_319,B_320) ),
inference(resolution,[status(thm)],[c_6,c_311]) ).
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_56]) ).
tff(c_101151,plain,
! [A_2005,B_2006,B_2007,B_2008] :
( member('#skF_1'(A_2005,B_2006),B_2007)
| ~ subset(B_2008,B_2007)
| ~ subset(A_2005,B_2008)
| subset(A_2005,B_2006) ),
inference(resolution,[status(thm)],[c_5219,c_2]) ).
tff(c_103372,plain,
! [A_2021,B_2022] :
( member('#skF_1'(A_2021,B_2022),'#skF_6')
| ~ subset(A_2021,'#skF_5')
| subset(A_2021,B_2022) ),
inference(resolution,[status(thm)],[c_62,c_101151]) ).
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_103473,plain,
! [A_2023] :
( ~ subset(A_2023,'#skF_5')
| subset(A_2023,'#skF_6') ),
inference(resolution,[status(thm)],[c_103372,c_4]) ).
tff(c_103991,plain,
subset('#skF_4','#skF_6'),
inference(resolution,[status(thm)],[c_64,c_103473]) ).
tff(c_104211,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_103991]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET027+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.36 % Computer : n018.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:37:50 EDT 2023
% 0.14/0.36 % CPUTime :
% 46.08/34.00 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 46.08/34.01
% 46.08/34.01 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 46.16/34.03
% 46.16/34.03 Inference rules
% 46.16/34.03 ----------------------
% 46.16/34.03 #Ref : 0
% 46.16/34.03 #Sup : 24467
% 46.16/34.03 #Fact : 6
% 46.16/34.03 #Define : 0
% 46.16/34.03 #Split : 4
% 46.16/34.03 #Chain : 0
% 46.16/34.03 #Close : 0
% 46.16/34.03
% 46.16/34.03 Ordering : KBO
% 46.16/34.03
% 46.16/34.03 Simplification rules
% 46.16/34.03 ----------------------
% 46.16/34.03 #Subsume : 1803
% 46.16/34.03 #Demod : 4114
% 46.16/34.03 #Tautology : 4149
% 46.16/34.03 #SimpNegUnit : 109
% 46.16/34.03 #BackRed : 4
% 46.16/34.03
% 46.16/34.03 #Partial instantiations: 0
% 46.16/34.03 #Strategies tried : 1
% 46.16/34.03
% 46.16/34.03 Timing (in seconds)
% 46.16/34.03 ----------------------
% 46.16/34.03 Preprocessing : 0.49
% 46.16/34.04 Parsing : 0.26
% 46.16/34.04 CNF conversion : 0.04
% 46.16/34.04 Main loop : 32.49
% 46.16/34.04 Inferencing : 3.28
% 46.16/34.04 Reduction : 17.35
% 46.16/34.04 Demodulation : 13.88
% 46.16/34.04 BG Simplification : 0.14
% 46.16/34.04 Subsumption : 9.83
% 46.16/34.04 Abstraction : 0.21
% 46.16/34.04 MUC search : 0.00
% 46.16/34.04 Cooper : 0.00
% 46.16/34.04 Total : 33.03
% 46.16/34.04 Index Insertion : 0.00
% 46.16/34.04 Index Deletion : 0.00
% 46.16/34.04 Index Matching : 0.00
% 46.16/34.04 BG Taut test : 0.00
%------------------------------------------------------------------------------