TSTP Solution File: SET002+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET002+3 : 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 : n028.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:28 EDT 2023
% Result : Theorem 2.73s 1.77s
% Output : CNFRefutation 2.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 10 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > union > #nlpp > #skF_3 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_59,axiom,
! [B] : subset(B,B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).
tff(f_31,axiom,
! [B,C] :
( subset(B,C)
=> ( union(B,C) = C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_union) ).
tff(f_71,negated_conjecture,
~ ! [B] : ( union(B,B) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idempotency_of_union) ).
tff(c_24,plain,
! [B_15] : subset(B_15,B_15),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_75,plain,
! [B_24,C_25] :
( ( union(B_24,C_25) = C_25 )
| ~ subset(B_24,C_25) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_79,plain,
! [B_15] : ( union(B_15,B_15) = B_15 ),
inference(resolution,[status(thm)],[c_24,c_75]) ).
tff(c_38,plain,
union('#skF_4','#skF_4') != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_82,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_79,c_38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET002+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14 % 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 : n028.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 16:25:54 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.73/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.99/1.78
% 2.99/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.99/1.80
% 2.99/1.80 Inference rules
% 2.99/1.80 ----------------------
% 2.99/1.80 #Ref : 0
% 2.99/1.80 #Sup : 9
% 2.99/1.80 #Fact : 0
% 2.99/1.80 #Define : 0
% 2.99/1.80 #Split : 0
% 2.99/1.80 #Chain : 0
% 2.99/1.80 #Close : 0
% 2.99/1.80
% 2.99/1.80 Ordering : KBO
% 2.99/1.80
% 2.99/1.80 Simplification rules
% 2.99/1.80 ----------------------
% 2.99/1.80 #Subsume : 0
% 2.99/1.80 #Demod : 3
% 2.99/1.80 #Tautology : 12
% 2.99/1.80 #SimpNegUnit : 0
% 2.99/1.80 #BackRed : 1
% 2.99/1.80
% 2.99/1.80 #Partial instantiations: 0
% 2.99/1.80 #Strategies tried : 1
% 2.99/1.80
% 2.99/1.80 Timing (in seconds)
% 2.99/1.80 ----------------------
% 2.99/1.80 Preprocessing : 0.58
% 2.99/1.80 Parsing : 0.31
% 2.99/1.80 CNF conversion : 0.04
% 2.99/1.80 Main loop : 0.17
% 2.99/1.80 Inferencing : 0.06
% 2.99/1.80 Reduction : 0.05
% 2.99/1.80 Demodulation : 0.04
% 2.99/1.80 BG Simplification : 0.02
% 2.99/1.80 Subsumption : 0.05
% 2.99/1.80 Abstraction : 0.01
% 2.99/1.80 MUC search : 0.00
% 2.99/1.81 Cooper : 0.00
% 2.99/1.81 Total : 0.79
% 2.99/1.81 Index Insertion : 0.00
% 2.99/1.81 Index Deletion : 0.00
% 2.99/1.81 Index Matching : 0.00
% 2.99/1.81 BG Taut test : 0.00
%------------------------------------------------------------------------------