TSTP Solution File: SET590+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET590+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/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 : n010.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:38 EDT 2023
% Result : Theorem 2.71s 1.66s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 5 ~; 4 |; 1 &)
% ( 2 <=>; 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 : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > difference > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_42,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
tff(f_34,axiom,
! [B,C,D] :
( member(D,difference(B,C))
<=> ( member(D,B)
& ~ member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
tff(f_49,negated_conjecture,
~ ! [B,C] : subset(difference(B,C),B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th49) ).
tff(c_21,plain,
! [B_19,C_20] :
( member('#skF_1'(B_19,C_20),B_19)
| subset(B_19,C_20) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_6,plain,
! [D_3,B_1,C_2] :
( member(D_3,B_1)
| ~ member(D_3,difference(B_1,C_2)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_90,plain,
! [B_36,C_37,C_38] :
( member('#skF_1'(difference(B_36,C_37),C_38),B_36)
| subset(difference(B_36,C_37),C_38) ),
inference(resolution,[status(thm)],[c_21,c_6]) ).
tff(c_10,plain,
! [B_4,C_5] :
( ~ member('#skF_1'(B_4,C_5),C_5)
| subset(B_4,C_5) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_111,plain,
! [B_36,C_37] : subset(difference(B_36,C_37),B_36),
inference(resolution,[status(thm)],[c_90,c_10]) ).
tff(c_16,plain,
~ subset(difference('#skF_2','#skF_3'),'#skF_2'),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_122,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_111,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET590+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/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 : n010.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 16:05:44 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.71/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.71/1.67
% 2.71/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.93/1.70
% 2.93/1.70 Inference rules
% 2.93/1.70 ----------------------
% 2.93/1.70 #Ref : 0
% 2.93/1.70 #Sup : 20
% 2.93/1.70 #Fact : 0
% 2.93/1.70 #Define : 0
% 2.93/1.70 #Split : 0
% 2.93/1.70 #Chain : 0
% 2.93/1.70 #Close : 0
% 2.93/1.70
% 2.93/1.70 Ordering : KBO
% 2.93/1.70
% 2.93/1.70 Simplification rules
% 2.93/1.70 ----------------------
% 2.93/1.70 #Subsume : 0
% 2.93/1.70 #Demod : 3
% 2.93/1.70 #Tautology : 5
% 2.93/1.70 #SimpNegUnit : 0
% 2.93/1.70 #BackRed : 1
% 2.93/1.70
% 2.93/1.70 #Partial instantiations: 0
% 2.93/1.70 #Strategies tried : 1
% 2.93/1.70
% 2.93/1.70 Timing (in seconds)
% 2.93/1.70 ----------------------
% 2.93/1.70 Preprocessing : 0.40
% 2.93/1.70 Parsing : 0.22
% 2.93/1.70 CNF conversion : 0.03
% 2.93/1.70 Main loop : 0.21
% 2.95/1.70 Inferencing : 0.10
% 2.95/1.70 Reduction : 0.04
% 2.95/1.70 Demodulation : 0.03
% 2.95/1.70 BG Simplification : 0.01
% 2.95/1.70 Subsumption : 0.05
% 2.95/1.70 Abstraction : 0.01
% 2.95/1.70 MUC search : 0.00
% 2.95/1.70 Cooper : 0.00
% 2.95/1.70 Total : 0.66
% 2.95/1.70 Index Insertion : 0.00
% 2.95/1.70 Index Deletion : 0.00
% 2.95/1.70 Index Matching : 0.00
% 2.95/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------