TSTP Solution File: RNG090+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG090+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 : n018.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:55 EDT 2023
% Result : Theorem 156.07s 128.22s
% Output : CNFRefutation 156.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 43
% Syntax : Number of formulae : 92 ( 32 unt; 33 typ; 1 def)
% Number of atoms : 110 ( 22 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 91 ( 40 ~; 30 |; 12 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 22 >; 25 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 11 con; 0-4 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ aElementOf0 > aSet0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > xz > xy > xx > xn > xm > xl > xk > xJ > xI > sz10 > sz00 > #skF_6 > #skF_4 > #skF_8 > #skF_5 > #skF_7 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #skF_12 > #skF_1 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $i ).
tff(xl,type,
xl: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff(sdtpldt1,type,
sdtpldt1: ( $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sz00,type,
sz00: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(aIdeal0,type,
aIdeal0: $i > $o ).
tff(xI,type,
xI: $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i * $i ) > $i ).
tff(xy,type,
xy: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(xx,type,
xx: $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i * $i ) > $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(xz,type,
xz: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(xJ,type,
xJ: $i ).
tff(sdtasasdt0,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff(xm,type,
xm: $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(xn,type,
xn: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_208,hypothesis,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).
tff(f_205,definition,
! [W0] :
( aIdeal0(W0)
<=> ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> ( ! [W2] :
( aElementOf0(W2,W0)
=> aElementOf0(sdtpldt0(W1,W2),W0) )
& ! [W2] :
( aElement0(W2)
=> aElementOf0(sdtasdt0(W2,W1),W0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).
tff(f_223,hypothesis,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& ( xy = sdtpldt0(xm,xn) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__967) ).
tff(f_137,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
tff(f_41,axiom,
! [W0,W1] :
( ( aElement0(W0)
& aElement0(W1) )
=> aElement0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
tff(f_218,hypothesis,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& ( xx = sdtpldt0(xk,xl) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__934) ).
tff(f_61,axiom,
! [W0,W1,W2] :
( ( aElement0(W0)
& aElement0(W1)
& aElement0(W2) )
=> ( sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddAsso) ).
tff(f_53,axiom,
! [W0,W1] :
( ( aElement0(W0)
& aElement0(W1) )
=> ( sdtpldt0(W0,W1) = sdtpldt0(W1,W0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
tff(f_226,hypothesis,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__994) ).
tff(f_231,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_126,plain,
aIdeal0(xI),
inference(cnfTransformation,[status(thm)],[f_208]) ).
tff(c_108,plain,
! [W0_117] :
( aSet0(W0_117)
| ~ aIdeal0(W0_117) ),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_144,plain,
aElementOf0(xm,xI),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_320,plain,
! [W1_143,W0_144] :
( aElement0(W1_143)
| ~ aElementOf0(W1_143,W0_144)
| ~ aSet0(W0_144) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_359,plain,
( aElement0(xm)
| ~ aSet0(xI) ),
inference(resolution,[status(thm)],[c_144,c_320]) ).
tff(c_408,plain,
~ aSet0(xI),
inference(splitLeft,[status(thm)],[c_359]) ).
tff(c_411,plain,
~ aIdeal0(xI),
inference(resolution,[status(thm)],[c_108,c_408]) ).
tff(c_415,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_126,c_411]) ).
tff(c_416,plain,
aElement0(xm),
inference(splitRight,[status(thm)],[c_359]) ).
tff(c_124,plain,
aIdeal0(xJ),
inference(cnfTransformation,[status(thm)],[f_208]) ).
tff(c_142,plain,
aElementOf0(xn,xJ),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_360,plain,
( aElement0(xn)
| ~ aSet0(xJ) ),
inference(resolution,[status(thm)],[c_142,c_320]) ).
tff(c_365,plain,
~ aSet0(xJ),
inference(splitLeft,[status(thm)],[c_360]) ).
tff(c_368,plain,
~ aIdeal0(xJ),
inference(resolution,[status(thm)],[c_108,c_365]) ).
tff(c_372,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_124,c_368]) ).
tff(c_373,plain,
aElement0(xn),
inference(splitRight,[status(thm)],[c_360]) ).
tff(c_140,plain,
sdtpldt0(xm,xn) = xy,
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_837,plain,
! [W0_156,W1_157] :
( aElement0(sdtpldt0(W0_156,W1_157))
| ~ aElement0(W1_157)
| ~ aElement0(W0_156) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_906,plain,
( aElement0(xy)
| ~ aElement0(xn)
| ~ aElement0(xm) ),
inference(superposition,[status(thm),theory(equality)],[c_140,c_837]) ).
tff(c_944,plain,
aElement0(xy),
inference(demodulation,[status(thm),theory(equality)],[c_416,c_373,c_906]) ).
tff(c_417,plain,
aSet0(xI),
inference(splitRight,[status(thm)],[c_359]) ).
tff(c_138,plain,
aElementOf0(xk,xI),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_357,plain,
( aElement0(xk)
| ~ aSet0(xI) ),
inference(resolution,[status(thm)],[c_138,c_320]) ).
tff(c_452,plain,
aElement0(xk),
inference(demodulation,[status(thm),theory(equality)],[c_417,c_357]) ).
tff(c_374,plain,
aSet0(xJ),
inference(splitRight,[status(thm)],[c_360]) ).
tff(c_136,plain,
aElementOf0(xl,xJ),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_358,plain,
( aElement0(xl)
| ~ aSet0(xJ) ),
inference(resolution,[status(thm)],[c_136,c_320]) ).
tff(c_478,plain,
aElement0(xl),
inference(demodulation,[status(thm),theory(equality)],[c_374,c_358]) ).
tff(c_134,plain,
sdtpldt0(xk,xl) = xx,
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_2671,plain,
! [W0_190,W1_191,W2_192] :
( ( sdtpldt0(sdtpldt0(W0_190,W1_191),W2_192) = sdtpldt0(W0_190,sdtpldt0(W1_191,W2_192)) )
| ~ aElement0(W2_192)
| ~ aElement0(W1_191)
| ~ aElement0(W0_190) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_2781,plain,
! [W2_192] :
( ( sdtpldt0(xk,sdtpldt0(xl,W2_192)) = sdtpldt0(xx,W2_192) )
| ~ aElement0(W2_192)
| ~ aElement0(xl)
| ~ aElement0(xk) ),
inference(superposition,[status(thm),theory(equality)],[c_134,c_2671]) ).
tff(c_2838,plain,
! [W2_192] :
( ( sdtpldt0(xk,sdtpldt0(xl,W2_192)) = sdtpldt0(xx,W2_192) )
| ~ aElement0(W2_192) ),
inference(demodulation,[status(thm),theory(equality)],[c_452,c_478,c_2781]) ).
tff(c_1090,plain,
! [W1_160,W0_161] :
( ( sdtpldt0(W1_160,W0_161) = sdtpldt0(W0_161,W1_160) )
| ~ aElement0(W1_160)
| ~ aElement0(W0_161) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_15014,plain,
! [W0_295] :
( ( sdtpldt0(xl,W0_295) = sdtpldt0(W0_295,xl) )
| ~ aElement0(W0_295) ),
inference(resolution,[status(thm)],[c_478,c_1090]) ).
tff(c_15202,plain,
sdtpldt0(xy,xl) = sdtpldt0(xl,xy),
inference(resolution,[status(thm)],[c_944,c_15014]) ).
tff(c_15213,plain,
sdtpldt0(xn,xl) = sdtpldt0(xl,xn),
inference(resolution,[status(thm)],[c_373,c_15014]) ).
tff(c_2784,plain,
! [W2_192] :
( ( sdtpldt0(xm,sdtpldt0(xn,W2_192)) = sdtpldt0(xy,W2_192) )
| ~ aElement0(W2_192)
| ~ aElement0(xn)
| ~ aElement0(xm) ),
inference(superposition,[status(thm),theory(equality)],[c_140,c_2671]) ).
tff(c_2840,plain,
! [W2_192] :
( ( sdtpldt0(xm,sdtpldt0(xn,W2_192)) = sdtpldt0(xy,W2_192) )
| ~ aElement0(W2_192) ),
inference(demodulation,[status(thm),theory(equality)],[c_416,c_373,c_2784]) ).
tff(c_15410,plain,
( ( sdtpldt0(xm,sdtpldt0(xl,xn)) = sdtpldt0(xy,xl) )
| ~ aElement0(xl) ),
inference(superposition,[status(thm),theory(equality)],[c_15213,c_2840]) ).
tff(c_15437,plain,
sdtpldt0(xm,sdtpldt0(xl,xn)) = sdtpldt0(xl,xy),
inference(demodulation,[status(thm),theory(equality)],[c_478,c_15202,c_15410]) ).
tff(c_146,plain,
aElementOf0(sdtpldt0(xl,xn),xJ),
inference(cnfTransformation,[status(thm)],[f_226]) ).
tff(c_351,plain,
( aElement0(sdtpldt0(xl,xn))
| ~ aSet0(xJ) ),
inference(resolution,[status(thm)],[c_146,c_320]) ).
tff(c_1193,plain,
aElement0(sdtpldt0(xl,xn)),
inference(demodulation,[status(thm),theory(equality)],[c_374,c_351]) ).
tff(c_154,plain,
sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) != sdtpldt0(xx,xy),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_2690,plain,
( ( sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy) )
| ~ aElement0(sdtpldt0(xl,xn))
| ~ aElement0(xm)
| ~ aElement0(xk) ),
inference(superposition,[status(thm),theory(equality)],[c_2671,c_154]) ).
tff(c_2787,plain,
sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(xx,xy),
inference(demodulation,[status(thm),theory(equality)],[c_452,c_416,c_1193,c_2690]) ).
tff(c_235177,plain,
sdtpldt0(xk,sdtpldt0(xl,xy)) != sdtpldt0(xx,xy),
inference(demodulation,[status(thm),theory(equality)],[c_15437,c_2787]) ).
tff(c_235390,plain,
~ aElement0(xy),
inference(superposition,[status(thm),theory(equality)],[c_2838,c_235177]) ).
tff(c_235394,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_944,c_235390]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : RNG090+1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/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.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 18:07:20 EDT 2023
% 0.15/0.37 % CPUTime :
% 156.07/128.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 156.07/128.23
% 156.07/128.23 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 156.28/128.26
% 156.28/128.26 Inference rules
% 156.28/128.26 ----------------------
% 156.28/128.26 #Ref : 3
% 156.28/128.26 #Sup : 51418
% 156.28/128.26 #Fact : 0
% 156.28/128.26 #Define : 0
% 156.28/128.26 #Split : 61
% 156.28/128.26 #Chain : 0
% 156.28/128.26 #Close : 0
% 156.28/128.26
% 156.28/128.26 Ordering : KBO
% 156.28/128.26
% 156.28/128.26 Simplification rules
% 156.28/128.26 ----------------------
% 156.28/128.26 #Subsume : 4128
% 156.28/128.26 #Demod : 109751
% 156.28/128.26 #Tautology : 13595
% 156.28/128.26 #SimpNegUnit : 342
% 156.28/128.26 #BackRed : 46
% 156.28/128.26
% 156.28/128.26 #Partial instantiations: 0
% 156.28/128.26 #Strategies tried : 1
% 156.28/128.26
% 156.28/128.26 Timing (in seconds)
% 156.28/128.26 ----------------------
% 156.28/128.26 Preprocessing : 0.64
% 156.28/128.26 Parsing : 0.31
% 156.28/128.26 CNF conversion : 0.06
% 156.28/128.26 Main loop : 126.54
% 156.28/128.26 Inferencing : 6.40
% 156.28/128.26 Reduction : 97.81
% 156.28/128.26 Demodulation : 93.10
% 156.28/128.26 BG Simplification : 0.52
% 156.28/128.26 Subsumption : 17.44
% 156.28/128.26 Abstraction : 0.95
% 156.28/128.26 MUC search : 0.00
% 156.28/128.26 Cooper : 0.00
% 156.28/128.26 Total : 127.24
% 156.28/128.26 Index Insertion : 0.00
% 156.28/128.26 Index Deletion : 0.00
% 156.28/128.26 Index Matching : 0.00
% 156.28/128.26 BG Taut test : 0.00
%------------------------------------------------------------------------------