%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU424+1 : TPTP v9.0.0. Released v3.4.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 : n011.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 : Wed Apr 9 08:53:59 PM UTC 2025
% Result : Theorem 6.15s 2.45s
% Output : CNFRefutation 6.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 6 unt; 0 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 : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 23 ( 23 usr; 8 con; 0-5 aty)
% Number of variables : 12 ( 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ m2_relset_1 > m1_relset_1 > r2_hidden > r1_tarski > m1_subset_1 > v3_relat_1 > v1_xboole_0 > v1_relat_1 > k2_relset_2 > k10_relset_1 > a_4_0_relset_2 > k9_relat_1 > k2_zfmisc_1 > #nlpp > k1_zfmisc_1 > k1_tarski > k1_xboole_0 > #skF_11 > #skF_14 > #skF_8 > #skF_10 > #skF_13 > #skF_2 > #skF_3 > #skF_1 > #skF_9 > #skF_4 > #skF_12 > #skF_7 > #skF_5 > #skF_15 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m2_relset_1,type,
m2_relset_1: ( $i * $i * $i ) > $o ).
tff(r2_hidden,type,
r2_hidden: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(k1_tarski,type,
k1_tarski: $i > $i ).
tff(k1_xboole_0,type,
k1_xboole_0: $i ).
tff(v3_relat_1,type,
v3_relat_1: $i > $o ).
tff(k2_relset_2,type,
k2_relset_2: ( $i * $i * $i * $i ) > $i ).
tff(r1_tarski,type,
r1_tarski: ( $i * $i ) > $o ).
tff(m1_relset_1,type,
m1_relset_1: ( $i * $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i * $i * $i ) > $i ).
tff(a_4_0_relset_2,type,
a_4_0_relset_2: ( $i * $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
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_9',type,
'#skF_9': $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(k10_relset_1,type,
k10_relset_1: ( $i * $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff(v1_xboole_0,type,
v1_xboole_0: $i > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $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(A))
=> ! [D] :
( m2_relset_1(D,A,B)
=> m1_subset_1(a_4_0_relset_2(A,B,C,D),k1_zfmisc_1(k1_zfmisc_1(B))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_relset_2) ).
tff(f_172,axiom,
! [A,B,C,D] :
( ( ~ v1_xboole_0(A)
& m1_subset_1(C,k1_zfmisc_1(A))
& m2_relset_1(D,A,B) )
=> m1_subset_1(a_4_0_relset_2(A,B,C,D),k1_zfmisc_1(k1_zfmisc_1(B))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s8_domain_1__e1_22__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('#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_2629,plain,
! [A_394,B_395,C_396,D_397] :
( m1_subset_1(a_4_0_relset_2(A_394,B_395,C_396,D_397),k1_zfmisc_1(k1_zfmisc_1(B_395)))
| ~ m2_relset_1(D_397,A_394,B_395)
| ~ m1_subset_1(C_396,k1_zfmisc_1(A_394))
| v1_xboole_0(A_394) ),
inference(cnfTransformation,[status(thm)],[f_172]) ).
tff(c_2,plain,
~ m1_subset_1(a_4_0_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_2641,plain,
( ~ m2_relset_1('#skF_4','#skF_1','#skF_2')
| ~ m1_subset_1('#skF_3',k1_zfmisc_1('#skF_1'))
| v1_xboole_0('#skF_1') ),
inference(resolution,[status(thm)],[c_2629,c_2]) ).
tff(c_2650,plain,
v1_xboole_0('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4,c_2641]) ).
tff(c_2652,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_2650]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU424+1 : TPTP v9.0.0. Released v3.4.0.
% 0.06/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 : n011.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 : Tue Apr 8 23:20:03 EDT 2025
% 0.13/0.34 % CPUTime :
% 6.15/2.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.36/2.45
% 6.36/2.45 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------