TSTP Solution File: SEV421_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEV421_1 : TPTP v8.1.2. Released v5.0.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 : n003.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 11:00:01 EDT 2023
% Result : Theorem 3.39s 1.76s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 33 ( 12 unt; 16 typ; 0 def)
% Number of atoms : 24 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 3 |; 1 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 12 ( 0 atm; 0 fun; 11 num; 1 var)
% Number of types : 4 ( 2 usr; 1 ari)
% Number of type conns : 16 ( 10 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 5 (; 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > union > intersection > difference > #nlpp > singleton > complement > cardinality > empty_set > #skF_1 > #skF_2 > #skF_3 > #skF_4
%Foreground sorts:
tff(element,type,
element: $tType ).
tff(set,type,
set: $tType ).
%Background operators:
tff('#skF_5',type,
'#skF_5': $int ).
%Foreground operators:
tff(member,type,
member: ( element * set ) > $o ).
tff(intersection,type,
intersection: ( set * set ) > set ).
tff('#skF_1',type,
'#skF_1': set > element ).
tff('#skF_2',type,
'#skF_2': ( set * set ) > element ).
tff('#skF_3',type,
'#skF_3': element ).
tff(complement,type,
complement: set > set ).
tff(cardinality,type,
cardinality: set > $int ).
tff('#skF_4',type,
'#skF_4': set ).
tff(subset,type,
subset: ( set * set ) > $o ).
tff(singleton,type,
singleton: element > set ).
tff(union,type,
union: ( set * set ) > set ).
tff(empty_set,type,
empty_set: set ).
tff(difference,type,
difference: ( set * set ) > set ).
tff(f_102,negated_conjecture,
~ ! [X: element,C: set,Sizea: $int] :
( ( ~ member(X,C)
& ( Sizea = cardinality(C) ) )
=> ( ( Sizea = 0 )
<=> ( C = empty_set ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',vc1) ).
tff(f_75,axiom,
! [S: set] :
( ( cardinality(S) = 0 )
<=> ( S = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cardinality_empty_set) ).
tff(c_70,plain,
( ( empty_set != '#skF_4' )
| ( '#skF_5' != 0 ) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_96,plain,
'#skF_5' != 0,
inference(splitLeft,[status(thm)],[c_70]) ).
tff(c_68,plain,
( ( empty_set = '#skF_4' )
| ( '#skF_5' = 0 ) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_98,plain,
empty_set = '#skF_4',
inference(negUnitSimplification,[status(thm)],[c_96,c_68]) ).
tff(c_80,plain,
cardinality(empty_set) = 0,
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_102,plain,
cardinality('#skF_4') = 0,
inference(demodulation,[status(thm),theory(equality)],[c_98,c_80]) ).
tff(c_71,plain,
cardinality('#skF_4') = '#skF_5',
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_115,plain,
'#skF_5' = 0,
inference(demodulation,[status(thm),theory(equality)],[c_102,c_71]) ).
tff(c_117,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_96,c_115]) ).
tff(c_118,plain,
empty_set != '#skF_4',
inference(splitRight,[status(thm)],[c_70]) ).
tff(c_120,plain,
'#skF_5' = 0,
inference(splitRight,[status(thm)],[c_70]) ).
tff(c_123,plain,
cardinality('#skF_4') = 0,
inference(demodulation,[status(thm),theory(equality)],[c_120,c_71]) ).
tff(c_133,plain,
! [S_37: set] :
( ( empty_set = S_37 )
| ( cardinality(S_37) != 0 ) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_136,plain,
empty_set = '#skF_4',
inference(superposition,[status(thm),theory(equality)],[c_123,c_133]) ).
tff(c_144,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEV421_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/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 : n003.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 12:20:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.39/1.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.39/1.77
% 3.39/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.39/1.79
% 3.39/1.79 Inference rules
% 3.39/1.79 ----------------------
% 3.39/1.79 #Ref : 0
% 3.39/1.79 #Sup : 11
% 3.39/1.79 #Fact : 0
% 3.39/1.79 #Define : 0
% 3.39/1.79 #Split : 1
% 3.39/1.79 #Chain : 0
% 3.39/1.79 #Close : 0
% 3.39/1.79
% 3.39/1.79 Ordering : LPO
% 3.39/1.79
% 3.39/1.79 Simplification rules
% 3.39/1.79 ----------------------
% 3.39/1.79 #Subsume : 3
% 3.39/1.79 #Demod : 6
% 3.39/1.79 #Tautology : 11
% 3.39/1.79 #SimpNegUnit : 4
% 3.39/1.79 #BackRed : 4
% 3.39/1.79
% 3.39/1.79 #Partial instantiations: 0
% 3.39/1.79 #Strategies tried : 1
% 3.39/1.79
% 3.39/1.79 Timing (in seconds)
% 3.39/1.79 ----------------------
% 3.39/1.79 Preprocessing : 0.56
% 3.39/1.79 Parsing : 0.29
% 3.39/1.79 CNF conversion : 0.04
% 3.39/1.79 Main loop : 0.19
% 3.39/1.79 Inferencing : 0.04
% 3.39/1.79 Reduction : 0.06
% 3.39/1.79 Demodulation : 0.04
% 3.39/1.79 BG Simplification : 0.04
% 3.39/1.79 Subsumption : 0.04
% 3.39/1.79 Abstraction : 0.01
% 3.39/1.79 MUC search : 0.00
% 3.39/1.79 Cooper : 0.01
% 3.39/1.79 Total : 0.79
% 3.39/1.79 Index Insertion : 0.00
% 3.39/1.79 Index Deletion : 0.00
% 3.39/1.79 Index Matching : 0.00
% 3.39/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------