%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : COM021+4 : 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/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 : 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 : Wed Apr 9 05:50:36 PM UTC 2025
% Result : Theorem 4.66s 1.93s
% Output : CNFRefutation 4.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 41 ( 6 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 35 ( 4 ~; 12 |; 19 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 37 ( 37 usr; 18 con; 0-4 aty)
% Number of variables : 6 ( 1 !; 5 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtmndtplgtdt0 > sdtmndtasgtdt0 > aReductOfIn0 > aNormalFormOfIn0 > iLess0 > isTerminating0 > isLocallyConfluent0 > isConfluent0 > aRewritingSystem0 > aElement0 > #nlpp > xx > xw > xv > xu > xd > xc > xb > xa > xR > #skF_9 > #skF_7 > #skF_5 > #skF_17 > #skF_1 > #skF_20 > #skF_4 > #skF_25 > #skF_18 > #skF_12 > #skF_8 > #skF_13 > #skF_26 > #skF_10 > #skF_2 > #skF_19 > #skF_6 > #skF_21 > #skF_15 > #skF_14 > #skF_3 > #skF_11 > #skF_22 > #skF_28 > #skF_24 > #skF_27 > #skF_23 > #skF_16
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(sdtmndtplgtdt0,type,
sdtmndtplgtdt0: ( $i * $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(aReductOfIn0,type,
aReductOfIn0: ( $i * $i * $i ) > $o ).
tff(xa,type,
xa: $i ).
tff(xd,type,
xd: $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff(xw,type,
xw: $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff(xu,type,
xu: $i ).
tff(isTerminating0,type,
isTerminating0: $i > $o ).
tff(aNormalFormOfIn0,type,
aNormalFormOfIn0: ( $i * $i * $i ) > $o ).
tff(xR,type,
xR: $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff(xc,type,
xc: $i ).
tff('#skF_26',type,
'#skF_26': $i ).
tff(xx,type,
xx: $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': $i ).
tff(xb,type,
xb: $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff(aRewritingSystem0,type,
aRewritingSystem0: $i > $o ).
tff('#skF_28',type,
'#skF_28': $i ).
tff('#skF_24',type,
'#skF_24': $i ).
tff('#skF_27',type,
'#skF_27': $i ).
tff('#skF_23',type,
'#skF_23': $i ).
tff(isConfluent0,type,
isConfluent0: $i > $o ).
tff(isLocallyConfluent0,type,
isLocallyConfluent0: $i > $o ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(sdtmndtasgtdt0,type,
sdtmndtasgtdt0: ( $i * $i * $i ) > $o ).
tff(xv,type,
xv: $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_495,negated_conjecture,
~ ( ( xb = xd )
| aReductOfIn0(xd,xb,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xb,xR)
& sdtmndtplgtdt0(W0,xR,xd) )
| sdtmndtplgtdt0(xb,xR,xd)
| sdtmndtasgtdt0(xb,xR,xd) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_449,hypothesis,
( aElement0(xd)
& ( ( xw = xd )
| ( ( aReductOfIn0(xd,xw,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xw,xR)
& sdtmndtplgtdt0(W0,xR,xd) ) )
& sdtmndtplgtdt0(xw,xR,xd) ) )
& sdtmndtasgtdt0(xw,xR,xd)
& ~ ? [W0] : aReductOfIn0(W0,xd,xR)
& aNormalFormOfIn0(xd,xw,xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).
tff(f_480,hypothesis,
( aElement0(xx)
& ( ( xb = xx )
| ( ( aReductOfIn0(xx,xb,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xb,xR)
& sdtmndtplgtdt0(W0,xR,xx) ) )
& sdtmndtplgtdt0(xb,xR,xx) ) )
& sdtmndtasgtdt0(xb,xR,xx)
& ( ( xd = xx )
| ( ( aReductOfIn0(xx,xd,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xd,xR)
& sdtmndtplgtdt0(W0,xR,xx) ) )
& sdtmndtplgtdt0(xd,xR,xx) ) )
& sdtmndtasgtdt0(xd,xR,xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__850) ).
tff(c_782,plain,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(cnfTransformation,[status(thm)],[f_495]) ).
tff(c_746,plain,
! [W0_115] : ~ aReductOfIn0(W0_115,xd,xR),
inference(cnfTransformation,[status(thm)],[f_449]) ).
tff(c_770,plain,
( aReductOfIn0('#skF_27',xd,xR)
| aReductOfIn0(xx,xd,xR)
| ( xx = xd ) ),
inference(cnfTransformation,[status(thm)],[f_480]) ).
tff(c_793,plain,
xx = xd,
inference(negUnitSimplification,[status(thm)],[c_746,c_746,c_770]) ).
tff(c_762,plain,
sdtmndtasgtdt0(xb,xR,xx),
inference(cnfTransformation,[status(thm)],[f_480]) ).
tff(c_796,plain,
sdtmndtasgtdt0(xb,xR,xd),
inference(demodulation,[status(thm),theory(equality)],[c_793,c_762]) ).
tff(c_806,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_782,c_796]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM021+4 : TPTP v9.0.0. Released v4.0.0.
% 0.03/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.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 16:13:53 EDT 2025
% 0.12/0.34 % CPUTime :
% 4.66/1.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.66/1.94
% 4.66/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------