TSTP Solution File: RNG046+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG046+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 : n019.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:54:48 EDT 2023
% Result : Theorem 5.26s 2.58s
% Output : CNFRefutation 5.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 47 ( 17 unt; 12 typ; 0 def)
% Number of atoms : 77 ( 28 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 74 ( 32 ~; 21 |; 16 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 8 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iLess0 > aScalar0 > aNaturalNumber0 > sdtpldt0 > sdtasdt0 > #nlpp > szszuzczcdt0 > smndt0 > xy > xx > sz0z00 > sz00 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(sz00,type,
sz00: $i ).
tff(xy,type,
xy: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(xx,type,
xx: $i ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff(sz0z00,type,
sz0z00: $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff(aScalar0,type,
aScalar0: $i > $o ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(f_149,hypothesis,
( aScalar0(xx)
& aScalar0(xy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__799) ).
tff(f_118,axiom,
! [W0,W1,W2] :
( ( aScalar0(W0)
& aScalar0(W1)
& aScalar0(W2) )
=> ( ( sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)) )
& ( sdtpldt0(W0,W1) = sdtpldt0(W1,W0) )
& ( sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)) )
& ( sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mArith) ).
tff(f_70,axiom,
aScalar0(sz0z00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSZeroSc) ).
tff(f_82,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> aScalar0(sdtasdt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulSc) ).
tff(f_104,axiom,
! [W0] :
( aScalar0(W0)
=> ( ( sdtpldt0(W0,sz0z00) = W0 )
& ( sdtpldt0(sz0z00,W0) = W0 )
& ( sdtasdt0(W0,sz0z00) = sz0z00 )
& ( sdtasdt0(sz0z00,W0) = sz0z00 )
& ( sdtpldt0(W0,smndt0(W0)) = sz0z00 )
& ( sdtpldt0(smndt0(W0),W0) = sz0z00 )
& ( smndt0(smndt0(W0)) = W0 )
& ( smndt0(sz0z00) = sz0z00 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mScZero) ).
tff(f_146,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> ( ( sdtasdt0(W0,smndt0(W1)) = smndt0(sdtasdt0(W0,W1)) )
& ( sdtasdt0(smndt0(W0),W1) = smndt0(sdtasdt0(W0,W1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMNeg) ).
tff(f_86,axiom,
! [W0] :
( aScalar0(W0)
=> aScalar0(smndt0(W0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNegSc) ).
tff(f_151,negated_conjecture,
sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_64,plain,
aScalar0(xy),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_66,plain,
aScalar0(xx),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_46,plain,
! [W1_18,W0_17,W2_19] :
( ( sdtasdt0(W1_18,W0_17) = sdtasdt0(W0_17,W1_18) )
| ~ aScalar0(W2_19)
| ~ aScalar0(W1_18)
| ~ aScalar0(W0_17) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_690,plain,
! [W2_19] : ~ aScalar0(W2_19),
inference(splitLeft,[status(thm)],[c_46]) ).
tff(c_22,plain,
aScalar0(sz0z00),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_697,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_690,c_22]) ).
tff(c_699,plain,
! [W1_60,W0_61] :
( ( sdtasdt0(W1_60,W0_61) = sdtasdt0(W0_61,W1_60) )
| ~ aScalar0(W1_60)
| ~ aScalar0(W0_61) ),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_860,plain,
! [W0_66] :
( ( sdtasdt0(xy,W0_66) = sdtasdt0(W0_66,xy) )
| ~ aScalar0(W0_66) ),
inference(resolution,[status(thm)],[c_64,c_699]) ).
tff(c_886,plain,
sdtasdt0(xy,xx) = sdtasdt0(xx,xy),
inference(resolution,[status(thm)],[c_66,c_860]) ).
tff(c_26,plain,
! [W0_13,W1_14] :
( aScalar0(sdtasdt0(W0_13,W1_14))
| ~ aScalar0(W1_14)
| ~ aScalar0(W0_13) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_893,plain,
( aScalar0(sdtasdt0(xx,xy))
| ~ aScalar0(xx)
| ~ aScalar0(xy) ),
inference(superposition,[status(thm),theory(equality)],[c_886,c_26]) ).
tff(c_899,plain,
aScalar0(sdtasdt0(xx,xy)),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_66,c_893]) ).
tff(c_32,plain,
! [W0_16] :
( ( smndt0(smndt0(W0_16)) = W0_16 )
| ~ aScalar0(W0_16) ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_60,plain,
! [W0_27,W1_28] :
( ( sdtasdt0(smndt0(W0_27),W1_28) = smndt0(sdtasdt0(W0_27,W1_28)) )
| ~ aScalar0(W1_28)
| ~ aScalar0(W0_27) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_28,plain,
! [W0_15] :
( aScalar0(smndt0(W0_15))
| ~ aScalar0(W0_15) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_928,plain,
! [W0_67,W1_68] :
( ( sdtasdt0(W0_67,smndt0(W1_68)) = smndt0(sdtasdt0(W0_67,W1_68)) )
| ~ aScalar0(W1_68)
| ~ aScalar0(W0_67) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_68,plain,
sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_948,plain,
( ( smndt0(sdtasdt0(smndt0(xx),xy)) != sdtasdt0(xx,xy) )
| ~ aScalar0(xy)
| ~ aScalar0(smndt0(xx)) ),
inference(superposition,[status(thm),theory(equality)],[c_928,c_68]) ).
tff(c_972,plain,
( ( smndt0(sdtasdt0(smndt0(xx),xy)) != sdtasdt0(xx,xy) )
| ~ aScalar0(smndt0(xx)) ),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_948]) ).
tff(c_1024,plain,
~ aScalar0(smndt0(xx)),
inference(splitLeft,[status(thm)],[c_972]) ).
tff(c_1027,plain,
~ aScalar0(xx),
inference(resolution,[status(thm)],[c_28,c_1024]) ).
tff(c_1031,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_66,c_1027]) ).
tff(c_1032,plain,
smndt0(sdtasdt0(smndt0(xx),xy)) != sdtasdt0(xx,xy),
inference(splitRight,[status(thm)],[c_972]) ).
tff(c_1562,plain,
( ( smndt0(smndt0(sdtasdt0(xx,xy))) != sdtasdt0(xx,xy) )
| ~ aScalar0(xy)
| ~ aScalar0(xx) ),
inference(superposition,[status(thm),theory(equality)],[c_60,c_1032]) ).
tff(c_1564,plain,
smndt0(smndt0(sdtasdt0(xx,xy))) != sdtasdt0(xx,xy),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_64,c_1562]) ).
tff(c_1919,plain,
~ aScalar0(sdtasdt0(xx,xy)),
inference(superposition,[status(thm),theory(equality)],[c_32,c_1564]) ).
tff(c_1923,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_899,c_1919]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : RNG046+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.17/0.36 % Computer : n019.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Thu Aug 3 18:04:01 EDT 2023
% 0.17/0.36 % CPUTime :
% 5.26/2.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.26/2.58
% 5.26/2.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.26/2.61
% 5.26/2.61 Inference rules
% 5.26/2.61 ----------------------
% 5.26/2.61 #Ref : 1
% 5.26/2.61 #Sup : 428
% 5.26/2.61 #Fact : 0
% 5.26/2.61 #Define : 0
% 5.26/2.61 #Split : 5
% 5.26/2.61 #Chain : 0
% 5.26/2.61 #Close : 0
% 5.26/2.61
% 5.26/2.61 Ordering : KBO
% 5.26/2.61
% 5.26/2.61 Simplification rules
% 5.26/2.61 ----------------------
% 5.26/2.61 #Subsume : 59
% 5.26/2.61 #Demod : 414
% 5.26/2.61 #Tautology : 254
% 5.26/2.61 #SimpNegUnit : 17
% 5.26/2.61 #BackRed : 11
% 5.26/2.61
% 5.26/2.61 #Partial instantiations: 0
% 5.26/2.61 #Strategies tried : 1
% 5.26/2.61
% 5.26/2.61 Timing (in seconds)
% 5.26/2.61 ----------------------
% 5.26/2.61 Preprocessing : 0.75
% 5.26/2.61 Parsing : 0.39
% 5.26/2.62 CNF conversion : 0.05
% 5.26/2.62 Main loop : 0.60
% 5.26/2.62 Inferencing : 0.22
% 5.26/2.62 Reduction : 0.17
% 5.26/2.62 Demodulation : 0.13
% 5.26/2.62 BG Simplification : 0.04
% 5.26/2.62 Subsumption : 0.13
% 5.26/2.62 Abstraction : 0.03
% 5.26/2.62 MUC search : 0.00
% 5.26/2.62 Cooper : 0.00
% 5.26/2.62 Total : 1.40
% 5.26/2.62 Index Insertion : 0.00
% 5.26/2.62 Index Deletion : 0.00
% 5.26/2.62 Index Matching : 0.00
% 5.26/2.62 BG Taut test : 0.00
%------------------------------------------------------------------------------