%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : NUM606+1 : TPTP v9.0.0. Released v4.0.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 : n018.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 07:56:35 PM UTC 2025
% Result : Theorem 13.96s 4.64s
% Output : CNFRefutation 14.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 12 unt; 0 typ; 1 def)
% Number of atoms : 65 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 64 ( 27 ~; 24 |; 8 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 59 ( 59 usr; 14 con; 0-4 aty)
% Number of variables : 16 ( 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aFunction0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > sdtlpdtrp0 > sdtlcdtrc0 > sdtlbdtrb0 > sdtexdt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > szDzozmdt0 > szDzizrdt0 > slbdtrb0 > sbrdtbr0 > xk > xe > xd > xc > xT > xS > xQ > xO > xN > xK > xC > szNzAzT0 > sz00 > slcrc0 > #skF_26 > #skF_7 > #skF_11 > #skF_17 > #skF_6 > #skF_27 > #skF_1 > #skF_31 > #skF_18 > #skF_4 > #skF_29 > #skF_12 > #skF_23 > #skF_28 > #skF_5 > #skF_19 > #skF_10 > #skF_8 > #skF_20 > #skF_24 > #skF_15 > #skF_13 > #skF_14 > #skF_25 > #skF_3 > #skF_2 > #skF_21 > #skF_9 > #skF_22 > #skF_30 > #skF_16
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $i ).
tff('#skF_26',type,
'#skF_26': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff(sdtlbdtrb0,type,
sdtlbdtrb0: ( $i * $i ) > $i ).
tff(szDzozmdt0,type,
szDzozmdt0: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(xd,type,
xd: $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i * $i ) > $i ).
tff(sdtmndt0,type,
sdtmndt0: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_31',type,
'#skF_31': $i > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sdtexdt0,type,
sdtexdt0: ( $i * $i ) > $i ).
tff(szNzAzT0,type,
szNzAzT0: $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(xS,type,
xS: $i ).
tff(sz00,type,
sz00: $i ).
tff(sdtlpdtrp0,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(xc,type,
xc: $i ).
tff(xe,type,
xe: $i ).
tff('#skF_29',type,
'#skF_29': $i > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(slbdtsldtrb0,type,
slbdtsldtrb0: ( $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i ) > $i ).
tff(isCountable0,type,
isCountable0: $i > $o ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(xT,type,
xT: $i ).
tff(xN,type,
xN: $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(xC,type,
xC: $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i * $i ) > $i ).
tff(szDzizrdt0,type,
szDzizrdt0: $i > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff(xO,type,
xO: $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff(slcrc0,type,
slcrc0: $i ).
tff(aFunction0,type,
aFunction0: $i > $o ).
tff(isFinite0,type,
isFinite0: $i > $o ).
tff(xQ,type,
xQ: $i ).
tff('#skF_25',type,
'#skF_25': ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(sdtlcdtrc0,type,
sdtlcdtrc0: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(szmzizndt0,type,
szmzizndt0: $i > $i ).
tff(szmzazxdt0,type,
szmzazxdt0: $i > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i ) > $i ).
tff(xK,type,
xK: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(slbdtrb0,type,
slbdtrb0: $i > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': $i > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_869,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_852,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
tff(f_867,hypothesis,
( aSubsetOf0(xQ,xO)
& ( xQ != slcrc0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
tff(f_84,definition,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
=> aElementOf0(W2,W0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
tff(f_211,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
tff(f_667,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
tff(f_862,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
tff(f_119,axiom,
! [W0,W1,W2] :
( ( aSet0(W0)
& aSet0(W1)
& aSet0(W2) )
=> ( ( aSubsetOf0(W0,W1)
& aSubsetOf0(W1,W2) )
=> aSubsetOf0(W0,W2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
tff(c_450,plain,
~ aSubsetOf0(xQ,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_869]) ).
tff(c_434,plain,
aSet0(xO),
inference(cnfTransformation,[status(thm)],[f_852]) ).
tff(c_448,plain,
aSubsetOf0(xQ,xO),
inference(cnfTransformation,[status(thm)],[f_867]) ).
tff(c_1107,plain,
! [W1_492,W0_493] :
( aSet0(W1_492)
| ~ aSubsetOf0(W1_492,W0_493)
| ~ aSet0(W0_493) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_1125,plain,
( aSet0(xQ)
| ~ aSet0(xO) ),
inference(resolution,[status(thm)],[c_448,c_1107]) ).
tff(c_1140,plain,
aSet0(xQ),
inference(demodulation,[status(thm),theory(equality)],[c_434,c_1125]) ).
tff(c_108,plain,
aSet0(szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_211]) ).
tff(c_340,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_1119,plain,
( aSet0(xS)
| ~ aSet0(szNzAzT0) ),
inference(resolution,[status(thm)],[c_340,c_1107]) ).
tff(c_1135,plain,
aSet0(xS),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_1119]) ).
tff(c_442,plain,
aSubsetOf0(xO,xS),
inference(cnfTransformation,[status(thm)],[f_862]) ).
tff(c_8797,plain,
! [W0_871,W2_872,W1_873] :
( aSubsetOf0(W0_871,W2_872)
| ~ aSubsetOf0(W1_873,W2_872)
| ~ aSubsetOf0(W0_871,W1_873)
| ~ aSet0(W2_872)
| ~ aSet0(W1_873)
| ~ aSet0(W0_871) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_8845,plain,
! [W0_871] :
( aSubsetOf0(W0_871,xS)
| ~ aSubsetOf0(W0_871,xO)
| ~ aSet0(xS)
| ~ aSet0(xO)
| ~ aSet0(W0_871) ),
inference(resolution,[status(thm)],[c_442,c_8797]) ).
tff(c_9736,plain,
! [W0_885] :
( aSubsetOf0(W0_885,xS)
| ~ aSubsetOf0(W0_885,xO)
| ~ aSet0(W0_885) ),
inference(demodulation,[status(thm),theory(equality)],[c_434,c_1135,c_8845]) ).
tff(c_8843,plain,
! [W0_871] :
( aSubsetOf0(W0_871,szNzAzT0)
| ~ aSubsetOf0(W0_871,xS)
| ~ aSet0(szNzAzT0)
| ~ aSet0(xS)
| ~ aSet0(W0_871) ),
inference(resolution,[status(thm)],[c_340,c_8797]) ).
tff(c_8904,plain,
! [W0_871] :
( aSubsetOf0(W0_871,szNzAzT0)
| ~ aSubsetOf0(W0_871,xS)
| ~ aSet0(W0_871) ),
inference(demodulation,[status(thm),theory(equality)],[c_1135,c_108,c_8843]) ).
tff(c_10095,plain,
! [W0_891] :
( aSubsetOf0(W0_891,szNzAzT0)
| ~ aSubsetOf0(W0_891,xO)
| ~ aSet0(W0_891) ),
inference(resolution,[status(thm)],[c_9736,c_8904]) ).
tff(c_10109,plain,
( aSubsetOf0(xQ,szNzAzT0)
| ~ aSet0(xQ) ),
inference(resolution,[status(thm)],[c_448,c_10095]) ).
tff(c_10121,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(demodulation,[status(thm),theory(equality)],[c_1140,c_10109]) ).
tff(c_10123,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_450,c_10121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.37 % Problem : NUM606+1 : TPTP v9.0.0. Released v4.0.0.
% 0.12/0.38 % 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.17/0.65 % Computer : n018.cluster.edu
% 0.17/0.65 % Model : x86_64 x86_64
% 0.17/0.65 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.65 % Memory : 8042.1875MB
% 0.17/0.65 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.65 % CPULimit : 300
% 0.17/0.65 % WCLimit : 300
% 0.17/0.65 % DateTime : Tue Apr 8 14:03:32 EDT 2025
% 0.17/0.65 % CPUTime :
% 13.96/4.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.96/4.65
% 13.96/4.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------