TSTP Solution File: SET978+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET978+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 : n002.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:27 EDT 2023
% Result : Theorem 2.77s 1.66s
% Output : CNFRefutation 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 26 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 25 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 5 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ disjoint > empty > cartesian_product2 > #nlpp > singleton > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
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(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(f_49,negated_conjecture,
~ ! [A,B,C,D] :
( ( A != B )
=> ( disjoint(cartesian_product2(singleton(A),C),cartesian_product2(singleton(B),D))
& disjoint(cartesian_product2(C,singleton(A)),cartesian_product2(D,singleton(B))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t131_zfmisc_1) ).
tff(f_54,axiom,
! [A,B] :
( ( A != B )
=> disjoint(singleton(A),singleton(B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_zfmisc_1) ).
tff(f_41,axiom,
! [A,B,C,D] :
( ( disjoint(A,B)
| disjoint(C,D) )
=> disjoint(cartesian_product2(A,C),cartesian_product2(B,D)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t127_zfmisc_1) ).
tff(c_14,plain,
'#skF_3' != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_16,plain,
! [A_7,B_8] :
( disjoint(singleton(A_7),singleton(B_8))
| ( B_8 = A_7 ) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_8,plain,
! [C_5,D_6,A_3,B_4] :
( ~ disjoint(C_5,D_6)
| disjoint(cartesian_product2(A_3,C_5),cartesian_product2(B_4,D_6)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_10,plain,
! [A_3,B_4,C_5,D_6] :
( ~ disjoint(A_3,B_4)
| disjoint(cartesian_product2(A_3,C_5),cartesian_product2(B_4,D_6)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_12,plain,
( ~ disjoint(cartesian_product2('#skF_5',singleton('#skF_3')),cartesian_product2('#skF_6',singleton('#skF_4')))
| ~ disjoint(cartesian_product2(singleton('#skF_3'),'#skF_5'),cartesian_product2(singleton('#skF_4'),'#skF_6')) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_38,plain,
~ disjoint(cartesian_product2(singleton('#skF_3'),'#skF_5'),cartesian_product2(singleton('#skF_4'),'#skF_6')),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_54,plain,
~ disjoint(singleton('#skF_3'),singleton('#skF_4')),
inference(resolution,[status(thm)],[c_10,c_38]) ).
tff(c_57,plain,
'#skF_3' = '#skF_4',
inference(resolution,[status(thm)],[c_16,c_54]) ).
tff(c_61,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_57]) ).
tff(c_62,plain,
~ disjoint(cartesian_product2('#skF_5',singleton('#skF_3')),cartesian_product2('#skF_6',singleton('#skF_4'))),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_78,plain,
~ disjoint(singleton('#skF_3'),singleton('#skF_4')),
inference(resolution,[status(thm)],[c_8,c_62]) ).
tff(c_85,plain,
'#skF_3' = '#skF_4',
inference(resolution,[status(thm)],[c_16,c_78]) ).
tff(c_89,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET978+1 : TPTP v8.1.2. Released v3.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 : n002.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:22:16 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.77/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.77/1.67
% 2.77/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.77/1.69
% 2.77/1.69 Inference rules
% 2.77/1.69 ----------------------
% 2.77/1.69 #Ref : 0
% 2.77/1.69 #Sup : 16
% 2.77/1.69 #Fact : 0
% 2.77/1.69 #Define : 0
% 2.77/1.69 #Split : 1
% 2.77/1.69 #Chain : 0
% 2.77/1.69 #Close : 0
% 2.77/1.69
% 2.77/1.69 Ordering : KBO
% 2.77/1.69
% 2.77/1.69 Simplification rules
% 2.77/1.69 ----------------------
% 2.77/1.69 #Subsume : 3
% 2.77/1.69 #Demod : 0
% 2.77/1.69 #Tautology : 0
% 2.77/1.69 #SimpNegUnit : 2
% 2.77/1.69 #BackRed : 0
% 2.77/1.69
% 2.77/1.69 #Partial instantiations: 0
% 2.77/1.69 #Strategies tried : 1
% 2.77/1.69
% 2.77/1.69 Timing (in seconds)
% 2.77/1.69 ----------------------
% 2.77/1.69 Preprocessing : 0.44
% 2.77/1.69 Parsing : 0.24
% 2.77/1.70 CNF conversion : 0.03
% 2.77/1.70 Main loop : 0.22
% 2.77/1.70 Inferencing : 0.09
% 2.77/1.70 Reduction : 0.04
% 2.77/1.70 Demodulation : 0.03
% 2.77/1.70 BG Simplification : 0.01
% 2.77/1.70 Subsumption : 0.06
% 2.77/1.70 Abstraction : 0.01
% 2.77/1.70 MUC search : 0.00
% 2.77/1.70 Cooper : 0.00
% 2.77/1.70 Total : 0.70
% 2.77/1.70 Index Insertion : 0.00
% 2.77/1.70 Index Deletion : 0.00
% 2.77/1.70 Index Matching : 0.00
% 2.77/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------