TSTP Solution File: COM016+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM016+1 : TPTP v8.1.2. 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 : n032.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:35:18 EDT 2023
% Result : Theorem 8.44s 3.01s
% Output : CNFRefutation 8.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 34
% Syntax : Number of formulae : 55 ( 9 unt; 28 typ; 2 def)
% Number of atoms : 95 ( 1 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 120 ( 52 ~; 53 |; 11 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 46 ( 24 >; 22 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 4 con; 0-4 aty)
% Number of variables : 28 (; 26 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtmndtplgtdt0 > sdtmndtasgtdt0 > aReductOfIn0 > aNormalFormOfIn0 > iLess0 > isTerminating0 > isLocallyConfluent0 > isConfluent0 > aRewritingSystem0 > aElement0 > #nlpp > xc > xb > xa > xR > #skF_9 > #skF_7 > #skF_5 > #skF_1 > #skF_4 > #skF_12 > #skF_8 > #skF_13 > #skF_10 > #skF_2 > #skF_6 > #skF_14 > #skF_3 > #skF_11
%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_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(aReductOfIn0,type,
aReductOfIn0: ( $i * $i * $i ) > $o ).
tff(xa,type,
xa: $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(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_10',type,
'#skF_10': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i * $i ) > $i ).
tff(xb,type,
xb: $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(aRewritingSystem0,type,
aRewritingSystem0: $i > $o ).
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(f_206,hypothesis,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731) ).
tff(f_198,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
tff(f_101,definition,
! [W0,W1,W2] :
( ( aElement0(W0)
& aRewritingSystem0(W1)
& aElement0(W2) )
=> ( sdtmndtasgtdt0(W0,W1,W2)
<=> ( ( W0 = W2 )
| sdtmndtplgtdt0(W0,W1,W2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).
tff(f_235,negated_conjecture,
~ ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xa,xR)
& sdtmndtasgtdt0(W0,xR,xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_228,hypothesis,
( sdtmndtplgtdt0(xa,xR,xb)
& sdtmndtplgtdt0(xa,xR,xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731_02) ).
tff(f_75,definition,
! [W0,W1,W2] :
( ( aElement0(W0)
& aRewritingSystem0(W1)
& aElement0(W2) )
=> ( sdtmndtplgtdt0(W0,W1,W2)
<=> ( aReductOfIn0(W2,W0,W1)
| ? [W3] :
( aElement0(W3)
& aReductOfIn0(W3,W0,W1)
& sdtmndtplgtdt0(W3,W1,W2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCDef) ).
tff(c_96,plain,
aElement0(xb),
inference(cnfTransformation,[status(thm)],[f_206]) ).
tff(c_88,plain,
aRewritingSystem0(xR),
inference(cnfTransformation,[status(thm)],[f_198]) ).
tff(c_120,plain,
! [W2_101,W1_102] :
( sdtmndtasgtdt0(W2_101,W1_102,W2_101)
| ~ aRewritingSystem0(W1_102)
| ~ aElement0(W2_101) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_110,plain,
! [W0_91] :
( ~ sdtmndtasgtdt0(W0_91,xR,xb)
| ~ aReductOfIn0(W0_91,xa,xR)
| ~ aElement0(W0_91) ),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_124,plain,
( ~ aReductOfIn0(xb,xa,xR)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xb) ),
inference(resolution,[status(thm)],[c_120,c_110]) ).
tff(c_127,plain,
~ aReductOfIn0(xb,xa,xR),
inference(demodulation,[status(thm),theory(equality)],[c_96,c_88,c_124]) ).
tff(c_98,plain,
aElement0(xa),
inference(cnfTransformation,[status(thm)],[f_206]) ).
tff(c_108,plain,
sdtmndtplgtdt0(xa,xR,xb),
inference(cnfTransformation,[status(thm)],[f_228]) ).
tff(c_20,plain,
! [W0_12,W1_13,W2_14] :
( aElement0('#skF_1'(W0_12,W1_13,W2_14))
| aReductOfIn0(W2_14,W0_12,W1_13)
| ~ sdtmndtplgtdt0(W0_12,W1_13,W2_14)
| ~ aElement0(W2_14)
| ~ aRewritingSystem0(W1_13)
| ~ aElement0(W0_12) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_18,plain,
! [W0_12,W1_13,W2_14] :
( aReductOfIn0('#skF_1'(W0_12,W1_13,W2_14),W0_12,W1_13)
| aReductOfIn0(W2_14,W0_12,W1_13)
| ~ sdtmndtplgtdt0(W0_12,W1_13,W2_14)
| ~ aElement0(W2_14)
| ~ aRewritingSystem0(W1_13)
| ~ aElement0(W0_12) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_731,plain,
! [W0_198,W1_199,W2_200] :
( sdtmndtplgtdt0('#skF_1'(W0_198,W1_199,W2_200),W1_199,W2_200)
| aReductOfIn0(W2_200,W0_198,W1_199)
| ~ sdtmndtplgtdt0(W0_198,W1_199,W2_200)
| ~ aElement0(W2_200)
| ~ aRewritingSystem0(W1_199)
| ~ aElement0(W0_198) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_26,plain,
! [W0_22,W1_23,W2_24] :
( ~ sdtmndtplgtdt0(W0_22,W1_23,W2_24)
| sdtmndtasgtdt0(W0_22,W1_23,W2_24)
| ~ aElement0(W2_24)
| ~ aRewritingSystem0(W1_23)
| ~ aElement0(W0_22) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_7707,plain,
! [W0_493,W1_494,W2_495] :
( sdtmndtasgtdt0('#skF_1'(W0_493,W1_494,W2_495),W1_494,W2_495)
| ~ aElement0('#skF_1'(W0_493,W1_494,W2_495))
| aReductOfIn0(W2_495,W0_493,W1_494)
| ~ sdtmndtplgtdt0(W0_493,W1_494,W2_495)
| ~ aElement0(W2_495)
| ~ aRewritingSystem0(W1_494)
| ~ aElement0(W0_493) ),
inference(resolution,[status(thm)],[c_731,c_26]) ).
tff(c_7788,plain,
! [W0_493] :
( ~ aReductOfIn0('#skF_1'(W0_493,xR,xb),xa,xR)
| ~ aElement0('#skF_1'(W0_493,xR,xb))
| aReductOfIn0(xb,W0_493,xR)
| ~ sdtmndtplgtdt0(W0_493,xR,xb)
| ~ aElement0(xb)
| ~ aRewritingSystem0(xR)
| ~ aElement0(W0_493) ),
inference(resolution,[status(thm)],[c_7707,c_110]) ).
tff(c_7970,plain,
! [W0_501] :
( ~ aReductOfIn0('#skF_1'(W0_501,xR,xb),xa,xR)
| ~ aElement0('#skF_1'(W0_501,xR,xb))
| aReductOfIn0(xb,W0_501,xR)
| ~ sdtmndtplgtdt0(W0_501,xR,xb)
| ~ aElement0(W0_501) ),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_96,c_7788]) ).
tff(c_7974,plain,
( ~ aElement0('#skF_1'(xa,xR,xb))
| aReductOfIn0(xb,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ aElement0(xb)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xa) ),
inference(resolution,[status(thm)],[c_18,c_7970]) ).
tff(c_7977,plain,
( ~ aElement0('#skF_1'(xa,xR,xb))
| aReductOfIn0(xb,xa,xR) ),
inference(demodulation,[status(thm),theory(equality)],[c_98,c_88,c_96,c_108,c_7974]) ).
tff(c_7978,plain,
~ aElement0('#skF_1'(xa,xR,xb)),
inference(negUnitSimplification,[status(thm)],[c_127,c_7977]) ).
tff(c_7981,plain,
( aReductOfIn0(xb,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ aElement0(xb)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xa) ),
inference(resolution,[status(thm)],[c_20,c_7978]) ).
tff(c_7984,plain,
aReductOfIn0(xb,xa,xR),
inference(demodulation,[status(thm),theory(equality)],[c_98,c_88,c_96,c_108,c_7981]) ).
tff(c_7986,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_127,c_7984]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COM016+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % 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.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu Aug 3 23:36:51 EDT 2023
% 0.11/0.31 % CPUTime :
% 8.44/3.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.44/3.02
% 8.44/3.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.44/3.04
% 8.44/3.04 Inference rules
% 8.44/3.04 ----------------------
% 8.44/3.04 #Ref : 0
% 8.44/3.04 #Sup : 1366
% 8.44/3.04 #Fact : 0
% 8.44/3.04 #Define : 0
% 8.44/3.04 #Split : 8
% 8.44/3.05 #Chain : 0
% 8.44/3.05 #Close : 0
% 8.44/3.05
% 8.44/3.05 Ordering : KBO
% 8.44/3.05
% 8.44/3.05 Simplification rules
% 8.44/3.05 ----------------------
% 8.44/3.05 #Subsume : 568
% 8.44/3.05 #Demod : 1954
% 8.44/3.05 #Tautology : 271
% 8.44/3.05 #SimpNegUnit : 2
% 8.44/3.05 #BackRed : 0
% 8.44/3.05
% 8.44/3.05 #Partial instantiations: 0
% 8.44/3.05 #Strategies tried : 1
% 8.44/3.05
% 8.44/3.05 Timing (in seconds)
% 8.44/3.05 ----------------------
% 8.44/3.05 Preprocessing : 0.59
% 8.44/3.05 Parsing : 0.31
% 8.44/3.05 CNF conversion : 0.05
% 8.44/3.05 Main loop : 1.47
% 8.44/3.05 Inferencing : 0.53
% 8.44/3.05 Reduction : 0.42
% 8.44/3.05 Demodulation : 0.28
% 8.44/3.05 BG Simplification : 0.05
% 8.44/3.05 Subsumption : 0.39
% 8.44/3.05 Abstraction : 0.05
% 8.44/3.05 MUC search : 0.00
% 8.44/3.05 Cooper : 0.00
% 8.44/3.05 Total : 2.11
% 8.44/3.05 Index Insertion : 0.00
% 8.44/3.05 Index Deletion : 0.00
% 8.44/3.05 Index Matching : 0.00
% 8.44/3.05 BG Taut test : 0.00
%------------------------------------------------------------------------------