TSTP Solution File: SEU435+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU435+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 : n009.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:46 EDT 2023
% Result : Theorem 10.84s 3.56s
% Output : CNFRefutation 10.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 44
% Syntax : Number of formulae : 50 ( 4 unt; 42 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 3 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 73 ( 32 >; 41 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 31 ( 31 usr; 10 con; 0-7 aty)
% Number of variables : 18 (; 18 !; 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 > a_6_0_relset_2 > k8_relset_2 > k7_relset_2 > k4_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_9 > #skF_7 > #skF_16 > #skF_17 > #skF_15 > #skF_14 > #skF_11 > #skF_18 > #skF_5 > #skF_19 > #skF_6 > #skF_2 > #skF_10 > #skF_3 > #skF_1 > #skF_8 > #skF_13 > #skF_4 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(m2_relset_1,type,
m2_relset_1: ( $i * $i * $i ) > $o ).
tff('#skF_16',type,
'#skF_16': $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('#skF_17',type,
'#skF_17': $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(k1_xboole_0,type,
k1_xboole_0: $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(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('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff(k6_relset_2,type,
k6_relset_2: ( $i * $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i ) > $i ).
tff(v1_funct_2,type,
v1_funct_2: ( $i * $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(k9_relat_1,type,
k9_relat_1: ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $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('#skF_13',type,
'#skF_13': $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(a_6_0_relset_2,type,
a_6_0_relset_2: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(k3_pua2mss1,type,
k3_pua2mss1: $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('#skF_12',type,
'#skF_12': $i ).
tff(m1_subset_1,type,
m1_subset_1: ( $i * $i ) > $o ).
tff(f_37,negated_conjecture,
~ ! [A,B,C] :
( m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(A,B))))
=> ! [D,E,F] :
( m1_subset_1(F,k1_zfmisc_1(D))
=> m1_subset_1(a_6_0_relset_2(A,B,C,D,E,F),k1_zfmisc_1(k1_zfmisc_1(E))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_relset_2) ).
tff(f_203,axiom,
! [A,B,C,D,E,F] :
( ( m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(A,B))))
& m1_subset_1(F,k1_zfmisc_1(D)) )
=> m1_subset_1(a_6_0_relset_2(A,B,C,D,E,F),k1_zfmisc_1(k1_zfmisc_1(E))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s8_domain_1__e1_46__relset_2) ).
tff(c_6,plain,
m1_subset_1('#skF_3',k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1('#skF_1','#skF_2')))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_4,plain,
m1_subset_1('#skF_6',k1_zfmisc_1('#skF_4')),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_8898,plain,
! [E_997,F_994,C_992,A_993,B_995,D_996] :
( m1_subset_1(a_6_0_relset_2(A_993,B_995,C_992,D_996,E_997,F_994),k1_zfmisc_1(k1_zfmisc_1(E_997)))
| ~ m1_subset_1(F_994,k1_zfmisc_1(D_996))
| ~ m1_subset_1(C_992,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(A_993,B_995)))) ),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_2,plain,
~ m1_subset_1(a_6_0_relset_2('#skF_1','#skF_2','#skF_3','#skF_4','#skF_5','#skF_6'),k1_zfmisc_1(k1_zfmisc_1('#skF_5'))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_8912,plain,
( ~ m1_subset_1('#skF_6',k1_zfmisc_1('#skF_4'))
| ~ m1_subset_1('#skF_3',k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1('#skF_1','#skF_2')))) ),
inference(resolution,[status(thm)],[c_8898,c_2]) ).
tff(c_8923,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4,c_8912]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU435+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.13 % 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.34 % Computer : n009.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 11:50:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 10.84/3.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.84/3.56
% 10.84/3.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.84/3.59
% 10.84/3.59 Inference rules
% 10.84/3.59 ----------------------
% 10.84/3.59 #Ref : 0
% 10.84/3.59 #Sup : 1959
% 10.84/3.59 #Fact : 0
% 10.84/3.59 #Define : 0
% 10.84/3.59 #Split : 26
% 10.84/3.59 #Chain : 0
% 10.84/3.59 #Close : 0
% 10.84/3.59
% 10.84/3.59 Ordering : KBO
% 10.84/3.59
% 10.84/3.59 Simplification rules
% 10.84/3.59 ----------------------
% 10.84/3.59 #Subsume : 320
% 10.84/3.59 #Demod : 398
% 10.84/3.59 #Tautology : 375
% 10.84/3.59 #SimpNegUnit : 124
% 10.84/3.59 #BackRed : 80
% 10.84/3.59
% 10.84/3.59 #Partial instantiations: 0
% 10.84/3.59 #Strategies tried : 1
% 10.84/3.59
% 10.84/3.59 Timing (in seconds)
% 10.84/3.59 ----------------------
% 10.84/3.59 Preprocessing : 0.64
% 10.84/3.59 Parsing : 0.32
% 10.84/3.59 CNF conversion : 0.05
% 10.84/3.59 Main loop : 1.90
% 10.84/3.59 Inferencing : 0.74
% 10.84/3.59 Reduction : 0.57
% 10.84/3.59 Demodulation : 0.37
% 10.84/3.59 BG Simplification : 0.06
% 10.84/3.59 Subsumption : 0.38
% 10.84/3.59 Abstraction : 0.07
% 10.84/3.59 MUC search : 0.00
% 10.84/3.59 Cooper : 0.00
% 10.84/3.59 Total : 2.58
% 10.84/3.59 Index Insertion : 0.00
% 10.84/3.59 Index Deletion : 0.00
% 10.84/3.59 Index Matching : 0.00
% 10.84/3.59 BG Taut test : 0.00
%------------------------------------------------------------------------------