TSTP Solution File: ITP010+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ITP010+1 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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:43:09 EDT 2023
% Result : Theorem 4.09s 2.00s
% Output : CNFRefutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 35
% Syntax : Number of formulae : 38 ( 3 unt; 34 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 4 ~; 0 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 16 >; 13 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 33 ( 33 usr; 18 con; 0-4 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > tyop_2Emin_2Efun > s > c_2Emin_2E_3D_3D_3E_2E2 > c_2Emin_2E_3D_2E2 > c_2Ecardinal_2Ecardleq_2E2 > c_2Ebool_2E_5C_2F_2E2 > c_2Ebool_2E_2F_5C_2E2 > app_2E2 > #nlpp > c_2Ebool_2E_7E_2E1 > c_2Ebool_2E_3F_2E1 > c_2Ebool_2E_21_2E1 > tyop_2Emin_2Ebool > combin_s_2E0 > combin_k_2E0 > combin_i_2E0 > c_2Emin_2E_3D_3D_3E_2E0 > c_2Emin_2E_3D_2E0 > c_2Ecardinal_2Ecardleq_2E0 > c_2Ebool_2E_7E_2E0 > c_2Ebool_2E_5C_2F_2E0 > c_2Ebool_2E_3F_2E0 > c_2Ebool_2E_2F_5C_2E0 > c_2Ebool_2E_21_2E0 > c_2Ebool_2ET_2E0 > c_2Ebool_2EF_2E0 > #skF_4 > #skF_7 > #skF_3 > #skF_5 > #skF_6 > #skF_8 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_2Ebool_2E_21_2E0,type,
c_2Ebool_2E_21_2E0: $i ).
tff(app_2E2,type,
app_2E2: ( $i * $i ) > $i ).
tff(c_2Ecardinal_2Ecardleq_2E2,type,
c_2Ecardinal_2Ecardleq_2E2: ( $i * $i ) > $i ).
tff(c_2Ebool_2E_2F_5C_2E2,type,
c_2Ebool_2E_2F_5C_2E2: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(tyop_2Emin_2Ebool,type,
tyop_2Emin_2Ebool: $i ).
tff(c_2Ebool_2E_7E_2E0,type,
c_2Ebool_2E_7E_2E0: $i ).
tff(c_2Emin_2E_3D_3D_3E_2E0,type,
c_2Emin_2E_3D_3D_3E_2E0: $i ).
tff(c_2Emin_2E_3D_3D_3E_2E2,type,
c_2Emin_2E_3D_3D_3E_2E2: ( $i * $i ) > $i ).
tff(c_2Ecardinal_2Ecardleq_2E0,type,
c_2Ecardinal_2Ecardleq_2E0: $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(p,type,
p: $i > $o ).
tff(c_2Emin_2E_3D_2E2,type,
c_2Emin_2E_3D_2E2: ( $i * $i ) > $i ).
tff(c_2Ebool_2E_5C_2F_2E2,type,
c_2Ebool_2E_5C_2F_2E2: ( $i * $i ) > $i ).
tff(combin_s_2E0,type,
combin_s_2E0: $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(c_2Ebool_2E_2F_5C_2E0,type,
c_2Ebool_2E_2F_5C_2E0: $i ).
tff(tyop_2Emin_2Efun,type,
tyop_2Emin_2Efun: ( $i * $i ) > $i ).
tff(c_2Ebool_2ET_2E0,type,
c_2Ebool_2ET_2E0: $i ).
tff(c_2Ebool_2E_3F_2E0,type,
c_2Ebool_2E_3F_2E0: $i ).
tff(c_2Ebool_2E_3F_2E1,type,
c_2Ebool_2E_3F_2E1: $i > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(c_2Ebool_2E_7E_2E1,type,
c_2Ebool_2E_7E_2E1: $i > $i ).
tff(c_2Emin_2E_3D_2E0,type,
c_2Emin_2E_3D_2E0: $i ).
tff(s,type,
s: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(c_2Ebool_2E_21_2E1,type,
c_2Ebool_2E_21_2E1: $i > $i ).
tff(combin_i_2E0,type,
combin_i_2E0: $i ).
tff(c_2Ebool_2E_5C_2F_2E0,type,
c_2Ebool_2E_5C_2F_2E0: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i * $i ) > $i ).
tff(c_2Ebool_2EF_2E0,type,
c_2Ebool_2EF_2E0: $i ).
tff(combin_k_2E0,type,
combin_k_2E0: $i ).
tff(f_317,negated_conjecture,
~ ! [A_27a,A_27b,V0s_2E0,V1t_2E0] :
( ~ p(s(tyop_2Emin_2Ebool,c_2Ecardinal_2Ecardleq_2E2(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),V0s_2E0),s(tyop_2Emin_2Efun(A_27b,tyop_2Emin_2Ebool),V1t_2E0))))
<=> ~ p(s(tyop_2Emin_2Ebool,c_2Ecardinal_2Ecardleq_2E2(s(tyop_2Emin_2Efun(A_27a,tyop_2Emin_2Ebool),V0s_2E0),s(tyop_2Emin_2Efun(A_27b,tyop_2Emin_2Ebool),V1t_2E0)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm_2Ecardinal_2ECARD__NOT__LE) ).
tff(c_593,plain,
~ p(s(tyop_2Emin_2Ebool,c_2Ecardinal_2Ecardleq_2E2(s(tyop_2Emin_2Efun('#skF_5',tyop_2Emin_2Ebool),'#skF_7'),s(tyop_2Emin_2Efun('#skF_6',tyop_2Emin_2Ebool),'#skF_8')))),
inference(cnfTransformation,[status(thm)],[f_317]) ).
tff(c_591,plain,
p(s(tyop_2Emin_2Ebool,c_2Ecardinal_2Ecardleq_2E2(s(tyop_2Emin_2Efun('#skF_5',tyop_2Emin_2Ebool),'#skF_7'),s(tyop_2Emin_2Efun('#skF_6',tyop_2Emin_2Ebool),'#skF_8')))),
inference(cnfTransformation,[status(thm)],[f_317]) ).
tff(c_594,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_593,c_591]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ITP010+1 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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 19:19:46 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.09/2.00 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.09/2.00
% 4.09/2.00 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.09/2.04
% 4.09/2.04 Inference rules
% 4.09/2.04 ----------------------
% 4.09/2.04 #Ref : 0
% 4.09/2.04 #Sup : 0
% 4.09/2.04 #Fact : 0
% 4.09/2.04 #Define : 0
% 4.09/2.04 #Split : 0
% 4.09/2.04 #Chain : 0
% 4.09/2.04 #Close : 0
% 4.09/2.04
% 4.09/2.04 Ordering : KBO
% 4.09/2.04
% 4.09/2.04 Simplification rules
% 4.09/2.04 ----------------------
% 4.09/2.04 #Subsume : 84
% 4.09/2.04 #Demod : 0
% 4.09/2.04 #Tautology : 211
% 4.09/2.04 #SimpNegUnit : 1
% 4.09/2.04 #BackRed : 0
% 4.09/2.04
% 4.09/2.04 #Partial instantiations: 0
% 4.09/2.04 #Strategies tried : 1
% 4.09/2.04
% 4.09/2.04 Timing (in seconds)
% 4.09/2.04 ----------------------
% 4.09/2.04 Preprocessing : 0.84
% 4.28/2.04 Parsing : 0.41
% 4.28/2.04 CNF conversion : 0.07
% 4.28/2.04 Main loop : 0.05
% 4.28/2.04 Inferencing : 0.00
% 4.28/2.04 Reduction : 0.01
% 4.28/2.04 Demodulation : 0.01
% 4.28/2.04 BG Simplification : 0.08
% 4.28/2.04 Subsumption : 0.02
% 4.28/2.04 Abstraction : 0.02
% 4.28/2.04 MUC search : 0.00
% 4.28/2.04 Cooper : 0.00
% 4.28/2.04 Total : 0.94
% 4.28/2.04 Index Insertion : 0.00
% 4.28/2.04 Index Deletion : 0.00
% 4.28/2.04 Index Matching : 0.00
% 4.28/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------