TSTP Solution File: SET917+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET917+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 : n026.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:20 EDT 2023
% Result : Theorem 2.35s 1.69s
% Output : CNFRefutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 18 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > empty > set_intersection2 > #nlpp > singleton > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_40,axiom,
! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).
tff(f_58,negated_conjecture,
~ ! [A,B] :
( disjoint(singleton(A),B)
| ( set_intersection2(singleton(A),B) = singleton(A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t58_zfmisc_1) ).
tff(f_44,axiom,
! [A,B] :
( in(A,B)
=> ( set_intersection2(B,singleton(A)) = singleton(A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_zfmisc_1) ).
tff(f_33,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(c_66,plain,
! [A_20,B_21] :
( disjoint(singleton(A_20),B_21)
| in(A_20,B_21) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_20,plain,
~ disjoint(singleton('#skF_3'),'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_73,plain,
in('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_66,c_20]) ).
tff(c_81,plain,
! [B_24,A_25] :
( ( set_intersection2(B_24,singleton(A_25)) = singleton(A_25) )
| ~ in(A_25,B_24) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_intersection2(B_4,A_3) = set_intersection2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_18,plain,
set_intersection2(singleton('#skF_3'),'#skF_4') != singleton('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_21,plain,
set_intersection2('#skF_4',singleton('#skF_3')) != singleton('#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_18]) ).
tff(c_87,plain,
~ in('#skF_3','#skF_4'),
inference(superposition,[status(thm),theory(equality)],[c_81,c_21]) ).
tff(c_117,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_73,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET917+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/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 : n026.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:49:47 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.35/1.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.35/1.69
% 2.35/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.35/1.72
% 2.35/1.72 Inference rules
% 2.35/1.72 ----------------------
% 2.35/1.72 #Ref : 0
% 2.35/1.72 #Sup : 23
% 2.35/1.72 #Fact : 0
% 2.35/1.72 #Define : 0
% 2.35/1.72 #Split : 0
% 2.35/1.72 #Chain : 0
% 2.35/1.72 #Close : 0
% 2.35/1.72
% 2.35/1.72 Ordering : KBO
% 2.35/1.72
% 2.35/1.72 Simplification rules
% 2.35/1.72 ----------------------
% 2.35/1.72 #Subsume : 1
% 2.35/1.72 #Demod : 2
% 2.35/1.72 #Tautology : 11
% 2.35/1.72 #SimpNegUnit : 0
% 2.35/1.72 #BackRed : 0
% 2.35/1.72
% 2.35/1.72 #Partial instantiations: 0
% 2.35/1.72 #Strategies tried : 1
% 2.35/1.72
% 2.35/1.72 Timing (in seconds)
% 2.35/1.72 ----------------------
% 2.35/1.73 Preprocessing : 0.44
% 2.35/1.73 Parsing : 0.25
% 2.35/1.73 CNF conversion : 0.03
% 2.35/1.73 Main loop : 0.21
% 2.35/1.73 Inferencing : 0.09
% 2.35/1.73 Reduction : 0.05
% 2.35/1.73 Demodulation : 0.04
% 2.35/1.73 BG Simplification : 0.01
% 2.35/1.73 Subsumption : 0.04
% 2.35/1.73 Abstraction : 0.01
% 2.35/1.73 MUC search : 0.00
% 2.35/1.73 Cooper : 0.00
% 2.35/1.73 Total : 0.70
% 2.35/1.73 Index Insertion : 0.00
% 2.35/1.73 Index Deletion : 0.00
% 2.35/1.73 Index Matching : 0.00
% 2.35/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------