TSTP Solution File: SET583+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET583+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 : 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:56:37 EDT 2023
% Result : Theorem 2.63s 1.68s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 14 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 16 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 3 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > #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('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_52,negated_conjecture,
~ ! [B,C] :
( ( subset(B,C)
& subset(C,B) )
=> ( B = C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_extensionality) ).
tff(f_33,axiom,
! [B,C] :
( ( B = C )
<=> ( subset(B,C)
& subset(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
tff(c_16,plain,
'#skF_2' != '#skF_3',
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_18,plain,
subset('#skF_3','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_20,plain,
subset('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_25,plain,
! [C_12,B_13] :
( ( C_12 = B_13 )
| ~ subset(C_12,B_13)
| ~ subset(B_13,C_12) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_27,plain,
( ( '#skF_2' = '#skF_3' )
| ~ subset('#skF_3','#skF_2') ),
inference(resolution,[status(thm)],[c_20,c_25]) ).
tff(c_34,plain,
'#skF_2' = '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_18,c_27]) ).
tff(c_36,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET583+3 : TPTP v8.1.2. Released v2.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.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 16:21:31 EDT 2023
% 0.14/0.37 % CPUTime :
% 2.63/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.63/1.68
% 2.63/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.63/1.71
% 2.63/1.71 Inference rules
% 2.63/1.71 ----------------------
% 2.63/1.71 #Ref : 0
% 2.63/1.71 #Sup : 3
% 2.63/1.71 #Fact : 0
% 2.63/1.71 #Define : 0
% 2.63/1.71 #Split : 0
% 2.63/1.71 #Chain : 0
% 2.63/1.71 #Close : 0
% 2.63/1.71
% 2.63/1.71 Ordering : KBO
% 2.63/1.71
% 2.63/1.71 Simplification rules
% 2.63/1.71 ----------------------
% 2.63/1.71 #Subsume : 0
% 2.63/1.71 #Demod : 3
% 2.63/1.71 #Tautology : 2
% 2.63/1.71 #SimpNegUnit : 1
% 2.63/1.71 #BackRed : 0
% 2.63/1.71
% 2.63/1.71 #Partial instantiations: 0
% 2.63/1.71 #Strategies tried : 1
% 2.63/1.71
% 2.63/1.71 Timing (in seconds)
% 2.63/1.71 ----------------------
% 2.63/1.71 Preprocessing : 0.45
% 2.63/1.71 Parsing : 0.23
% 2.63/1.71 CNF conversion : 0.03
% 2.63/1.71 Main loop : 0.13
% 2.63/1.71 Inferencing : 0.05
% 2.63/1.71 Reduction : 0.03
% 2.63/1.71 Demodulation : 0.02
% 2.63/1.71 BG Simplification : 0.01
% 2.63/1.71 Subsumption : 0.03
% 2.63/1.71 Abstraction : 0.01
% 2.63/1.71 MUC search : 0.00
% 2.63/1.71 Cooper : 0.00
% 2.63/1.71 Total : 0.62
% 2.63/1.71 Index Insertion : 0.00
% 2.63/1.71 Index Deletion : 0.00
% 2.63/1.72 Index Matching : 0.00
% 2.63/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------