TSTP Solution File: NUM531+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM531+1 : TPTP v8.1.2. Released v4.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 10:52:00 EDT 2023
% Result : Theorem 2.67s 1.70s
% Output : CNFRefutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 19 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 18 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 3 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 6 >; 1 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 3 (; 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > #nlpp > slcrc0 > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(aSet0,type,
aSet0: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(isCountable0,type,
isCountable0: $i > $o ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(slcrc0,type,
slcrc0: $i ).
tff(isFinite0,type,
isFinite0: $i > $o ).
tff(f_73,negated_conjecture,
~ ! [W0] :
( ( aSet0(W0)
& isCountable0(W0) )
=> ( W0 != slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_53,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEmpFin) ).
tff(f_65,axiom,
! [W0] :
( ( aSet0(W0)
& isCountable0(W0) )
=> ~ isFinite0(W0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin) ).
tff(c_26,plain,
aSet0('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_24,plain,
isCountable0('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_22,plain,
slcrc0 = '#skF_2',
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_16,plain,
isFinite0(slcrc0),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_27,plain,
isFinite0('#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_22,c_16]) ).
tff(c_36,plain,
! [W0_14] :
( ~ isFinite0(W0_14)
| ~ isCountable0(W0_14)
| ~ aSet0(W0_14) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_39,plain,
( ~ isCountable0('#skF_2')
| ~ aSet0('#skF_2') ),
inference(resolution,[status(thm)],[c_27,c_36]) ).
tff(c_43,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_24,c_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.16 % Problem : NUM531+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.17 % 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.15/0.39 % Computer : n003.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Thu Aug 3 15:12:23 EDT 2023
% 0.15/0.39 % CPUTime :
% 2.67/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.67/1.71
% 2.67/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.67/1.73
% 2.67/1.73 Inference rules
% 2.67/1.73 ----------------------
% 2.67/1.73 #Ref : 0
% 2.67/1.73 #Sup : 3
% 2.67/1.73 #Fact : 0
% 2.67/1.73 #Define : 0
% 2.67/1.73 #Split : 0
% 2.67/1.73 #Chain : 0
% 2.67/1.73 #Close : 0
% 2.67/1.73
% 2.67/1.73 Ordering : KBO
% 2.67/1.73
% 2.67/1.73 Simplification rules
% 2.67/1.73 ----------------------
% 2.67/1.73 #Subsume : 0
% 2.67/1.73 #Demod : 7
% 2.67/1.73 #Tautology : 7
% 2.67/1.73 #SimpNegUnit : 0
% 2.67/1.73 #BackRed : 0
% 2.67/1.73
% 2.67/1.73 #Partial instantiations: 0
% 2.67/1.73 #Strategies tried : 1
% 2.67/1.73
% 2.67/1.73 Timing (in seconds)
% 2.67/1.73 ----------------------
% 2.67/1.74 Preprocessing : 0.45
% 2.67/1.74 Parsing : 0.24
% 2.67/1.74 CNF conversion : 0.03
% 2.67/1.74 Main loop : 0.11
% 2.67/1.74 Inferencing : 0.04
% 2.67/1.74 Reduction : 0.03
% 2.67/1.74 Demodulation : 0.02
% 2.67/1.74 BG Simplification : 0.01
% 2.67/1.74 Subsumption : 0.02
% 2.67/1.74 Abstraction : 0.00
% 2.67/1.74 MUC search : 0.00
% 2.67/1.74 Cooper : 0.00
% 2.67/1.74 Total : 0.61
% 2.67/1.74 Index Insertion : 0.00
% 2.67/1.74 Index Deletion : 0.00
% 2.67/1.74 Index Matching : 0.00
% 2.67/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------