TSTP Solution File: SEU429+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU429+1 : TPTP v8.1.2. Released v3.4.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 : n020.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:58:44 EDT 2023
% Result : Theorem 6.91s 2.78s
% Output : CNFRefutation 6.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 42
% Syntax : Number of formulae : 50 ( 6 unt; 40 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 9 ~; 5 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 69 ( 32 >; 37 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 29 ( 29 usr; 8 con; 0-5 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ v1_funct_2 > m2_relset_1 > m1_relset_1 > r2_hidden > r1_tarski > m1_subset_1 > m1_eqrel_1 > v3_relat_1 > v1_xboole_0 > v1_relat_1 > v1_funct_1 > k8_relset_2 > k7_relset_2 > k4_relset_2 > a_4_1_relset_2 > k6_relset_2 > k9_relat_1 > k8_setfam_1 > k5_relset_2 > k2_zfmisc_1 > #nlpp > k3_pua2mss1 > k1_zfmisc_1 > k1_xboole_0 > #skF_7 > #skF_5 > #skF_6 > #skF_15 > #skF_17 > #skF_10 > #skF_12 > #skF_13 > #skF_2 > #skF_3 > #skF_1 > #skF_8 > #skF_4 > #skF_11 > #skF_14 > #skF_9 > #skF_16
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(m2_relset_1,type,
m2_relset_1: ( $i * $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(v1_funct_1,type,
v1_funct_1: $i > $o ).
tff(k4_relset_2,type,
k4_relset_2: ( $i * $i * $i * $i ) > $i ).
tff(m1_eqrel_1,type,
m1_eqrel_1: ( $i * $i ) > $o ).
tff(r2_hidden,type,
r2_hidden: ( $i * $i ) > $o ).
tff('#skF_15',type,
'#skF_15': $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff(k1_xboole_0,type,
k1_xboole_0: $i ).
tff(a_4_1_relset_2,type,
a_4_1_relset_2: ( $i * $i * $i * $i ) > $i ).
tff(k8_setfam_1,type,
k8_setfam_1: ( $i * $i ) > $i ).
tff(v3_relat_1,type,
v3_relat_1: $i > $o ).
tff(r1_tarski,type,
r1_tarski: ( $i * $i ) > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(m1_relset_1,type,
m1_relset_1: ( $i * $i * $i ) > $o ).
tff(k8_relset_2,type,
k8_relset_2: ( $i * $i * $i * $i ) > $i ).
tff(k6_relset_2,type,
k6_relset_2: ( $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(v1_funct_2,type,
v1_funct_2: ( $i * $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(k9_relat_1,type,
k9_relat_1: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(k1_zfmisc_1,type,
k1_zfmisc_1: $i > $i ).
tff(v1_relat_1,type,
v1_relat_1: $i > $o ).
tff(k2_zfmisc_1,type,
k2_zfmisc_1: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i * $i * $i ) > $i ).
tff(k3_pua2mss1,type,
k3_pua2mss1: $i > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff(v1_xboole_0,type,
v1_xboole_0: $i > $o ).
tff(k5_relset_2,type,
k5_relset_2: ( $i * $i ) > $i ).
tff(k7_relset_2,type,
k7_relset_2: ( $i * $i * $i * $i ) > $i ).
tff(m1_subset_1,type,
m1_subset_1: ( $i * $i ) > $o ).
tff(f_41,negated_conjecture,
~ ! [A] :
( ~ v1_xboole_0(A)
=> ! [B,C] :
( m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A)))
=> ! [D] :
( m2_relset_1(D,A,B)
=> m1_subset_1(a_4_1_relset_2(A,B,C,D),k1_zfmisc_1(k1_zfmisc_1(B))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_relset_2) ).
tff(f_213,axiom,
! [A,B,C,D] :
( ( ~ v1_xboole_0(A)
& m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(A)))
& m2_relset_1(D,A,B) )
=> m1_subset_1(a_4_1_relset_2(A,B,C,D),k1_zfmisc_1(k1_zfmisc_1(B))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s8_domain_1__e1_38__relset_2) ).
tff(c_8,plain,
~ v1_xboole_0('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_6,plain,
m1_subset_1('#skF_3',k1_zfmisc_1(k1_zfmisc_1('#skF_1'))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_4,plain,
m2_relset_1('#skF_4','#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_3781,plain,
! [A_559,B_560,C_561,D_562] :
( m1_subset_1(a_4_1_relset_2(A_559,B_560,C_561,D_562),k1_zfmisc_1(k1_zfmisc_1(B_560)))
| ~ m2_relset_1(D_562,A_559,B_560)
| ~ m1_subset_1(C_561,k1_zfmisc_1(k1_zfmisc_1(A_559)))
| v1_xboole_0(A_559) ),
inference(cnfTransformation,[status(thm)],[f_213]) ).
tff(c_2,plain,
~ m1_subset_1(a_4_1_relset_2('#skF_1','#skF_2','#skF_3','#skF_4'),k1_zfmisc_1(k1_zfmisc_1('#skF_2'))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_3797,plain,
( ~ m2_relset_1('#skF_4','#skF_1','#skF_2')
| ~ m1_subset_1('#skF_3',k1_zfmisc_1(k1_zfmisc_1('#skF_1')))
| v1_xboole_0('#skF_1') ),
inference(resolution,[status(thm)],[c_3781,c_2]) ).
tff(c_3809,plain,
v1_xboole_0('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4,c_3797]) ).
tff(c_3811,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_3809]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU429+1 : TPTP v8.1.2. Released v3.4.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 : n020.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 12:09:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.91/2.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.91/2.79
% 6.91/2.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.91/2.81
% 6.91/2.81 Inference rules
% 6.91/2.81 ----------------------
% 6.91/2.81 #Ref : 0
% 6.91/2.81 #Sup : 810
% 6.91/2.81 #Fact : 0
% 6.91/2.81 #Define : 0
% 6.91/2.81 #Split : 4
% 6.91/2.81 #Chain : 0
% 6.91/2.81 #Close : 0
% 6.91/2.81
% 6.91/2.81 Ordering : KBO
% 6.91/2.81
% 6.91/2.81 Simplification rules
% 6.91/2.81 ----------------------
% 6.91/2.81 #Subsume : 143
% 6.91/2.81 #Demod : 153
% 6.91/2.81 #Tautology : 167
% 6.91/2.81 #SimpNegUnit : 61
% 6.91/2.81 #BackRed : 32
% 6.91/2.81
% 6.91/2.81 #Partial instantiations: 0
% 6.91/2.81 #Strategies tried : 1
% 6.91/2.81
% 6.91/2.81 Timing (in seconds)
% 6.91/2.81 ----------------------
% 6.91/2.81 Preprocessing : 0.65
% 6.91/2.81 Parsing : 0.33
% 6.91/2.81 CNF conversion : 0.05
% 6.91/2.81 Main loop : 1.03
% 6.91/2.81 Inferencing : 0.38
% 6.91/2.82 Reduction : 0.29
% 6.91/2.82 Demodulation : 0.20
% 6.91/2.82 BG Simplification : 0.05
% 6.91/2.82 Subsumption : 0.24
% 6.91/2.82 Abstraction : 0.04
% 6.91/2.82 MUC search : 0.00
% 6.91/2.82 Cooper : 0.00
% 6.91/2.82 Total : 1.73
% 6.91/2.82 Index Insertion : 0.00
% 6.91/2.82 Index Deletion : 0.00
% 6.91/2.82 Index Matching : 0.00
% 6.91/2.82 BG Taut test : 0.00
%------------------------------------------------------------------------------