TSTP Solution File: COM016+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM016+4 : 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 : 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 7.69s 2.79s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 38
% Syntax : Number of formulae : 50 ( 6 unt; 35 typ; 0 def)
% Number of atoms : 41 ( 1 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 35 ( 9 ~; 13 |; 13 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 61 ( 29 >; 32 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 6 con; 0-4 aty)
% Number of variables : 5 (; 1 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtmndtplgtdt0 > sdtmndtasgtdt0 > aReductOfIn0 > aNormalFormOfIn0 > iLess0 > isTerminating0 > isLocallyConfluent0 > isConfluent0 > aRewritingSystem0 > aElement0 > #nlpp > xc > xb > xa > xR > #skF_9 > #skF_7 > #skF_5 > #skF_17 > #skF_1 > #skF_20 > #skF_4 > #skF_18 > #skF_12 > #skF_8 > #skF_13 > #skF_10 > #skF_2 > #skF_19 > #skF_6 > #skF_21 > #skF_15 > #skF_14 > #skF_3 > #skF_11 > #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('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $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_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(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('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_268,hypothesis,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731) ).
tff(f_380,negated_conjecture,
~ ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xa,xR)
& ( ( W0 = xb )
| aReductOfIn0(xb,W0,xR)
| ? [W1] :
( aElement0(W1)
& aReductOfIn0(W1,W0,xR)
& sdtmndtplgtdt0(W1,xR,xb) )
| sdtmndtplgtdt0(W0,xR,xb)
| sdtmndtasgtdt0(W0,xR,xb) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_360,hypothesis,
( ( aReductOfIn0(xb,xa,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xa,xR)
& sdtmndtplgtdt0(W0,xR,xb) ) )
& sdtmndtplgtdt0(xa,xR,xb)
& ( aReductOfIn0(xc,xa,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xa,xR)
& sdtmndtplgtdt0(W0,xR,xc) ) )
& sdtmndtplgtdt0(xa,xR,xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731_02) ).
tff(c_124,plain,
aElement0(xb),
inference(cnfTransformation,[status(thm)],[f_268]) ).
tff(c_702,plain,
( ~ aReductOfIn0(xb,xa,xR)
| ~ aElement0(xb) ),
inference(cnfTransformation,[status(thm)],[f_380]) ).
tff(c_704,plain,
~ aReductOfIn0(xb,xa,xR),
inference(demodulation,[status(thm),theory(equality)],[c_124,c_702]) ).
tff(c_692,plain,
( aElement0('#skF_21')
| aReductOfIn0(xb,xa,xR) ),
inference(cnfTransformation,[status(thm)],[f_360]) ).
tff(c_705,plain,
aElement0('#skF_21'),
inference(negUnitSimplification,[status(thm)],[c_704,c_692]) ).
tff(c_690,plain,
( aReductOfIn0('#skF_21',xa,xR)
| aReductOfIn0(xb,xa,xR) ),
inference(cnfTransformation,[status(thm)],[f_360]) ).
tff(c_707,plain,
aReductOfIn0('#skF_21',xa,xR),
inference(negUnitSimplification,[status(thm)],[c_704,c_690]) ).
tff(c_688,plain,
( sdtmndtplgtdt0('#skF_21',xR,xb)
| aReductOfIn0(xb,xa,xR) ),
inference(cnfTransformation,[status(thm)],[f_360]) ).
tff(c_706,plain,
sdtmndtplgtdt0('#skF_21',xR,xb),
inference(negUnitSimplification,[status(thm)],[c_704,c_688]) ).
tff(c_714,plain,
! [W0_123] :
( ~ sdtmndtplgtdt0(W0_123,xR,xb)
| ~ aReductOfIn0(W0_123,xa,xR)
| ~ aElement0(W0_123) ),
inference(cnfTransformation,[status(thm)],[f_380]) ).
tff(c_717,plain,
( ~ aReductOfIn0('#skF_21',xa,xR)
| ~ aElement0('#skF_21') ),
inference(resolution,[status(thm)],[c_706,c_714]) ).
tff(c_724,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_705,c_707,c_717]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM016+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 23:55:24 EDT 2023
% 0.14/0.34 % CPUTime :
% 7.69/2.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.69/2.79
% 7.69/2.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.69/2.82
% 7.69/2.82 Inference rules
% 7.69/2.82 ----------------------
% 7.69/2.82 #Ref : 0
% 7.69/2.82 #Sup : 2
% 7.69/2.82 #Fact : 0
% 7.69/2.82 #Define : 0
% 7.69/2.82 #Split : 1
% 7.69/2.82 #Chain : 0
% 7.69/2.82 #Close : 0
% 7.69/2.82
% 7.69/2.82 Ordering : KBO
% 7.69/2.82
% 7.69/2.82 Simplification rules
% 7.69/2.82 ----------------------
% 7.69/2.82 #Subsume : 2
% 7.69/2.82 #Demod : 3
% 7.69/2.82 #Tautology : 4
% 7.69/2.82 #SimpNegUnit : 3
% 7.69/2.82 #BackRed : 0
% 7.69/2.82
% 7.69/2.82 #Partial instantiations: 0
% 7.69/2.82 #Strategies tried : 1
% 7.69/2.82
% 7.69/2.82 Timing (in seconds)
% 7.69/2.82 ----------------------
% 7.69/2.82 Preprocessing : 0.82
% 7.69/2.82 Parsing : 0.34
% 7.69/2.82 CNF conversion : 0.07
% 7.69/2.82 Main loop : 0.94
% 7.69/2.82 Inferencing : 0.07
% 7.69/2.82 Reduction : 0.28
% 7.69/2.82 Demodulation : 0.19
% 7.69/2.83 BG Simplification : 0.12
% 7.69/2.83 Subsumption : 0.49
% 7.69/2.83 Abstraction : 0.02
% 7.69/2.83 MUC search : 0.00
% 7.69/2.83 Cooper : 0.00
% 7.69/2.83 Total : 1.81
% 7.69/2.83 Index Insertion : 0.00
% 7.69/2.83 Index Deletion : 0.00
% 7.69/2.83 Index Matching : 0.00
% 7.69/2.83 BG Taut test : 0.00
%------------------------------------------------------------------------------