TSTP Solution File: COM012+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM012+3 : 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 : n006.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 3.37s 1.86s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 38 ( 16 unt; 13 typ; 0 def)
% Number of atoms : 70 ( 7 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 64 ( 19 ~; 24 |; 18 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 7 >; 9 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 13 (; 10 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtmndtplgtdt0 > sdtmndtasgtdt0 > aReductOfIn0 > iLess0 > aRewritingSystem0 > aElement0 > #nlpp > xz > xy > xx > xR > #skF_1 > #skF_2 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sdtmndtplgtdt0,type,
sdtmndtplgtdt0: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(aReductOfIn0,type,
aReductOfIn0: ( $i * $i * $i ) > $o ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(xR,type,
xR: $i ).
tff(xy,type,
xy: $i ).
tff(xx,type,
xx: $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(xz,type,
xz: $i ).
tff(aRewritingSystem0,type,
aRewritingSystem0: $i > $o ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(sdtmndtasgtdt0,type,
sdtmndtasgtdt0: ( $i * $i * $i ) > $o ).
tff(f_108,hypothesis,
( aElement0(xx)
& aRewritingSystem0(xR)
& aElement0(xy)
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__349) ).
tff(f_153,negated_conjecture,
~ ( ( ( ( xx = xy )
| ( ( aReductOfIn0(xy,xx,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xx,xR)
& sdtmndtplgtdt0(W0,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( ( xy = xz )
| ( ( aReductOfIn0(xz,xy,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xy,xR)
& sdtmndtplgtdt0(W0,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz) )
=> ( ( xx = xz )
| aReductOfIn0(xz,xx,xR)
| ? [W0] :
( aElement0(W0)
& aReductOfIn0(W0,xx,xR)
& sdtmndtplgtdt0(W0,xR,xz) )
| sdtmndtplgtdt0(xx,xR,xz)
| sdtmndtasgtdt0(xx,xR,xz) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_89,axiom,
! [W0,W1,W2,W3] :
( ( aElement0(W0)
& aRewritingSystem0(W1)
& aElement0(W2)
& aElement0(W3) )
=> ( ( sdtmndtplgtdt0(W0,W1,W2)
& sdtmndtplgtdt0(W2,W1,W3) )
=> sdtmndtplgtdt0(W0,W1,W3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCTrans) ).
tff(c_36,plain,
aElement0(xx),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_40,plain,
~ sdtmndtplgtdt0(xx,xR,xz),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_60,plain,
( sdtmndtplgtdt0(xx,xR,xy)
| ( xy = xx ) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_79,plain,
xy = xx,
inference(splitLeft,[status(thm)],[c_60]) ).
tff(c_50,plain,
sdtmndtasgtdt0(xx,xR,xy),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_52,plain,
( sdtmndtplgtdt0(xy,xR,xz)
| ( xz = xy ) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_67,plain,
xz = xy,
inference(splitLeft,[status(thm)],[c_52]) ).
tff(c_38,plain,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_71,plain,
~ sdtmndtasgtdt0(xx,xR,xy),
inference(demodulation,[status(thm),theory(equality)],[c_67,c_38]) ).
tff(c_76,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_50,c_71]) ).
tff(c_77,plain,
sdtmndtplgtdt0(xy,xR,xz),
inference(splitRight,[status(thm)],[c_52]) ).
tff(c_80,plain,
sdtmndtplgtdt0(xx,xR,xz),
inference(demodulation,[status(thm),theory(equality)],[c_79,c_77]) ).
tff(c_86,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_80]) ).
tff(c_87,plain,
sdtmndtplgtdt0(xx,xR,xy),
inference(splitRight,[status(thm)],[c_60]) ).
tff(c_34,plain,
aRewritingSystem0(xR),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_32,plain,
aElement0(xy),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_30,plain,
aElement0(xz),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_246,plain,
! [W0_55,W1_56,W3_57,W2_58] :
( sdtmndtplgtdt0(W0_55,W1_56,W3_57)
| ~ sdtmndtplgtdt0(W2_58,W1_56,W3_57)
| ~ sdtmndtplgtdt0(W0_55,W1_56,W2_58)
| ~ aElement0(W3_57)
| ~ aElement0(W2_58)
| ~ aRewritingSystem0(W1_56)
| ~ aElement0(W0_55) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_256,plain,
! [W0_55] :
( sdtmndtplgtdt0(W0_55,xR,xz)
| ~ sdtmndtplgtdt0(W0_55,xR,xy)
| ~ aElement0(xz)
| ~ aElement0(xy)
| ~ aRewritingSystem0(xR)
| ~ aElement0(W0_55) ),
inference(resolution,[status(thm)],[c_77,c_246]) ).
tff(c_280,plain,
! [W0_60] :
( sdtmndtplgtdt0(W0_60,xR,xz)
| ~ sdtmndtplgtdt0(W0_60,xR,xy)
| ~ aElement0(W0_60) ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_32,c_30,c_256]) ).
tff(c_291,plain,
( ~ sdtmndtplgtdt0(xx,xR,xy)
| ~ aElement0(xx) ),
inference(resolution,[status(thm)],[c_280,c_40]) ).
tff(c_302,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_87,c_291]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COM012+3 : 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.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 23:30:58 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.37/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.37/1.86
% 3.37/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.56/1.89
% 3.56/1.89 Inference rules
% 3.56/1.89 ----------------------
% 3.56/1.89 #Ref : 0
% 3.56/1.89 #Sup : 31
% 3.56/1.89 #Fact : 0
% 3.56/1.89 #Define : 0
% 3.56/1.89 #Split : 5
% 3.56/1.89 #Chain : 0
% 3.56/1.89 #Close : 0
% 3.56/1.89
% 3.56/1.89 Ordering : KBO
% 3.56/1.89
% 3.56/1.89 Simplification rules
% 3.56/1.89 ----------------------
% 3.56/1.89 #Subsume : 7
% 3.56/1.89 #Demod : 82
% 3.56/1.89 #Tautology : 17
% 3.56/1.89 #SimpNegUnit : 14
% 3.56/1.89 #BackRed : 11
% 3.56/1.89
% 3.56/1.89 #Partial instantiations: 0
% 3.56/1.89 #Strategies tried : 1
% 3.56/1.89
% 3.56/1.89 Timing (in seconds)
% 3.56/1.89 ----------------------
% 3.56/1.89 Preprocessing : 0.52
% 3.56/1.89 Parsing : 0.28
% 3.56/1.89 CNF conversion : 0.03
% 3.56/1.89 Main loop : 0.32
% 3.56/1.89 Inferencing : 0.12
% 3.56/1.89 Reduction : 0.09
% 3.56/1.89 Demodulation : 0.07
% 3.56/1.89 BG Simplification : 0.02
% 3.56/1.89 Subsumption : 0.06
% 3.56/1.89 Abstraction : 0.01
% 3.56/1.89 MUC search : 0.00
% 3.56/1.89 Cooper : 0.00
% 3.56/1.89 Total : 0.88
% 3.56/1.90 Index Insertion : 0.00
% 3.56/1.90 Index Deletion : 0.00
% 3.56/1.90 Index Matching : 0.00
% 3.56/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------