TSTP Solution File: SET019+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET019+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 : n023.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:34 EDT 2023
% Result : Theorem 3.53s 1.89s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 19
% Syntax : Number of formulae : 26 ( 5 unt; 17 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 3 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 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 : 14 ( 14 usr; 3 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 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_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(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] :
( ( subset(A,B)
& subset(B,A) )
=> equal_set(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI02) ).
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(c_60,plain,
~ equal_set('#skF_4','#skF_5'),
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_4'),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_148,plain,
! [A_75,B_76] :
( equal_set(A_75,B_76)
| ~ subset(B_76,A_75)
| ~ subset(A_75,B_76) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_158,plain,
( equal_set('#skF_4','#skF_5')
| ~ subset('#skF_4','#skF_5') ),
inference(resolution,[status(thm)],[c_62,c_148]) ).
tff(c_169,plain,
equal_set('#skF_4','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_158]) ).
tff(c_171,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET019+4 : TPTP v8.1.2. Released v2.2.0.
% 0.13/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 : n023.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 17:18:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.53/1.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.53/1.89
% 3.53/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.70/1.92
% 3.70/1.92 Inference rules
% 3.70/1.92 ----------------------
% 3.70/1.92 #Ref : 0
% 3.70/1.92 #Sup : 19
% 3.70/1.92 #Fact : 0
% 3.70/1.92 #Define : 0
% 3.70/1.92 #Split : 0
% 3.70/1.92 #Chain : 0
% 3.70/1.92 #Close : 0
% 3.70/1.92
% 3.70/1.92 Ordering : KBO
% 3.70/1.92
% 3.70/1.92 Simplification rules
% 3.70/1.92 ----------------------
% 3.70/1.92 #Subsume : 0
% 3.70/1.92 #Demod : 2
% 3.70/1.92 #Tautology : 3
% 3.70/1.92 #SimpNegUnit : 1
% 3.70/1.92 #BackRed : 0
% 3.70/1.92
% 3.70/1.92 #Partial instantiations: 0
% 3.70/1.92 #Strategies tried : 1
% 3.70/1.92
% 3.70/1.92 Timing (in seconds)
% 3.70/1.92 ----------------------
% 3.70/1.92 Preprocessing : 0.54
% 3.70/1.92 Parsing : 0.29
% 3.70/1.92 CNF conversion : 0.04
% 3.70/1.92 Main loop : 0.28
% 3.70/1.92 Inferencing : 0.11
% 3.70/1.92 Reduction : 0.08
% 3.70/1.92 Demodulation : 0.06
% 3.70/1.92 BG Simplification : 0.02
% 3.70/1.92 Subsumption : 0.06
% 3.70/1.92 Abstraction : 0.01
% 3.70/1.92 MUC search : 0.00
% 3.70/1.92 Cooper : 0.00
% 3.70/1.92 Total : 0.87
% 3.70/1.92 Index Insertion : 0.00
% 3.70/1.92 Index Deletion : 0.00
% 3.70/1.92 Index Matching : 0.00
% 3.70/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------