TSTP Solution File: SET925+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET925+1 : TPTP v8.1.2. Released v3.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:57:21 EDT 2023
% Result : Theorem 2.71s 1.70s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 34 ( 14 unt; 11 typ; 0 def)
% Number of atoms : 32 ( 13 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 7 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > set_difference > #nlpp > singleton > empty_set > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_42,negated_conjecture,
~ ! [A,B] :
( ( set_difference(singleton(A),B) = empty_set )
<=> in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_zfmisc_1) ).
tff(f_46,axiom,
! [A,B] :
( ( set_difference(singleton(A),B) = empty_set )
<=> in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l36_zfmisc_1) ).
tff(c_12,plain,
( in('#skF_3','#skF_4')
| ~ in('#skF_5','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_22,plain,
~ in('#skF_5','#skF_6'),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_16,plain,
( in('#skF_3','#skF_4')
| ( set_difference(singleton('#skF_5'),'#skF_6') = empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_23,plain,
set_difference(singleton('#skF_5'),'#skF_6') = empty_set,
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_44,plain,
! [A_9,B_10] :
( in(A_9,B_10)
| ( set_difference(singleton(A_9),B_10) != empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_50,plain,
in('#skF_5','#skF_6'),
inference(superposition,[status(thm),theory(equality)],[c_23,c_44]) ).
tff(c_55,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_50]) ).
tff(c_56,plain,
in('#skF_3','#skF_4'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_20,plain,
! [A_3,B_4] :
( ( set_difference(singleton(A_3),B_4) = empty_set )
| ~ in(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_57,plain,
set_difference(singleton('#skF_5'),'#skF_6') != empty_set,
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_14,plain,
( ( set_difference(singleton('#skF_3'),'#skF_4') != empty_set )
| ( set_difference(singleton('#skF_5'),'#skF_6') = empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_79,plain,
set_difference(singleton('#skF_3'),'#skF_4') != empty_set,
inference(negUnitSimplification,[status(thm)],[c_57,c_14]) ).
tff(c_82,plain,
~ in('#skF_3','#skF_4'),
inference(superposition,[status(thm),theory(equality)],[c_20,c_79]) ).
tff(c_86,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_82]) ).
tff(c_87,plain,
in('#skF_3','#skF_4'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_98,plain,
! [A_15,B_16] :
( ( set_difference(singleton(A_15),B_16) = empty_set )
| ~ in(A_15,B_16) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_88,plain,
in('#skF_5','#skF_6'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_10,plain,
( ( set_difference(singleton('#skF_3'),'#skF_4') != empty_set )
| ~ in('#skF_5','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_97,plain,
set_difference(singleton('#skF_3'),'#skF_4') != empty_set,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_10]) ).
tff(c_104,plain,
~ in('#skF_3','#skF_4'),
inference(superposition,[status(thm),theory(equality)],[c_98,c_97]) ).
tff(c_112,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_87,c_104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET925+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.15 % 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.18/0.36 % Computer : n018.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 17:05:05 EDT 2023
% 0.18/0.36 % CPUTime :
% 2.71/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.71/1.70
% 2.71/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.89/1.74
% 2.89/1.74 Inference rules
% 2.89/1.74 ----------------------
% 2.89/1.74 #Ref : 0
% 2.89/1.74 #Sup : 19
% 2.89/1.74 #Fact : 0
% 2.89/1.74 #Define : 0
% 2.89/1.74 #Split : 2
% 2.89/1.74 #Chain : 0
% 2.89/1.74 #Close : 0
% 2.89/1.74
% 2.89/1.74 Ordering : KBO
% 2.89/1.74
% 2.89/1.74 Simplification rules
% 2.89/1.74 ----------------------
% 2.89/1.74 #Subsume : 4
% 2.89/1.74 #Demod : 5
% 2.89/1.74 #Tautology : 11
% 2.89/1.74 #SimpNegUnit : 2
% 2.89/1.74 #BackRed : 0
% 2.89/1.74
% 2.89/1.74 #Partial instantiations: 0
% 2.89/1.74 #Strategies tried : 1
% 2.89/1.74
% 2.89/1.74 Timing (in seconds)
% 2.89/1.74 ----------------------
% 2.89/1.74 Preprocessing : 0.42
% 2.89/1.74 Parsing : 0.23
% 2.89/1.75 CNF conversion : 0.03
% 2.89/1.75 Main loop : 0.21
% 2.89/1.75 Inferencing : 0.08
% 2.89/1.75 Reduction : 0.05
% 2.89/1.75 Demodulation : 0.03
% 2.89/1.75 BG Simplification : 0.01
% 2.89/1.75 Subsumption : 0.06
% 2.89/1.75 Abstraction : 0.01
% 2.89/1.75 MUC search : 0.00
% 2.89/1.75 Cooper : 0.00
% 2.89/1.75 Total : 0.69
% 2.89/1.75 Index Insertion : 0.00
% 2.89/1.75 Index Deletion : 0.00
% 2.89/1.75 Index Matching : 0.00
% 2.89/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------