TSTP Solution File: ITP010+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ITP010+2 : 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.24s 1.97s
% Output : CNFRefutation 4.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 26
% Syntax : Number of formulae : 29 ( 3 unt; 25 typ; 0 def)
% Number of atoms : 9 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 9 ( 4 ~; 0 |; 0 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 13 >; 10 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 12 con; 0-4 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ mem > p > ne > k > c_2Ecardinal_2Ecardleq > arr > ap > #nlpp > i > c_2Emin_2E_3D > c_2Ebool_2E_21 > ind > c_2Emin_2E_3D_3D_3E > c_2Ebool_2E_7E > c_2Ebool_2E_5C_2F > c_2Ebool_2E_2F_5C > c_2Ebool_2ET > c_2Ebool_2EF > bool > #skF_7 > #skF_3 > #skF_5 > #skF_6 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_2Ecardinal_2Ecardleq,type,
c_2Ecardinal_2Ecardleq: ( $i * $i ) > $i ).
tff(arr,type,
arr: ( $i * $i ) > $i ).
tff(ne,type,
ne: $i > $o ).
tff(c_2Ebool_2EF,type,
c_2Ebool_2EF: $i ).
tff(i,type,
i: $i > $i ).
tff(c_2Ebool_2E_21,type,
c_2Ebool_2E_21: $i > $i ).
tff(bool,type,
bool: $i ).
tff(mem,type,
mem: ( $i * $i ) > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(ap,type,
ap: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(p,type,
p: $i > $o ).
tff(ind,type,
ind: $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(c_2Emin_2E_3D_3D_3E,type,
c_2Emin_2E_3D_3D_3E: $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(c_2Ebool_2E_5C_2F,type,
c_2Ebool_2E_5C_2F: $i ).
tff(c_2Ebool_2E_7E,type,
c_2Ebool_2E_7E: $i ).
tff(c_2Ebool_2ET,type,
c_2Ebool_2ET: $i ).
tff(k,type,
k: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i * $i ) > $i ).
tff(c_2Emin_2E_3D,type,
c_2Emin_2E_3D: $i > $i ).
tff(c_2Ebool_2E_2F_5C,type,
c_2Ebool_2E_2F_5C: $i ).
tff(f_438,negated_conjecture,
~ ! [A_27a] :
( ne(A_27a)
=> ! [A_27b] :
( ne(A_27b)
=> ! [V0s] :
( mem(V0s,arr(A_27a,bool))
=> ! [V1t] :
( mem(V1t,arr(A_27b,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(A_27a,A_27b),V0s),V1t))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(A_27a,A_27b),V0s),V1t)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecardinal_2ECARD__NOT__LE) ).
tff(c_1247,plain,
~ p(ap(ap(c_2Ecardinal_2Ecardleq('#skF_4','#skF_5'),'#skF_6'),'#skF_7')),
inference(cnfTransformation,[status(thm)],[f_438]) ).
tff(c_1245,plain,
p(ap(ap(c_2Ecardinal_2Ecardleq('#skF_4','#skF_5'),'#skF_6'),'#skF_7')),
inference(cnfTransformation,[status(thm)],[f_438]) ).
tff(c_1256,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1247,c_1245]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ITP010+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.00/0.13 % 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.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 19:07:01 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.24/1.97 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.24/1.98
% 4.24/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.24/2.01
% 4.24/2.01 Inference rules
% 4.24/2.01 ----------------------
% 4.24/2.01 #Ref : 0
% 4.24/2.01 #Sup : 0
% 4.24/2.01 #Fact : 0
% 4.24/2.01 #Define : 0
% 4.24/2.01 #Split : 0
% 4.24/2.01 #Chain : 0
% 4.24/2.01 #Close : 0
% 4.24/2.01
% 4.24/2.01 Ordering : KBO
% 4.24/2.01
% 4.24/2.01 Simplification rules
% 4.24/2.01 ----------------------
% 4.24/2.01 #Subsume : 44
% 4.24/2.01 #Demod : 0
% 4.24/2.01 #Tautology : 582
% 4.24/2.01 #SimpNegUnit : 1
% 4.24/2.01 #BackRed : 0
% 4.24/2.01
% 4.24/2.01 #Partial instantiations: 0
% 4.24/2.01 #Strategies tried : 1
% 4.24/2.01
% 4.24/2.01 Timing (in seconds)
% 4.24/2.01 ----------------------
% 4.24/2.02 Preprocessing : 0.85
% 4.37/2.02 Parsing : 0.26
% 4.37/2.02 CNF conversion : 0.10
% 4.37/2.02 Main loop : 0.06
% 4.37/2.02 Inferencing : 0.00
% 4.37/2.02 Reduction : 0.03
% 4.37/2.02 Demodulation : 0.02
% 4.37/2.02 BG Simplification : 0.12
% 4.37/2.02 Subsumption : 0.02
% 4.37/2.02 Abstraction : 0.02
% 4.37/2.02 MUC search : 0.00
% 4.37/2.02 Cooper : 0.00
% 4.37/2.02 Total : 0.96
% 4.37/2.02 Index Insertion : 0.00
% 4.37/2.02 Index Deletion : 0.00
% 4.37/2.02 Index Matching : 0.00
% 4.37/2.02 BG Taut test : 0.00
%------------------------------------------------------------------------------