TSTP Solution File: COM017+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM017+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/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 : n027.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:19 EDT 2023
% Result : Theorem 6.88s 2.73s
% Output : CNFRefutation 6.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 37
% Syntax : Number of formulae : 56 ( 9 unt; 30 typ; 1 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 137 ( 64 ~; 55 |; 15 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 6 con; 0-4 aty)
% Number of variables : 27 (; 25 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtmndtplgtdt0 > sdtmndtasgtdt0 > aReductOfIn0 > aNormalFormOfIn0 > iLess0 > isTerminating0 > isLocallyConfluent0 > isConfluent0 > aRewritingSystem0 > aElement0 > #nlpp > xv > xu > 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(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_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(xv,type,
xv: $i ).
tff(f_206,hypothesis,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).
tff(f_233,hypothesis,
( aElement0(xu)
& aReductOfIn0(xu,xa,xR)
& sdtmndtasgtdt0(xu,xR,xb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__755) ).
tff(f_238,hypothesis,
( aElement0(xv)
& aReductOfIn0(xv,xa,xR)
& sdtmndtasgtdt0(xv,xR,xc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__779) ).
tff(f_198,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656) ).
tff(f_201,hypothesis,
( isLocallyConfluent0(xR)
& isTerminating0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656_01) ).
tff(f_159,definition,
! [W0] :
( aRewritingSystem0(W0)
=> ( isLocallyConfluent0(W0)
<=> ! [W1,W2,W3] :
( ( aElement0(W1)
& aElement0(W2)
& aElement0(W3)
& aReductOfIn0(W2,W1,W0)
& aReductOfIn0(W3,W1,W0) )
=> ? [W4] :
( aElement0(W4)
& sdtmndtasgtdt0(W2,W0,W4)
& sdtmndtasgtdt0(W3,W0,W4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mWCRDef) ).
tff(f_245,negated_conjecture,
~ ? [W0] :
( aElement0(W0)
& sdtmndtasgtdt0(xu,xR,W0)
& sdtmndtasgtdt0(xv,xR,W0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_98,plain,
aElement0(xa),
inference(cnfTransformation,[status(thm)],[f_206]) ).
tff(c_112,plain,
aReductOfIn0(xu,xa,xR),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_118,plain,
aReductOfIn0(xv,xa,xR),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_88,plain,
aRewritingSystem0(xR),
inference(cnfTransformation,[status(thm)],[f_198]) ).
tff(c_92,plain,
isLocallyConfluent0(xR),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_114,plain,
aElement0(xu),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_120,plain,
aElement0(xv),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_66,plain,
! [W0_46,W1_57,W2_58,W3_59] :
( aElement0('#skF_6'(W0_46,W1_57,W2_58,W3_59))
| ~ aReductOfIn0(W3_59,W1_57,W0_46)
| ~ aReductOfIn0(W2_58,W1_57,W0_46)
| ~ aElement0(W3_59)
| ~ aElement0(W2_58)
| ~ aElement0(W1_57)
| ~ isLocallyConfluent0(W0_46)
| ~ aRewritingSystem0(W0_46) ),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_2792,plain,
! [W2_288,W0_289,W1_290,W3_291] :
( sdtmndtasgtdt0(W2_288,W0_289,'#skF_6'(W0_289,W1_290,W2_288,W3_291))
| ~ aReductOfIn0(W3_291,W1_290,W0_289)
| ~ aReductOfIn0(W2_288,W1_290,W0_289)
| ~ aElement0(W3_291)
| ~ aElement0(W2_288)
| ~ aElement0(W1_290)
| ~ isLocallyConfluent0(W0_289)
| ~ aRewritingSystem0(W0_289) ),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_2195,plain,
! [W3_266,W0_267,W1_268,W2_269] :
( sdtmndtasgtdt0(W3_266,W0_267,'#skF_6'(W0_267,W1_268,W2_269,W3_266))
| ~ aReductOfIn0(W3_266,W1_268,W0_267)
| ~ aReductOfIn0(W2_269,W1_268,W0_267)
| ~ aElement0(W3_266)
| ~ aElement0(W2_269)
| ~ aElement0(W1_268)
| ~ isLocallyConfluent0(W0_267)
| ~ aRewritingSystem0(W0_267) ),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_122,plain,
! [W0_91] :
( ~ sdtmndtasgtdt0(xv,xR,W0_91)
| ~ sdtmndtasgtdt0(xu,xR,W0_91)
| ~ aElement0(W0_91) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_2226,plain,
! [W1_268,W2_269] :
( ~ sdtmndtasgtdt0(xu,xR,'#skF_6'(xR,W1_268,W2_269,xv))
| ~ aElement0('#skF_6'(xR,W1_268,W2_269,xv))
| ~ aReductOfIn0(xv,W1_268,xR)
| ~ aReductOfIn0(W2_269,W1_268,xR)
| ~ aElement0(xv)
| ~ aElement0(W2_269)
| ~ aElement0(W1_268)
| ~ isLocallyConfluent0(xR)
| ~ aRewritingSystem0(xR) ),
inference(resolution,[status(thm)],[c_2195,c_122]) ).
tff(c_2247,plain,
! [W1_268,W2_269] :
( ~ sdtmndtasgtdt0(xu,xR,'#skF_6'(xR,W1_268,W2_269,xv))
| ~ aElement0('#skF_6'(xR,W1_268,W2_269,xv))
| ~ aReductOfIn0(xv,W1_268,xR)
| ~ aReductOfIn0(W2_269,W1_268,xR)
| ~ aElement0(W2_269)
| ~ aElement0(W1_268) ),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_92,c_120,c_2226]) ).
tff(c_2805,plain,
! [W1_290] :
( ~ aElement0('#skF_6'(xR,W1_290,xu,xv))
| ~ aReductOfIn0(xv,W1_290,xR)
| ~ aReductOfIn0(xu,W1_290,xR)
| ~ aElement0(xv)
| ~ aElement0(xu)
| ~ aElement0(W1_290)
| ~ isLocallyConfluent0(xR)
| ~ aRewritingSystem0(xR) ),
inference(resolution,[status(thm)],[c_2792,c_2247]) ).
tff(c_2876,plain,
! [W1_292] :
( ~ aElement0('#skF_6'(xR,W1_292,xu,xv))
| ~ aReductOfIn0(xv,W1_292,xR)
| ~ aReductOfIn0(xu,W1_292,xR)
| ~ aElement0(W1_292) ),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_92,c_114,c_120,c_2805]) ).
tff(c_2880,plain,
! [W1_57] :
( ~ aReductOfIn0(xv,W1_57,xR)
| ~ aReductOfIn0(xu,W1_57,xR)
| ~ aElement0(xv)
| ~ aElement0(xu)
| ~ aElement0(W1_57)
| ~ isLocallyConfluent0(xR)
| ~ aRewritingSystem0(xR) ),
inference(resolution,[status(thm)],[c_66,c_2876]) ).
tff(c_2904,plain,
! [W1_295] :
( ~ aReductOfIn0(xv,W1_295,xR)
| ~ aReductOfIn0(xu,W1_295,xR)
| ~ aElement0(W1_295) ),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_92,c_114,c_120,c_2880]) ).
tff(c_2907,plain,
( ~ aReductOfIn0(xu,xa,xR)
| ~ aElement0(xa) ),
inference(resolution,[status(thm)],[c_118,c_2904]) ).
tff(c_2911,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_98,c_112,c_2907]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM017+1 : TPTP v8.1.2. Released v4.0.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.12/0.34 % Computer : n027.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 : Thu Aug 3 23:55:24 EDT 2023
% 0.12/0.34 % CPUTime :
% 6.88/2.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.88/2.74
% 6.88/2.74 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.88/2.77
% 6.88/2.77 Inference rules
% 6.88/2.77 ----------------------
% 6.88/2.77 #Ref : 0
% 6.88/2.77 #Sup : 473
% 6.88/2.77 #Fact : 0
% 6.88/2.77 #Define : 0
% 6.88/2.77 #Split : 6
% 6.88/2.77 #Chain : 0
% 6.88/2.77 #Close : 0
% 6.88/2.77
% 6.88/2.77 Ordering : KBO
% 6.88/2.77
% 6.88/2.77 Simplification rules
% 6.88/2.77 ----------------------
% 6.88/2.77 #Subsume : 161
% 6.88/2.77 #Demod : 780
% 6.88/2.77 #Tautology : 80
% 6.88/2.77 #SimpNegUnit : 3
% 6.88/2.77 #BackRed : 0
% 6.88/2.77
% 6.88/2.77 #Partial instantiations: 0
% 6.88/2.77 #Strategies tried : 1
% 6.88/2.77
% 6.88/2.77 Timing (in seconds)
% 6.88/2.77 ----------------------
% 6.88/2.77 Preprocessing : 0.63
% 7.31/2.77 Parsing : 0.31
% 7.31/2.77 CNF conversion : 0.05
% 7.31/2.77 Main loop : 0.97
% 7.31/2.77 Inferencing : 0.38
% 7.31/2.77 Reduction : 0.28
% 7.31/2.77 Demodulation : 0.19
% 7.31/2.77 BG Simplification : 0.05
% 7.31/2.77 Subsumption : 0.21
% 7.31/2.77 Abstraction : 0.03
% 7.31/2.77 MUC search : 0.00
% 7.31/2.77 Cooper : 0.00
% 7.31/2.77 Total : 1.65
% 7.31/2.77 Index Insertion : 0.00
% 7.31/2.77 Index Deletion : 0.00
% 7.31/2.77 Index Matching : 0.00
% 7.31/2.77 BG Taut test : 0.00
%------------------------------------------------------------------------------