TSTP Solution File: RNG045+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG045+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 : n013.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 12.74s 4.85s
% Output : CNFRefutation 12.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 31 ( 11 unt; 14 typ; 0 def)
% Number of atoms : 36 ( 12 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 37 ( 18 ~; 12 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 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 : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iLess0 > aScalar0 > aNaturalNumber0 > sdtpldt0 > sdtasdt0 > #nlpp > szszuzczcdt0 > smndt0 > xy > xx > xv > xu > 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(xu,type,
xu: $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(xv,type,
xv: $i ).
tff(f_136,hypothesis,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__733) ).
tff(f_135,hypothesis,
( aScalar0(xx)
& aScalar0(xy)
& aScalar0(xu)
& aScalar0(xv) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__674) ).
tff(f_128,axiom,
! [W0,W1,W2] :
( ( aScalar0(W0)
& aScalar0(W1)
& aScalar0(W2) )
=> ( ( sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) )
& ( sdtasdt0(sdtpldt0(W0,W1),W2) = sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDistr) ).
tff(f_138,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_66,plain,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_62,plain,
aScalar0(xy),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_60,plain,
aScalar0(xu),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_58,plain,
aScalar0(xv),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_56,plain,
! [W0_20,W1_21,W2_22] :
( ( sdtpldt0(sdtasdt0(W0_20,W1_21),sdtasdt0(W0_20,W2_22)) = sdtasdt0(W0_20,sdtpldt0(W1_21,W2_22)) )
| ~ aScalar0(W2_22)
| ~ aScalar0(W1_21)
| ~ aScalar0(W0_20) ),
inference(cnfTransformation,[status(thm)],[f_128]) ).
tff(c_64,plain,
aScalar0(xx),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_1454,plain,
! [W0_63,W1_64,W2_65] :
( ( sdtpldt0(sdtasdt0(W0_63,W1_64),sdtasdt0(W0_63,W2_65)) = sdtasdt0(W0_63,sdtpldt0(W1_64,W2_65)) )
| ~ aScalar0(W2_65)
| ~ aScalar0(W1_64)
| ~ aScalar0(W0_63) ),
inference(cnfTransformation,[status(thm)],[f_128]) ).
tff(c_68,plain,
sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_1466,plain,
( ( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) )
| ~ aScalar0(xv)
| ~ aScalar0(xu)
| ~ aScalar0(xx) ),
inference(superposition,[status(thm),theory(equality)],[c_1454,c_68]) ).
tff(c_1589,plain,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_60,c_58,c_1466]) ).
tff(c_1776,plain,
( ( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) )
| ~ aScalar0(xv)
| ~ aScalar0(xu)
| ~ aScalar0(xy) ),
inference(superposition,[status(thm),theory(equality)],[c_56,c_1589]) ).
tff(c_1778,plain,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_60,c_58,c_1776]) ).
tff(c_23880,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_66,c_1778]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG045+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.14/0.35 % Computer : n013.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 17:51:48 EDT 2023
% 0.21/0.35 % CPUTime :
% 12.74/4.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.74/4.86
% 12.74/4.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.74/4.88
% 12.74/4.88 Inference rules
% 12.74/4.88 ----------------------
% 12.74/4.88 #Ref : 2
% 12.74/4.88 #Sup : 5173
% 12.74/4.88 #Fact : 0
% 12.74/4.88 #Define : 0
% 12.74/4.88 #Split : 10
% 12.74/4.88 #Chain : 0
% 12.74/4.88 #Close : 0
% 12.74/4.88
% 12.74/4.88 Ordering : KBO
% 12.74/4.88
% 12.74/4.88 Simplification rules
% 12.74/4.88 ----------------------
% 12.74/4.88 #Subsume : 639
% 12.74/4.88 #Demod : 9297
% 12.74/4.88 #Tautology : 2215
% 12.74/4.88 #SimpNegUnit : 22
% 12.74/4.88 #BackRed : 23
% 12.74/4.88
% 12.74/4.88 #Partial instantiations: 0
% 12.74/4.88 #Strategies tried : 1
% 12.74/4.88
% 12.74/4.88 Timing (in seconds)
% 12.74/4.88 ----------------------
% 12.74/4.89 Preprocessing : 0.48
% 12.74/4.89 Parsing : 0.26
% 12.74/4.89 CNF conversion : 0.03
% 12.74/4.89 Main loop : 3.38
% 12.74/4.89 Inferencing : 0.79
% 12.74/4.89 Reduction : 1.76
% 12.74/4.89 Demodulation : 1.53
% 12.74/4.89 BG Simplification : 0.07
% 12.74/4.89 Subsumption : 0.59
% 12.74/4.89 Abstraction : 0.11
% 12.74/4.89 MUC search : 0.00
% 12.74/4.89 Cooper : 0.00
% 12.74/4.89 Total : 3.90
% 12.74/4.89 Index Insertion : 0.00
% 12.74/4.89 Index Deletion : 0.00
% 12.74/4.89 Index Matching : 0.00
% 12.74/4.89 BG Taut test : 0.00
%------------------------------------------------------------------------------